A compositional natural semantics and Hoare logic for low-level languages

Theoretical Computer Science

Volumn 373, Issue 3, 2007, Pages 273-302

  Saabas, Ando ^a   Uustalu, Tarmo ^a  

^a TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

Author keywords

Compilation of proofs; Compositionality; Hoare logics; Low level languages; Natural semantics

Indexed keywords

CODES (SYMBOLS); COMPUTER SCIENCE; FORMAL LOGIC; HIGH LEVEL LANGUAGES; SEMANTICS;

COMPOSITIONALITY; HOARE LOGICS; NATURAL SEMANTICS; PROOF COMPILATION;

MACHINE ORIENTED LANGUAGES;

EID: 33947145531     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.12.020     Document Type: Article

References (19)

1. Appel A., and McAllester D. An indexed model of recursive types for foundational proof-carrying code. ACM Trans. Program. Lang. and Syst. 23 5 (2001) 657-683
2. Arbib M.A., and Alagić S. Proof rules for gotos. Acta Inform. 11 (1979) 139-148
3. Bannwart F., and Müller P. A program logic for bytecode. In: Spoto F. (Ed). Proc. of 1st Wksh. on Bytecode Semantics, Verification, Analysis and Transformation. BYTECODE 2005, 9 April 2005, Edinburgh, UK. Electron. Notes in Theor. Comput. Sci. vol. 141(1) (2005), Elsevier, Amsterdam 255-273
4. N. Benton, A typed logic for stacks and jumps, 2004, unpublished draft
5. Benton N. A typed, compositional logic for a stack-based abstract machine. In: Yi K. (Ed). Proc. of 3rd Asian Symp. on Programming Languages and Systems. APLAS 2005, 2-5 November 2005, Tsukuba, Japan. Lect. Notes in Comput. Sci. vol. 3780 (2005), Springer, Berlin 364-380
6. Clint M., and Hoare C.A.R. Program proving: Jumps and functions. Acta Inform. 1 (1972) 214-224
7. Cook S.A. Soundness and completeness of an axiom system for verification. SIAM J. Comput. 7 (1978) 70-90
8. de Bruin A. Goto statements: Semantics and deduction systems. Acta Inform. 15 (1981) 385-424
9. Floyd R.W. Assigning meanings to programs. In: Schwartz J.T. (Ed). Mathematical Aspects of Computer Science (Proc. of Symp. in Appl. Math., vol. 19) (1967), AMS, Providence, RI 19-33
10. Hoare C.A.R. An axiomatic basis for computer programming. Commun. ACM 12 (1969) 576-583
11. Kowaltowski T. Axiomatic approach to side effects and general jumps. Acta Inform. 7 (1977) 357-360
12. O'Donnell M.J. A critique of the foundations of Hoare style programming logics. Commun. ACM 25 (1982) 927-935
13. Ni Z., and Shao Z. Certified assembly programming with embedded code pointers. Proc. of 33rd ACM SIGPLAN Symp. on Principles of Programming Languages. POPL 2006, 12-14 January 2006, Long Beach, CA, USA (2006), ACM Press, New York 320-333
14. Quigley C.L. A programming logic for Java bytecode programs. In: Basin D.A., and Wolff B. (Eds). Proc. of 16th Int. Conf. on Theorem Proving in Higher-Order Logics. TPHOLs 2003, 8-12 September 2003, Rome, Italy. Lect. Notes in Comput. Sci. Vol. 2758 (2003), Springer, Berlin 41-54
15. Saabas A., and Uustalu T. A compositional natural semantics and Hoare logic for low-level languages. In: Mosses P.D., and Ulidowski I. (Eds). Proc. of 2nd Wksh. on Structured Operational Semantics. SOS 2005, 10 July 2005, Lisbon, Portugal. Electron. Notes Theor. Comput. Sci. vol. 156(1) (2006), Elsevier, Amsterdam 151-168
16. Saabas A., and Uustalu T. Compositional type systems for stack-based low-level languages. In: Jay B., and Gudmundsson J. (Eds). Proc. of 12th Computing, Australasian Theory Symp. CATS 2006, 16-19 January 2006, Hobart, Australia. Confs. in Research and Practice in Inform. Techn. vol. 51 (2006), Australian Comput. Soc., Sydney 27-39
17. A. Saabas, T. Uustalu, Program and proof optimizations with type systems, 2006, manuscript
18. G. Tan, A compositional logic for control flow and its application in proof-carrying code, Ph.D. Thesis, Dept. of Comput. Sci., Princeton University, 2005
19. Tan G., and Appel A.W. A compositional logic for control flow. In: Emerson E.A., and Namjoshi K.S. (Eds). Proc. of 7th Int. Conf. on Verification, Model Checking, and Abstract Interpretation. VMCAI 2006, 8-10 January 2006, Charleston, SC, USA. Lect. Notes in Comput. Sci. vol. 3855 (2006), Springer, Berlin 80-94