A compositional logic for control flow

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

Volumn 3855 LNCS, Issue , 2006, Pages 80-94

  Tan, Gang ^a   Appel, Andrew W ^b  

^a BOSTON COLLEGE   (United States)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPOSITIONAL LOGIC; PROGRAM FRAGMENTS; REPEAT-UNTIL-LOOPS; UNSTRUCTURED CONTROL FLOW;

COMPUTER PROGRAMMING LANGUAGES; DATA STORAGE EQUIPMENT; FLOW CONTROL; FORMAL LOGIC; SEMANTICS;

LOGIC PROGRAMMING;

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

References (22)

1. Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the Association for Computing Machinery 12 (1969) 578-580
2. Necula, G.: Proof-carrying code. In: 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New York, ACM Press (1997) 106-119
3. Morrisett, G., Walker, D., Crary, K., Glew, N.: From System F to typed assembly language. ACM Trans, on Programming Languages and Systems 21 (1999) 527-568
4. Appel, A.W.: Foundational proof-carrying code. In: Symposium on Logic in Computer Science (LICS '01), IEEE (2001) 247-258
5. Clint, M., Hoare, C.A.R.: Program proving: Jumps and functions. Acta Informatica (1972) 214-224
6. Kowaltowski, T.: Axiomatic approach to side effects and general jumps. Acta Informatica 7 (1977) 357-360
7. Arbib, M., Alagic, S.: Proof rules for gotos. Acta Informatica 11 (1979) 139-148
8. de Bruin, A.: Goto statements: Semantics and deduction systems. Acta Informatica 15 (1981) 385-424
9. O'Donnell, M.J.: A critique of the foundations of hoare style programming logics. Communications of the Association for Computing Machinery 25 (1982) 927-935
10. Floyd, R.W.: Assigning meanings to programs. In: Proceedings of Symposia in Applied Mathematics, Providence, Rhode Island (1967) 19-32
11. Cardelli, L.: Program fragments, linking, and modularization. In: 24th ACM Symposium on Principles of Programming Languages. (1997) 266-277
12. Glew, N., Morrisett, G.: Type-safe linking and modular assembly language. In: 26th ACM Symposium on Principles of Programming Languages. (1999) 250-261
13. Benton, N.: A typed, compositional logic for a stack-based abstract machine. In: 3rd Asian Symposium on Programming Languages and Systems. (2005)
14. Ni, Z., Shao, Z.: Certified assembly programming with embedded code pointers. In: 33rd ACM Symposium on Principles of Programming Languages. (2006) To appear.
15. Saabas, A., Uustalu, T.: A compositional natural semantics and Hoare logic for low-level languages. In: Proceedings of the Second Workshop on Structured Operational Semantics (SOS'05). (2005)
16. Tan, G.: A Compositional Logic for Control Flow and its Application in Foundational Proof-Carrying Code. PhD thesis, Princeton University (2005)
17. Appel, A.W., McAllester, D.: An indexed model of recursive types for foundational proof-carrying code. ACM Trans. on Programming Languages and Systems 23 (2001) 657-683
18. Tan, G., Appel, A.W., Swadi, K.N., Wu, D.: Construction of a semantic model for a typed assembly language. In: Fifth International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI 04). (2004) 30-43
19. Sørensen, M.H., Urzyczyn, P.: Lectures on the Curry-Howard isomorphism. Available as DIKU Rapport 98/14 (1998)
20. Cook, S.A.: Soundness and completeness of an axiom system for program verification. SIAM Journal on Computing 7 (1978) 70-90
21. Chen, J., Wu, D., Appel, A.W., Fang, H.: A provably sound TAL for back-end optimization. In: ACM Conference on Programming Language Design and Implementation. (2003) 208-219
22. Swadi, K.N.: Typed Machine Language. PhD thesis, Princeton University (2003)