Isomorph-Free Model Enumeration: A New Method for Checking Relational Specifications

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 2, 1998, Pages 302-343

  Jackson, Daniel ^a   Jha, Somesh ^b   Damon, Craig A ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

D.2.1 Software Engineering : Requirements Specifications; D.2.4 Software Engineering : Program Verification; D.2.5 Software Engineering : Testing and Debugging

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; EQUIVALENCE CLASSES; MATHEMATICAL MODELS; PROGRAM DEBUGGING; PROGRAM DIAGNOSTICS; BINARY SEQUENCES; FORMAL LANGUAGES;

PROGRAM VERIFICATION; RELATIONAL MODELS; SOFTWARE SPECIFICATIONS;

SOFTWARE ENGINEERING; COMPUTER SOFTWARE;

PRUNING; RELATIONAL CALCULUS; RELATIONAL SPECIFICATIONS;

EID: 0032010255     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/276393.276396     Document Type: Article

References (55)

1. BENHAMOU, B. AND SAIS, L. 1992. Theoretical study of symmetries in propositional calculus and applications. In Automated Deduction (CADE-11): Proceedings of the 11th International Conference on Automated Deduction (Saratoga Springs, NY, June). Lecture Notes in Artificial Intelligence, vol. 607. Springer-Verlag, Berlin.
2. BENSALEM, S., BOUAJJANI, A., LOISEAUX, C., AND SIFAKIS, J. 1995. Property preserving simulations. In Formal Methods Syst. Des. 6, 1 (Jan.).
3. BERGHAMMER, R. AND HATTENSPERGER, C. 1994. Computer-aided manipulation of relational expressions and formulae using RALF. Tech. Rep., Institut fur Informatik und Praktische Mathematik, Christian-Albrechts Universitat Zu Kiel, Kiel, Germany.
4. BOOCH, G., JACOBSON, I., AND RUMBAUGH, J. 1996. The unified modelling language for object-oriented development. Doc. Set, Version 0.9, Rational Software Corp., Santa Clare, Calif, http://www.rational.com.
5. BOWEN, J. AND GORDON, M. J. C. 1994. Z and HOL. In Proceedings of the Z User Workshop (Cambridge, England). Springer-Verlag Workshops in Computing. Springer-Verlag, Berlin, 141-167.
6. BRYANT, R. E. 1992. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Comput. Surv. 24, 3, 293-318.
7. CHEN, P. 1976. The entity-relationship model - toward a unified view of data. ACM Trans. Database Syst. 1, 1, 9-36.
8. CLARKE, E. M., ENDERS, R., FILKORN, T., AND JHA, S. 1996. Exploiting symmetry in temporal logic model checking. Formal Methods Syst. Des. 9, 1/2 (Aug.).
9. CLARKE, E. M., FILKORN, T., AND JHA, S. 1993. Exploiting symmetry in temporal logic model checking. In Proceedings of the 5th International Conference on Computer-Aided Verification (June).
10. CLARKE, E. M., GRUMBERG, O., AND LONG, D. E. 1992. Model checking and abstraction. In Proceedings of the ACM Symposium of Principles of Programming Languages (Jan.). ACM, New York.
11. CRAWFORD, J. 1992. A theoretical analysis of reasoning by symmetry in first-order logic (extended abstract). In Proceedings of the AAAI-92 Workshop on Tractable Reasoning. AAAI, Menlo Park, Calif., 17-22.
12. DAMON, C. A. AND JACKSON, D. 1996. Efficient search as a means of executing specifications. In Proceedings of the 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '96) (Passau, Germany, Mar.).
13. DAMON, C. A., JACKSON, D., AND JHA, S. 1996. Checking relational specifications with binary decision diagrams. In Proceedings of the 4th ACM SIGSOFT Conference on Foundations of Software Engineering (San Francisco, Calif., Oct.). ACM, New York.
14. DAMS, D., GRUMBERG, O., AND GERTH, R. 1997. Abstract interpretation of reactive systems. ACM Trans. Program. Lang. Syst. 19, 2 (Mar.), 253-291.
15. DICK, A. J. J., KRAUSE, P. J., AND COZENS, J. 1990. Computer-aided transformation of Z into Prolog. Proceedings of the Z User Workshop (Oxford, U.K., 1989), J. E. Nicholls, Ed. Workshops in Computing. Springer-Verlag, Berlin, 71-85.
16. EMERSON, E. A. AND SISTLA, A. P. 1993. Symmetry and model checking. Proceedings of the 5th International Conference on Computer-Aided Verification (June).
17. EMERSON, E. A. AND SISTLA, A. P. 1996. Symmetry and model checking. Formal Methods Syst. Des. 9, 1/2 (Aug.).
18. ENGEL, M. AND SKAKKEBAEK, J. U. 1994. Applying PVS to Z. Tech. Rep. ID/DTU ME 3/1, ProCos Project, Dept. of Computer Science, Technical Univ. of Denmark, Lyngby, Denmark.
19. GIVANT, S. 1988. Tarski's development of logic and mathematics based on the calculus of relations. Colloquia Mathematica Societatis Janos Bolyai 54 (Algebraic Logic, Budapest, Hungary).
20. IP, C. AND DILL, D. 1993. Better verification through symmetry. In Proceedings of the 11th International Symposium on Computer Hardware Description Languages and Their Applications.
21. IP, C. N. AND DILL, D. L. 1996. Better verification through symmetry. Formal Methods Syst. Des. 9, 1/2 (Aug.).
22. JACKSON, D. 1994. Abstract model checking of infinite specifications. In Proceedings of Formal Methods Europe (Barcelona, Spain, Oct.).
23. JACKSON, D. 1996. Nitpick: A checkable specification language. In Proceedings of the Workshop on Formal Methods in Software Practice (San Diego, Calif., Jan.).
24. JACKSON, D. AND DAMON, C. A. 1995. Semi-executable specifications. Tech. Rep. CMU-CS-95-216, School of Computer Science, Carnegie Mellon Univ., Pittsburgh, Pa.
25. JACKSON, D. AND DAMON, C. A. 1996a. Nitpick: A checker for software specifications (reference manual). Tech. Rep. CMU-CS-96-109, School of Computer Science, Carnegie Mellon Univ., Pittsburgh, Pa.
26. JACKSON, D. AND DAMON, C. A. 1996b. Elements of style: Analyzing a software design feature with a counterexample detector. IEEE Trans. Softw. Eng. 22, (July), 484-495.
27. JACKSON, D., JHA, S., AND DAMON, C. A. 1996. Faster checking of software specifications by eliminating isomorphs. In Proceedings of the ACM Symposium on Principles of Programming Languages (St. Petersburg Beach, Fla., Jan.). ACM, New York.
28. JACKY, J. 1997. The Way of Z: Practical Programming with Formal Methods. Cambridge University Press, Cambridge, Mass.
29. JHA, S. 1996. Symmetry and induction in model checking. Doctoral thesis, School of Computer Science, Carnegie Mellon Univ., Pittsburgh, Pa.
30. JIPSEN, P. 1992. Computer-aided investigations of relation algebras. Ph.D. thesis, Dept. of Mathematics, Vanderbilt Univ., Nashville, Tenn.
31. JONES, C. B. 1986. Systematic Software Development Using VDM. Prentice-Hall International, London, U.K.
32. JONES, R. B. 1992. ICL ProofPower. Br. Comput. Soc. Formal Aspects Comput. Sci. Series 3, 1, 1, 10-13.
33. KLUWER. 1996. Issue on symmetry in automatic verification. Formal Methods Syst. Des. 9, 1/2 (Aug.).
34. LARSEN, P. G. AND LASSEN, P. B. 1991. An executable subset of Meta-IV with loose specification. In VDM'91: Formal Software Development Methods, S. Prehn and W. J. Toetenel, Eds. Vol. 1. Lecture Notes in Computer Science, vol. 551. Springer-Verlag, Berlin.
35. MATAGA, P. AND ZAVE, P. 1994. Formal specification of telephone features. In Proceedings of the 8th Z User's Meeting. Springer-Verlag, Berlin, 29-50.
36. MCKAY, B. D. 1981. Practical graph isomorphism. Congressus Numerantium 21, 499-517.
37. MCKAY, B. D. 1994. Nauty user's guide, version 1.5. Computer Science Dept., Australian National Univ., Australia.
38. MCKAY, B. D. 1996. Isomorph-free exhaustive generation. Unpublished manuscript. Computer Science Dept., Australian National Univ., Australia.
39. NG, Y.-C. 1997. A Nitpick specification of IPv6. Senior Honors thesis, Computer Science Dept., Carnegie Mellon Univ., Pittsburgh, Pa.
40. OWRE, S., RUSHBY, J., SHANKAR, N., AND VON HENKE, F. 1995. Formal Verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Trans. Softw. Eng. 21, 2 (Feb.), 107-125.
41. RUMBAUGH, J., BLAHA, M., PREMERLANI, W., EDDY, F., AND LORENSEN, W. 1991. Object-Oriented Modeling and Design. Prentice-Hall, Englewood Cliffs, N.J.
42. SAALTINK, M. AND MEISELS, I. 1996. The Z/EVES reference manual (draft). Tech. Rep. TR-96-5493-03, ORA Canada, Ottawa, Ontario, Canada, December 1995; revised April 1996, 104 pp.
43. SCHMIDT, G. AND STROHLEIN, T. 1993. Relations and Graphs. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, Berlin.
44. SCHOENFELD, W. 1979. An undecidability result for relational algebras. J. Symbol. Logic 44, 1 (Mar.).
45. SELMAN, B., LEVESQUE, H., AND MITCHELL, D. 1992. A new method for solving hard satisfiability problems. In Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92) (San Jose, Calif., July). AAAI, Menlo Park, Calif., 440-446.
46. SHLAER, S. AND MELLOR, S. 1988. Object-Oriented Systems Analysis: Modeling the World in Data. Yourdon Press/Prentice-Hall.
47. SLANEY, J. K. 1994. Finder: Finite domain enumerator, system description. In Proceedings of the 12th International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, 798-801.
48. SPIVEY, J. M. 1992. The Z Notation: A Reference Manual. 2nd ed. Prentice-Hall, Englewood Cliffs, N.J.
49. STARKE, P. 1991. Reachability analysis of Petri nets using symmetry. Syst. Anal. Model. Simul. 8, 4/5, 293-303.
50. TARSKI, A. 1941. On the calculus of relations. J. Symbol. Logic 6, 73-89.
51. VALENTINE, S. H. 1992. Z-, an executable subset of Z. In Proceedings of the Z User Workshop, J. E. Nicholls, Ed. Springer-Verlag Workshops in Computing, Spnnger-Verlag, Berlin.
52. WEST, M. M. AND EAGLESTONE, B. M. 1992. Software development: Two approaches to animations of Z specifications using Prolog. Softw. Eng. J. 7, (July), 264-276.
53. WEYUKER, E. J. AND OSTRAND, T. J. 1980. Theories of program testing and the application of revealing subdomains. IEEE Trans. Softw. Eng. SE-6, (May), 236-245.
54. WOODCOCK, J. AND DAVIES, J. 1996. Using Z: Specification, Refinement, and Proof. Prentice Hall International Series in Computer Science. Pretice-Hall International, London, U.K.
55. ZHANG, J. 1986. Constructing finite algebras with Falcon. J. Autom. Reason. 17, 1, 1-22.