Input-output model programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5684 LNCS, Issue , 2009, Pages 322-335

  Veanes, Margus ^a   Bjørner, Nikolaj ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT STATE MACHINES; BACKGROUND THEORY; BEHAVIORAL SPECIFICATION; BOUNDED GAMES; CONFORMANCE CHECKING; INPUT OUTPUT MODEL; LINEAR ARITHMETIC; MODEL PROGRAMS; REACTIVE SYSTEM;

COMPUTER SCIENCE; GAME THEORY; THEOREM PROVING;

INPUT OUTPUT PROGRAMS;

EID: 70349329809     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03466-4_21     Document Type: Conference Paper

References (32)

1. Alur, R., Henzinger, T.A.: A really temporal logic. In: Proc. 30th Symp. on Foundations of Computer Science, pp. 164-169 (1989)
2. Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.: Alternating refinement relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.1466, pp. 163-178. Springer, Heidelberg (1998)
3. AsmL, http://research.microsoft.com/fse/AsmL/
4. Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.1579, pp. 193-207. Springer, Heidelberg (1999)
5. Bjørner, D., Henson, M. (eds.): Logics of Specification Languages. Springer, Heidelberg (2008)
6. Bjørner, N., Dutertre, B., de Moura, L.: Accelerating Lemma Learning using Joins- DPPL(Join). In: Proceedings of short papers at LPAR 2008 (2008)
7. Bjørner, N., Gurevich, Y., Schulte,W., Veanes,M.: Symbolic bounded model checking of abstract state machines. Technical Report MSR-TR-2009-2014, Microsoft Research (February 2009) (submitted to IJSI)
8. Blass, A., Gurevich, Y., Nachmanson, L., Veanes,M.: Play to test. Technical Report MSR-TR-2005-04, Microsoft Research (January 2005) Short version appears. In: Grieskamp,W.,Weise, C. (eds.) FATES 2005. LNCS, vol.3997, pp. 32-46. Springer, Heidelberg (2006)
9. Bryant, R.E., German, S.M., Velev, M.N.: Exploiting positive equality in a logic of equality with uninterpreted functions. In: Halbwachs, N., Peled, D.A. (eds.) CAV1999. LNCS, vol.1633, pp. 470-482. Springer, Heidelberg (1999)
10. Burch, J.R., Dill, D.L.: Automatic verification of pipelined microprocessor control. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.818, pp. 68-80. Springer, Heidelberg (1994)
11. de Alfaro, L.: Game models for open systems. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol.2772, pp. 269-289. Springer, Heidelberg (2004)
12. de Alfaro, L., Henzinger, T.A.: Interface automata. In: ESEC/FSE, pp. 109-120. ACM Press, New York (2001)
13. de Moura, L., Bjørner, N.S.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.4963, pp. 337-340. Springer, Heidelberg (2008)
14. de Moura, L., Rueß, H., Sorea, M.: Lazy theorem proving for bounded model checking over infinite domains. In: Voronkov, A. (ed.) CADE 2002. LNCS, vol.2392, pp. 438-455. Springer, Heidelberg (2002)
15. Fisher, M.J., Rabin, M.O.: Super-exponential complexity of presburger arithmetic. In: Caviness, B.F., Johnson, J.R. (eds.) Quantifier Elimination and Cylindrical Algebraic Decomposition, pp. 122-135. Springer, Heidelberg (1998);
16. Reprint from SIAM-AMS Proceedings, vol.VII, pp. 27-41 (1974)
17. Grieskamp, W., MacDonald, D., Kicillof, N., Nandan, A., Stobie, K., Wurden, F.: Model-based quality assurance of Windows protocol documentation. In: First International Conference on Software Testing, Verification and Validation, ICST, Lillehammer, Norway (April 2008)
18. Gurevich, Y.: Evolving Algebras 1993: Lipari Guide. In: Specification and Validation Methods, pp. 9-36. Oxford University Press, Oxford (1995)
19. Gurevich, Y., Rossman, B., Schulte, W.: Semantic essence of AsmL. Theor. Comput. Sci. 343(3), 370-412 (2005)
20. Halpern, J.Y.: Presburger arithmetic with unary predicates is ?1 1 complete. Journal of Symbolic Logic 56, 637-642 (1991)
21. Jackson, D.: Software Abstractions. MIT Press, Cambridge (2006)
22. Jacky, J., Veanes, M., Campbell, C., Schulte, W.: Model-based Software Testing and Analysis with C#. Cambridge University Press, Cambridge (2008)
23. SMB2 (2008), http://msdn2.microsoft.com/en-us/library/cc246482.aspx
24. Tretmans, J.: Model based testing with labelled transition systems. In: Hierons, R.M., Bowen, J.P., Harman, M. (eds.) FORTEST. LNCS, vol.4949, pp. 1-38. Springer, Heidelberg (2008)
25. Tseitin, G.S.: On the complexity of derivations in the propositional calculus. Studies in Mathematics and Mathematical Logic, Part II, 115-125 (1968)
26. Veanes, M., Bjørner, N.: Symbolic bounded conformance checking of model programs. Technical Report MSR-TR-2009-2028, Microsoft Research (March 2009)
27. Veanes, M., Bjørner, N., Raschke, A.: An SMT approach to bounded reachability analysis of model programs. In: Suzuki, K., Higashino, T., Yasumoto, K., El-Fakih, K. (eds.) FORTE 2008. LNCS, vol.5048, pp. 53-68. Springer, Heidelberg (2008)
28. Veanes, M., Campbell, C., Grieskamp,W., Schulte,W., Tillmann, N., Nachmanson, L.: Model-based testing of object-oriented reactive systems with Spec Explorer. In: Hierons, R.M., Bowen, J.P., Harman, M. (eds.) FORTEST. LNCS, vol.4949, pp. 39-76. Springer, Heidelberg (2008)
29. Veanes, M., Campbell, C., Schulte, W., Tillmann, N.: Online testing with model programs. In: ESEC/FSE-13, pp. 273-282. ACM Press, New York (2005)
30. Veanes, M., Saabas, A.: On bounded reachability of programs with set comprehensions. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS, vol.5330, pp. 305-317. Springer, Heidelberg (2008)
31. Veanes, M., Saabas, A., Bjørner, N.: Bounded reachability of model programs. Technical Report MSR-TR-2008-2081, Microsoft Research (May 2008)
32. Yannakakis, M.: Testing, optimization, and games. In: Proceedings of the Nineteenth Annual IEEE Symposium on Logic In Computer Science, LICS 2004, pp. 78-88. IEEE, Los Alamitos (2004)