Reasoning about static and dynamic properties in alloy: A purely relational approach

ACM Transactions on Software Engineering and Methodology

Volumn 14, Issue 4, 2005, Pages 478-526

  Frias, Marcelo F ^a   López Pombo, Carlos G ^a   Baum, Gabriel A ^b,e   Aguirre, Nazareno M ^c   Maibaum, Thomas S E ^d  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b UNIVERSIDAD NACIONAL DE LA PLATA   (Argentina)

^c DEPARTAMENTO DE QUÍMICA   (Argentina)

^d MCMASTER UNIVERSITY   (Canada)

^e FACULTAD DE CIENCIAS EXACTAS   (Argentina)

Author keywords

Alloy; Fork algebras; Relational specifications

Indexed keywords

AUTOMATIC ANALYSIS; DYNAMIC LOGIC; FORK ALGEBRAS; RELATIONAL SPECIFICATIONS;

ABSTRACTING; ALGEBRA; AUTOMATION; FORMAL LOGIC; LOGIC DESIGN; PROBLEM SOLVING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33745161834     PISSN: 1049331X     EISSN: 1049331X     Source Type: Journal    
DOI: 10.1145/1101815.1101819     Document Type: Article

References (37)

1. ABBIAL, J. 1996. The B-Book: assigning programs to meanings. Cambridge University Press, New York, NY.
2. ARKOUDAS, K. 2000. Denotational proof languages. Ph.D. thesis, Massachusetts Institute of Technology.
3. AEKOUDAS, K., KHURSHID, S., MAHINOV, D., AND RINARD, M. 2004. Integrating model checking and theorem proving for relational reasoning. In Proceedings of the 7th Conference on Relational Methods in Computer Science (RelMiCS)-2nd, International Workshop on Applications of Kleene Algebra, R. Berghammer and B. Möller, Eds. Lecture Notes in Computer Science, vol. 3051. Springer-Verlag, Malente, Germany, 204-213.
4. BICKFORD, M. AND GUASPARI, D. 1998. Lightweight analysis of UML. Tech. Rep. TM-98-0036, Odyssey Research Associates, Ithaca, NY, November.
5. BOOCH, G., RUMBAUOH, J., AND JACOBSON, I. 1998. The Unified Modeling Language User Guide. Addison-Wesley Longman Publishing Co., Inc., Boston, MA.
6. BURRIS, S. AND SANKAPPANAVAR, H. P. 1981. A Course in Universal Algebra. Graduate Texts in Mathematics. Springer-Verlag, Berlin, Germany.
7. CLARKE, E. M., GRUMBERG, O., AND PELED, D. 2000. Model Checking. MIT Press, Cambridge, MA.
8. CLEAVELAND, R., KLEIN, M., AND STEFFEN, B. 1993. Faster model checking for the modal mu-calculus. In Proceedings of Computer Aided Verification (CAV), G. von Bochmann and D. K. Probst, Eds. Lecture Notes in Computer Science, vol. 663. Springer-Verlag, Montreal, Canada, 410-422.
9. DIJKSTRA, E. W. AND SCHOLTEN, C. S. 1990. Predicate Calculus and Program Semantics. Springer-Verlag, New York, NY.
10. DOWEK, G., FELTY, A., HERBELIN, H., HUET, G., MURTHY, C., PARENT, C., PAULIN-MOHRING, C., AND WERNER, B. 1993. The coq proof assistant user's guide (version 5.8). Tech. Rep. 154, INRIA, Rocquencourt, France.
11. FRIAS, M. F. 2002. Fork Algebras in Algebra, Logic and Computer Science. Advances in Logic, vol. 2. World Scientific Publishing Co., Singapore.
12. FRIAS, M. F., BAUM, G. A., AND MAIBAUM, T. S. E. 2002. Interpretability of first-order dynamic logic in a relational calculus. In Proceedings of the 6th. Conference on Relational Methods in Computer Science (RelMiCS) - TARSKI, H. de Swart, Ed. Lecture Notes in Computer Science, vol. 2561. Springer-Verlag, Oisterwijk, The Netherlands, 66-80.
13. FRIAS, M. F., HAEBERER, A. M., AND VELOSO, P. A. S. 1997. A finite axiomatization for fork algebras. Logic Journal of the IGPL 5, 3, 311-319.
14. FRIAS, M. F., LOPEZ POMBO, C. G., BAUM, G. A., AGUIRRE, N. M., AND MAIBAUM, T. S. E. 2003. Taking Alloy to the movies. In Proceedings of FM 2003: the 12th International FME Symposium, K. Araki, S. Gnesi, and D. Mandrioli, Eds. Lecture Notes in Computer Science, vol. 2805. Springer-Verlag, Pisa, Italy, 678-697.
15. GORDON, M. J. AND MELHAM, T. P., Eds. 1993. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, New York, NY.
16. HAREL, D., KOZEN, D., AND TIURYN, J. 2000. Dynamic Logic. Foundations of Computing. MIT Press, Cambridge, MA.
17. JACKSON, D. 2000. Automating first-order relational logic. In Proceedings of the 8th ACM SIGSOFT International Symposium on Foundations of Software Engineering. ACM Press, San Diego, California, 130-139.
18. JACKSON, D. 2002a. Alloy: a lightweight object modelling notation. ACM Trans. Soft. Eng. Meth. 11, 2, 256-290.
19. JACKSON, D. 2002b. A Micromodel of Software: Lightweight Modelling and Analysis with Alloy. MIT Laboratory for Computer Science, Cambridge, MA.
20. JACKSON, D., SCHECHTER, I., AND SHLYAHTER, H. 2000. Alcoa: the alloy constraint analyzer. In Proceedings of the 22nd. International Conference on Software Engineering, C. Ghezzi, M. Jazayeri, and A. L. Wolf, Eds. Association for the Computer Machinery and IEEE Computer Society, ACM Press, Limerick, Ireland, 730-733.
21. JACKSON, D., SHLYAKHTER, I., AND SRIDHARAN, M. 2001. A micromodularity mechanism. In Proceedings of the 8th European Software Engineering Conference held together with the 9th ACM SIGSOFT International Symposium on Foundations of Software Engineering. ACM Press, Vienna, Austria, 62-73.
22. JACKSON, D. AND SULLIVAN, K. 2000. COM revisited: tool-assisted modelling of an architectural framework. In Proceedings of the 8th ACM SIGSOFT International Symposium on Foundations of Software Engineering: Twenty-First Century Applications, D. S. Rosenblum, Ed. ACM Press, San Diego, CA, 149-158.
23. JONES, C. 1986. Systematic Software Development Using VDM. Prentice Hall, Hertfordshire, UK.
24. LOPEZ POMBO, C. G., OWRE, S., AND SHANKAR, N. 2002. A semantic embedding of the Ag dynamic logic in PVS. Tech. Rep. SRI-CSL-02-04, Computer Science Laboratory, SRI International. July.
25. MANNA, Z., ANUCHITANUKUL, A., BJØRNER, N., BROWNE, A., CHANG, E., COLON, M., DE ALFARO, L., DEVARAJAN, H., SIPMA, H., AND URIBE, T. 1994. STeP: The Stanford temporal prover. Tech. Rep., Stanford University, Stanford, CA.
26. MCMILLAN, K. L. 1993. Symbolic Model Checking. Kluwer Academic Publishers, Norwell, MA.
27. NIPKOW, T., PAULSON, L. C., AND WENZEL, M. 2002. Isabelle/HOL - A Proof Assistant for Higher-Order Logic. Lecture Notes in Computer Science, vol. 2283. Springer-Verlag, Berlin, Germany.
28. OBJECT MANAGEMENT GROUP. 1997. Object Constraint Language Specification. Object Management Group, Needham, MA, version 1.1.
29. OWRE, S., RUSHBY, J. M., AND SHANKAR, N. 1992. PVS: A prototype verification system. In Proceedings of the 11th International Conference on Automated Deduction (CADE), D. Kapur, Ed. Lecture Notes in Artificial Intelligence, vol. 607. Springer-Verlag, Saratoga, NY, 148-752.
30. OWRE, S., RUSHBY, J. M., SHANKAR, N., AND STRINGER-CALVERT, D. 1998. PVS: an experience report. In Proceedings of Applied Formal Methods - (FM-Trends) '98, D. Hutter, W. Stephan, P. Traverso, and M. Ullman, Eds. Lecture Notes in Computer Science, vol. 1641. Springer-Verlag, Boppard, Germany, 338-345.
31. OWRE, S. AND SHANKAR, N. 1993. Abstract datatypes in PVS. Tech. Rep. SRI-CSL-93-9R, Computer Science Laboratory, SRI International. December. Subtantially revised in June 1997.
32. OWRE, S., SHANKAR, N., RUSHBY, J. M., AND STHINGEH-CALVERT, D. 2001a. PVS Language Reference, Version 2.4 ed. SRI International.
33. OWRE, S., SHANKAR, N., RUSHBY, J. M., AND STRINGER-CALVERT, D. 2001b. PVS Prover Guide, Version 2.4 ed. Computer Science Laboratory, SRI International.
34. OWRE, S., SHANKAR, N., RUSHBY, J. M., AND STRINGER-CALVERT, D. 2001c. PVS System Guide, Version 2.4 ed. Computer Science Laboratory, SRI International.
35. SPIVEY, J. M. 1988. Understanding Z: A Specification Language and its Formal Semantics. Cambridge University Press, New York, NY.
36. TARSKI, A. AND GIVANT, S. 1987. A Farmalization of Set Theory Without Variables. American Mathematical Society Colloqium Publications, Providence, RI.
37. VARDI, M. Y. AND WOLPER, P. 1986. An automata-theoretic approach to automatic program verification (preliminary report). In Proceedings of the Symposium on Logic in Computer Science '86, A. Meyer, Ed. IEEE Computer Society, Cambridge, MA, 332-344.