State isomorphism in model programs with abstract data structures

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

Volumn 4574 LNCS, Issue , 2007, Pages 112-127

  Veanes, Margus ^a   Ernits, Juhan ^b   Campbell, Colin ^c  

^a MICROSOFT RESEARCH   (United States)

^b TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

^c Modeled Computation LLC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; LINEARIZATION; MODEL CHECKING; POLYNOMIAL APPROXIMATION; SET THEORY; SOFTWARE TESTING;

ALGORITHMIC LIMITATIONS; GRAPH ISOMORPHISM; ABSTRACT DATA STRUCTURES; AUTOMATED ANALYSIS; MODEL BASED TESTING; MODELING SOFTWARES; NUMBER OF STATE; SOFTWARE REQUIREMENTS; UNORDERED STRUCTURE;

DATA STRUCTURES; ABSTRACT DATA TYPES;

EID: 38149016090     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73196-2_8     Document Type: Conference Paper

References (27)

1. Blass, A., Gurevich, Y.: Background, reserve, and gandy machines. In: Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic, London, UK, pp. 1-17. Springer-Verlag, Heidelberg (2000)
2. Bosnacki, D., Dams, D., Holenderski, L.: Symmetric spin. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN Model Checking and Software Verification. LNCS, vol. 1885, pp. 1-19. Springer, Heidelberg (2000)
3. Boyapati, C., Khurshid, S., Marinov, D.: Korat: automated testing based on java predicates. SIGSOFT Softw. Eng. Notes 27(4), 123-133 (2002)
4. Campbell, C., Veanes, M.: State exploration with multiple state groupings. In: D. Beauquier, E. Borger, and A. Slissenko, editors, 12th International Workshop on Abstract State Machines, ASM'05, pp. 119-130. Laboratory of Algorithms, Complexity and Logic, Créteil, France (March 2005)
5. Darga, P.T., Boyapati, C.: Efficient software model checking of data structure properties. In: OOPSLA '06: Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications, pp. 363-382. ACM Press, New York, NY, USA (2006)
6. Demartini, C., Iosif, R., Sisto, R.: dSPIN: A dynamic extension of SPIN. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) Theoretical and Practical Aspects of SPIN Model Checking. LNCS, vol. 1680, pp. 261-276. Springer, Heidelberg (1999)
7. Dill, D.L.: The Murphi verification system. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 390-393. Springer, Heidelberg (1996)
8. Fortin, S.: The graph isomorphism problem (1996)
9. Grieskamp, W., Gurevich, Y., Schulte, W., Veanes, M.: Generating finite state machines from abstract state machines. In: ISSTA'02. Software Engineering Notes, vol. 27, pp. 112-122. ACM Press, New York (2002)
10. Grieskamp, W., Tillmann, N., Schulte, W.: XRT -exploring runtime for.Net architecture and applications. Electr. Notes Theor. Comput. Sci. 144(3), 3-26 (2006)
11. Gurevich, Y.: Specification and Validation Methods. In: Evolving Algebras 1993: Lipari Guide (chapter), pp. 9-36. Oxford University Press, Oxford (1995)
12. Iosif, R.: Symmetry reductions for model checking of concurrent dynamic software. STTT 6(4), 302-319 (2004)
13. Ip, C.N., Dil, D.L.: Better verification through symmetry. Form. Methods Syst. Des. 9(1-2), 41-75 (1996)
14. Jacky, I., Veanes, M., Campbell, C., Schulte, W.: Model-based Software Testing and Analysis with C#. Cambridge University Press (Forthcoming 2007)
15. Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25(1), 42-65 (1982)
16. McKay, B.D.: Practical graph isomorphism. Congressus Numerantium 30, 45-87 (1981)
17. Messmer, B.T.: Efficient graph matching algorithms (1995)
18. Miller, A., Donaldson, A., Calder, M.: Symmetry in temporal logic model checking. ACM Comput. Surv. 38(3), 8 (2006)
19. Musuvathi, M., Dill, D.L.: An incremental heap canonicalization algorithm. In: Godefroid, P. (ed.) Model Checking Software. LNCS, vol. 3639, Springer, Heidelberg (2005)
20. Robby, M., Dwyer, B., Hatcliff, J.: Domain-specific model checking using the bogor framework. In: ASE '06: Proceedings of the 21st IEEE International Conference on Automated Software Engineering (ASE'06), pp. 369-370. IEEE Computer Society, Washington, DC, USA (2006)
21. SpecExplorer (2006) http://research.microsoft.com/SpecExplorer
22. Ulimann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31-42 (1976)
23. Utting, M., Legeard, B.: Practical Model-Based Testing - A tools approach. Elsevier Science (2006)
24. Veanes, M., Campbell, C., Grieskamp, W., Nachmanson, L., Schulte, W., Tillmann, N.: Model-based testing of object-oriented reactive systems with Spec Explorer, Tech. Rep. MSR-TR-2005-59, Microsoft Research. Preliminary version of a book chapter in the forthcoming text book Formal Methods and Testing (2005)
25. Veanes, M., Campbell, C., Schulte, W.: Composition of model programs. In the current proceedings (2007)
26. Veanes, M., Campbell, C., Schulte, W., Tillmann, N.: Online testing with model programs. In: ESEC/FSE-13: Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering, pp. 273-282. ACM Press, New York, NY, USA (2005)
27. Xie, T., Marinov, D., Schulte, W., Notkin, D.: Symstra: A framework for generating object-oriented unit tests using symbolic execution. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 365-381. Springer, Heidelberg (2005)