Recent publications

• M. Veanes, J. Ernits, and C. Campbell. State Isomorphism in Model Programs with Abstract Data Structures. FORTE'07,  LNCS vol. 4574, pages 112-127, 2007.

• M. Veanes, C. Campbell, and W. Schulte. Composition of Model Programs. FORTE'07, LNCS vol. 4574, pages 128-142, 2007.

• Y. Gurevich, M. Veanes, and Charles Wallace, Can Abstract State Machines Be Useful in Language Theory?, Theoretical Computer Science, 2007.
• M. Veanes and P. Roy and C. Campbell, Online Testing with Reinforcement Learning, Formal Approaches to Software Testing and Runtime Verification, FATES/RV 2006, volume 4262 of LNCS, pages 240-253, 2006.
• M. Veanes, C. Campbell, and W. Schulte, Parallel and Serial Composition of Model Programs, Microsoft Research Technical Report MSR-TR-2007-22, 2007.
• A. Blass, Y.Gurevich, L. Nachmanson, and M. Veanes, Play to Test, Microsoft Research Technical Report MSR-TR-2005-04 (short version with experimental evaluation presented at FATES 2005, LNCS, 2006.)
• M. Veanes, C. Campbell, W. Schulte, N. Tillmann, Online testing with model programs, ESEC/FSE-13,  pages 273-282, ACM press, 2005.
• M. Veanes, C. Campbell, W. Grieskamp, W. Schulte, N. Tillmann, L. Nachmanson, Model-Based Testing of Object-Oriented Reactive Systems with Spec Explorer, Microsoft Research Technical Report MSR-TR-2005-59, 2005. (preliminary version of a chapter in a forthcoming book Formal Methods and Testing)
• C. Campbell, W. Grieskamp, L. Nachmanson, W. Schulte, N. Tillmann, and M. Veanes, Testing Concurrent Object-Oriented Systems with Spec Explorer (extended abstract), FM 2005, LNCS 3582, pages 542-547.
• C. Campbell, M. Veanes, J. Huo, and A. Petrenko, Multiplexing of Partially Ordered Events, TestCom 2005, LNCS vol. 3502, pages 97-110, 2005. (best paper award)
• C. Campbell and M. Veanes, State Exploration with Multiple State Groupings, ASM 2005.
• L. Nachmanson,  M. Veanes, W. Schulte, N. Tillmann and  W. Grieskamp. Optimal Strategies for Testing Nondeterministic Systems. ISSTA'04, Software Engineering Notes, vol. 29, no. 4, 2004.
• U. Glässer, Y. Gurevich and M. Veanes. Abstract Communication Model for Distributed Systems. IEEE Transactions on Software Engineering,  vol. 30, no. 7, pages 458 - 472, 2004.
• W. Grieskamp, N. Tillmann and M. Veanes. Instrumenting Scenarios in a Model-Driven Development Environment. Journal of Information and Software Technology, vol. 46, no. 15, pages 1027 - 1036, 2004
• M. Barnett, W. Grieskamp, L. Nachmanson, W. Schulte, N. Tillmann and M. Veanes. Towards a tool environment for model-based testing with AsmL. In Petrenko and Ulrich, editors, Formal Approaches to Software Testing, FATES 2003, volume 2931 of LNCS, pages 264--280. Springer, 2004.

• M. Barnett, W. Grieskamp, L. Nachmanson, W. Schulte, N. Tillmann, and M. Veanes. Model-Based Testing with AsmL .NET. In proc 1st European Conference on Model-Driven Software Engineering, pp 12-19, 2003.

• M. Barnett, W. Grieskamp, W. Schulte, N. Tillmann, and M. Veanes. Validating Use-Cases with the AsmL Test Tool. Third International Conference on Quality Software. QSIC'2003, 2003.

• W. Grieskamp, Y. Gurevich, W. Schulte and M. Veanes. Generating Finite State Machines from Abstract State Machines in ISSTA 2002, International Symposium on Software Testing and Analysis , July 2002.
• W.Grieskamp, Y.Gurevich, W. Schulte and M. Veanes. Testing with Abstract State Machines. Formal Methods and Tools for Computer Science - EUROCAST'01 - Extended Abstracts , February 2001.
• Y. Gurevich, W. Schulte and M. Veanes, Toward Industrial Strength Abstract State Machines, in Proc ASM 2001, 2001.
• M. Barnett, E. Boerger, Y. Gurevich, W. Schulte, and M. Veanes Using Abstract State Machines at Microsoft: A Case Study, Proc ASM'2000, LNCS, 2000.
• U. Glässer and M. Veanes, Universal Plug and Play Machine Models: Modeling with Distributed Abstract State Machines. In proc Design and Analysis of Distributed Embedded Systems, IFIP 17th World Computer Congress - TC10 Stream on Distributed and Parallel Embedded Systems (DIPES 2002), Kluwer Academic Publishers, 2002
• U. Glässer, Y.Gurevich and M. Veanes, An Abstract Communication Model. Foundations of Software Engineering, Microsoft Research, Microsoft Corporation, Technical Report, MSR-TR-2002-55, May 2002.
• U. Glässer, Y.Gurevich and M. Veanes, High-level Executable Specification of the Universal Plug and Play Architecture. In Proc. of 35th Hawaii International Conference on System Sciences, Software Technology Track, Domain-Specific Languages for Software Engineering, IEEE 2002.
• M. Veanes and R. Yavorsky. Combined Algorithm for Approximating a Finite State Abstraction of a Large System. ICSE 2003/Scenarios Workshop. 2003.

• M. Veanes. Modeling Software: From Theory to Practice, FSTTCS 2002, Kanpur, India. LNCS, 2002. (Paper for invited talk).

