Refining reactive systems in HOL using action systems

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

Volumn 1275, Issue , 1997, Pages 183-197

  Lågbacka, Thomas ^a   von Wright, Joakim ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE REUSABILITY; FORMAL LOGIC;

ACTION SYSTEMS; DATA REFINEMENTS; PROGRAMMING LOGIC; REACTIVE SYSTEM; REASONING ABOUT PROGRAMS; SEQUENTIAL PROGRAMS;

THEOREM PROVING;

EID: 84949671595     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (12)

1. F. Andersen, K.D. Petersen, and J.S. Petterson. A Graphical Tool for Proving UNITY Progress. In T.F. Melham and J. Camilleri, editors, Higher Order Logic Theorem Proving and Its Applications - 7th International Workshop. Valletta, Malta, September 1994, volume 859 of Lecture Notes in Computer Science. Springer Yerlag, 1994.
2. R. Back. Correctness Preserving Program Refinements: Proof Theory and Applications, volume 131 of Mathematical Center Tracts. Mathematical Centre, Amsterdam, 1980.
3. R. Back. A calculus of refinements for program derivations. Acta Informatica, 25:593-624, 1988.
4. R. Back and J. von Wright. Refinement concepts formalized in higher order logic. Formal Aspects of Computing, 2:247-272, 1990.
5. R. Back and J. von Wright. Trace refinement of action systems. Reports on computer science and mathematics 153, Åbo Akademi, 1994. 197
6. M. Butler and T. Långbacka. Program derivation using the refinement calculator. In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics: 9th International Conference, volume 1125 of Lecture Notes in Computer Science, pages 93-108. Springer Verlag, August 1996.
7. A. Camillieri. Mechanizing CSP trace theory in Higher Order Logic. IEEE Transactions on Software Engineering, 16(9):993-1004, 1990.
8. E. Dijkstra. A Discipline of Programming. Prentice-Hall International, 1976.
9. J. Grundy. Window inference in the HOL system. In M. Archer, J.J. Joyce, K.N. Levitt, and P.J. Windley, editors, Proceedings of the International Tutorial and Workshop on the HOL Theorem Proving System and it3 Applications, pages 177-189, University of California at Davis, August 1991. ACM-SIGDA, IEEE Computer Society Press.
10. R. Ruksenas and J. von Wright. A tool for data refinement. To appear as a TUGS Technical Report, Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520 Turku, Finland, 1997.
11. J. von Wright. Program refinement by theorem prover. In BCS FACS Sixth Refinement Workshop - Theory and Practise of Formal Software Development. 5th - 7th January, City University, London, UK., 1994.
12. J. von Wright and T. Långbacka. Using a theorem prover for reasoning about concurrent algorithms. In G. von Boehmann and D.K. Probst, editors, Computer Aided Verification - Fourth International Workshop. CAV '92. Montreal. Canada, June 29 - July 1. 1992, volume 663 of Lecture Notes in Computer Science. Springer Verlag, 1993.