Verification of ASM refinements using generalized forward simulation

Journal of Universal Computer Science

Volumn 7, Issue 11, 2001, Pages 952-979

  Schellhorn, Gerhard ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

Abstract State Machines; Commuting Diagrams; Compiler Verification; Correctness Proofs; Data Refinement; Dynamic Logic; Forward Simulation; I O Automata; Interactive Theorem Proving; Refinement; Transition Systems

Indexed keywords

EID: 0842296524     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (34)

1. [AL91] M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 2:253-284, May 1991. Also appeared as SRC Research Report 29.
2. [BHMY89] W. R. Bevier, W. A. Jr. Hunt, J S. Moore, and W. D. Young. An approach to systems verification. Journal of Automated Reasoning, 5(4):411-428, December 1989.
3. [BM96] E. Börger and S. Mazzanti. A Practical Method for Rigorously Controllable Hardware Design. In J.P. Bowen, M.B. Hinchey, and D. Till, editors, ZUM'97: The Z Formal Specification Notation, volume 1212 of LNCS, pages 151-187. Springer, 1996.
4. [BR95] E. Börger and D. Rosenzweig. The WAM-definition and compiler correctness. In Christoph Beierle and Lutz Plümer, editors, Logic Programming: Formal Methods and Practical Applications, volume 11 of Studies in Computer Science and Artificial Intelligence. North-Holland, Amsterdam, 1995.
5. [BS98] E. Börger and W. Schulte. Defining the Java Virtual Machine as Platform for Provably Correct Java Compilation. In Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science, volume 1450 of LNCS, page 17ff. Springer, 1998.
6. [BS00a] E. Börger and J. Schmid. Composition and Submachine Concepts for Sequential ASMs. In P. Clote and H. Schwichtenberg, editors, Proc. 14th International Workshop Computer Science Logic (Gurevich Festschrift), LNCS 1862, pages 41-60. Springer, 2000.
7. [BS00b] E. Börger and W. Schulte. A Practical Method for Specification and Analysis Exception Handling - A Java/JVM Case Study. Journal of Software Engineeering, 26(9):872-887, September 2000.
8. [Cyr93] D. Cyrluk. Microprocessor Verification in PVS: A Methodology and Simple Example. Technical Report SRI-CSL-93-12, Computer Science Laboratory, SRI International, December 1993.
9. [DB01] J. Derrick and E. Boiten. Refinement in Z and in Object-Z : Foundations and Advanced Applications. FACIT. Springer, 2001.
10. [Dol98] A. Dold. A Formal Representation of Abstract State Machines using PVS. Verifix-Report Ulm 6.2, Universität Ulm, 1998. (revised version).
11. [dRE98] W. de Roever and K. Engelhardt. Data Refinement: Model-Oriented Proof Methods and their Comparison, volume 47 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, New York, NY, 1998.
12. [GDG+96] W. Goerigk, A. Dold, Th. Gaul, G. Goos, A. Heberle, F.W. von Henke, U. Hoffmann, H. Langmaack, H. Pfeifer, H. Rueß, and W. Zimmermann. Compiler correctness and implementation verification: The verifix approach. Technical Report LiTH-IDA-R-96-12, Linkoping University, 1996.
13. [GM91] P. H. B. Gardiner and C. C. Morgan. Data refinement of predicate transformers. Theoretical Computer Science, 87, 1991.
14. [GR95] R. Groenboom and G. Renardel de Lavalette. A Formalization of Evolving Algebras. In Proceedings of Accolade-95. Dutch Research School in Logic, 1995.
15. [GS97] Y. Gurevich and M. Spielmann. Recursive Abstract State Machines. Journal of Universal Computer Science, 3(4):233-246, 1997.
16. [Gur95] M. Gurevich. Evolving algebras 1993: Lipari guide. In E. Börger, editor, Specification and Validation Methods. Oxford University Press, 1995.
17. [GV98] W.O.D. Griffioen and F.W. Vaandrager. Normed simulations. In A.J. Hu and M.Y. Vardi (eds), editors, Proceedings CAV'98, volume 1427 of LNCS, pages 332-344, Vancouver, BC, Canada, 1998.
18. [Har79] D. Harel. First Order Dynamic Logic. LNCS 68. Springer, Berlin, 1979.
19. [Hoa69] C.A.R. Hoare. An axiomatic basis for computer programming. COMM ACM, pages 576-580, 1969.
20. [Jon90] C. B. Jones. Systematic Software Development using VDM. Prentice Hall, 2nd edition, 1990.
21. [LT89] Nancy Lynch and Mark Tuttle. An introduction to input/output automata. CWI-Quarterly, Centrum voor Wiskunde en Informatica, Amsterdam, 1989.
22. [LV95] N. Lynch and F. Vaandrager. Forward and Backward Simulations - Part I: Untimed systems. Information and Computation, 121(2):214-233, September 1995. also: Technical Memo MIT/LCS/TM-486.b, Laboratory for Computer Science, MIT.
23. [McG72] C.L. McGowan. An inductive proof technique for interpreter equivalence. In R. Rustin, editor, Formal Semantics of Programming Languages, pages 139 - 147. Englewood Cliffs, 1972.
24. [Moo88] J Moore. PITON: A Verified Assembly Level Language. Technical report 22, Computational Logic Inc., 1988. available at the URL:http://www.cli.com.
25. [Pus96] C. Pusch. Verification of compiler correctness for the WAM. In J.Harrison J. von Wright, J.Grundy, editor, Theorem Proving in Higher Order Logics (TPHOLs'96), volume 1125 of LNCS, pages 347-362. Springer, 1996.
26. [RSS95] S. Rajan, N. Shankar, and M.K. Srivas. An integration of model-checking with automated proof checking. In Pierre Wolper, editor, Computer-Aided Verification, CAV '95, volume 939 of Lecture Notes in Computer Science, pages 84-97, Liege, Belgium, June 1995. Springer-Verlag.
27. [RSSB98] W. Reif, G. Schellhorn, K. Stenzel, and M. Balser. Structured specifications and interactive proofs with KIV. In W. Bibel and P. Schmitt, editors, Automated Deduction - A Basis for Applications. Kluwer Academic Publishers, Dordrecht, 1998.
28. [SA97] G. Schellhorn and W. Ahrendt. Reasoning about Abstract State Machines: The WAM Case Study. Journal of Universal Computer Science (J. UCS), 3(4):377-413, 1997. available at http://hyperg.iicm.tu-graz.ac.at/jucs/.
29. [SA98] G. Schellhorn and W. Ahrendt. The WAM Case Study: Verifying Compiler Correctness for Prolog with KIV. In W. Bibel and P. Schmitt, editors, Automated Deduction - A Basis for Applications, volume III: Applications, chapter 3: Automated Theorem Proving in Software Engineering. Kluwer Academic Publishers, 1998.
30. [Sch95] A. Schönegge. Extending Dynamic Logic for Reasoning about Evolving Algebras. Technical Report 49/95, Fakultät für Informatik, Universität Karlsruhe, 76128 Karlsruhe, Germany, 1995.
31. [Sch99] G. Schellhorn. Verification of Abstract State Machines. PhD thesis, Universität Ulm, Fakultät für Informatik, 1999. (available at www.Informatik.uni-augsburg.de/swt/fmg/papers/).
32. [SN01] R. F. Stärk and S. Nanchen. A Complete Logic for Abstract State Machines. Journal of Universal Computer Science (J. UCS), Abstract State Machines 2001: Theory and Applications, 2001. (this volume).
33. [Spi88] J. M. Spivey. Understanding Z. Cambridge University Press, 1988.
34. [SSB01] R.F. Stärk, J. Schmid, and E. Börger. Java and the Java Virtual Machine: Definition, Verification, Validation. Springer, 2001.