• J. Huo, C. Campbell, M. Veanes, and A. Petrenko, Reordering Events of Multi-threaded Programs in Model-Based Testing, Submitted to Software and Systems Modeling.
• J. Helander, R. Serg, M. Veanes, and P. Roy. Adapting Futures: Scalability for Real-World Computing. To appear in RTSS'07.

Older publications

In Refereed Journals and Books

• A. Degtyarev, Yu. Gurevich, P. Narendran, M. Veanes, and A. Voronkov. Decidability and Complexity of Simultaneous Rigid E-Unification with One Variable and Related Results, Theoretical Computer Science, 243(1-2):167-184, Aug 2000.
• J. Levy and M. Veanes, On the Undecidability of Second-Order Unification, Information and Computation, 159(1-2):125-150, Jun 2000.
• M. Veanes, Farmer's Theorem revisited, Information Processing Letters, 74(1-2):47-53, Apr 2000.
• H. Ganzinger, F. Jacquemard, and M. Veanes. Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification, International Journal of Foundations of Computer Science, 11(1):3-28, Mar 2000.
• Yu. Gurevich and M. Veanes. Logic with Equality: Partisan Corroboration and Shifted Pairing, Information and Computation, 152(2):205-235, Aug 1999.
• M. Veanes and J. Barklund. Construction of natural cycletrees. Information Processing Letters, 60:313-318, 1996.
• M. Veanes and J. Barklund. Natural cycletrees: Flexible interconnection graphs. Journal of Parallel and Distributed Computing, 33(1):44-54, 1996.
• M. Veanes and J. Barklund. On the number of edges in cycletrees. Information Processing Letters, 57:225-229, 1996.
• K. Boberg, P. Dell'Acqua, J. Barklund and M. Veanes. Metaprogramming with theory systems. In Meta-logics and Logic Programming. MIT Press, 1995.

In Proceedings

• V. Cortier, H. Ganzinger, F. Jacquemard and M. Veanes. Decidable fragments of simultaneous rigid reachability. ICALP'99. 1999.
• H. Ganzinger, C. Meyer and M. Veanes. The two-variable guarded fragment with transitive relations, LICS'99, p 24-34, IEEE, 1999.
• H. Ganzinger, F. Jacquemard and M. Veanes. Rigid reachability. Asian Computing Science Conference (ASIAN 98), Manila, The Philippines, December 8--10, 1998.
• J. Levy and M. Veanes. On unification problems in restricted second-order languages, CSL'98.
• M. Veanes. The relation between second-order unification and simultaneous rigid E-unification. In Proc. Thirteenth Annual IEEE Symposium on Logic in Computer Science, June 21-24, 1998, Indianapolis, Indiana (LICS'98), pages 264-275, IEEE Computer Society, 1998.
• A. Degtyarev, Yu. Gurevich, P. Narendran, M. Veanes, and A. Voronkov. The decidability of simultaneous rigid E-unification with one variable. In T. Nipkow, editor, Proc. RTA'98, volume 1379 of Lecture Notes in Computer Science, pages 181-195, Springer, 1998.
• M. Veanes. The undecidability of simultaneous rigid E-unification with two variables. 5th Kurt Gödel Colloquium KGC'97, LNCS 1289 pp. 305-318.
• M. Veanes. Uniform representation of recursively enumerable sets with simultaneous rigid E-unification (extended abstract). Proc. 10th International Workshop on Unification (UNIF'96), Munich University, CIS-Bericht-96-91, pp. 7-15, 1996.
• J. Levy and M. Veanes. On unification problems in restricted second-order languages (abstract). In Proc. UNIF 98, 12th International Workshop on Unification, Rome, 29/06-01/07 1998, page 49, Research Report SI-98/8, Univ. of Rome, June 1998.

Technical Reports

• M. Veanes. The Relation Between Second-Order Unification and Simultaneous Rigid E-Unification. Technical Report MPI-I-98-2-005, Max-Planck-Institut f�ür Informatik, February 1998.
• Yu. Gurevich and M. Veanes. Some undecidable problems related to the Herbrand theorem.. UPMAIL Technical Report 138, Uppsala University, Computing Science Department, 1997. Submitted to Information and Computation.
• A. Degtyarev, Yu. Gurevich, P. Narendran, M. Veanes, and A. Voronkov. The decidability of simultaneous rigid E-unification with one variable. UPMAIL Technical Report 139, Uppsala University, Computing Science Department, 1997.
• M. Veanes. On computational complexity of basic decision problems of finite tree automata. UPMAIL Technical Report 133, Uppsala University, Computing Science Department, January 1997.
• M. Veanes. Uniform representation of recursively enumerable sets with simultaneous rigid E-unification. UPMAIL Technical Report 126, Uppsala University, Computing Science Department, July 1996.
• J. Barklund, K. Boberg, P. Dell'Acqua and M. Veanes. Metaprogramming with Theory Systems. UPMAIL Technical Report 106, Uppsala University, Computing Science Department, 1995.
• M. Veanes and J. Barklund. Cycletrees: flexible interconnection graphs for parallel computing. UPMAIL Technical Report 97, Uppsala University, Computing Science Department, 1995.

Theses

• M. Veanes. On Simultaneous Rigid E-Unification. Ph.D thesis, Computing Science Department, Uppsala University, 1997. Uppsala Theses in Computing Science No. 29/97.
• M. Veanes. Cycletrees: a Novel Class of Interconnection Graphs. Ph.L thesis, Computing Science Department, Uppsala University, 1993. Uppsala Theses in Computing Science No. 17/93.

Revised: 10/17/07.