Compositional type systems for stack-based low-level languages

Conferences in Research and Practice in Information Technology Series

Volumn 51, Issue , 2006, Pages

  Saabas, Ando ^a   Uustalu, Tarmo ^a  

^a TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

Author keywords

Certified code; Compilation of proofs; Compositionality; Dataflow analyses; Hoare logics; Low level languages; Type systems; Typings from compilation

Indexed keywords

CERTIFIED CODES; COMPILATION OF PROOFS; COMPOSITIONALITY; HOARE LOGIC; LOW-LEVEL LANGUAGE; TYPE SYSTEMS; TYPINGS FROM COMPILATION;

DATA FLOW ANALYSIS; SEMANTICS; SPECIFICATION LANGUAGES;

COMPUTATION THEORY;

EID: 84863582481     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Appel, A. and McAllester, D. (2001), An indexed model of recursive types for foundational proof-carrying code, ACM Trans. on Program. Lang. and Syst. 23(5), pp. 657-683.
2. Arbib, M. A. and Alagić S. (1979), Proof rules for gotos, Acta Inform. 11, pp. 139-148.
3. Bannwart, F. and Müller, P. (2005), A program logic for bytecode, to appear in 'Proc. of 1st Wksh. on Bytecode Semantics, Verification, Analysis and Transformation, BYTECODE (Edinburgh, UK, 9 Apr. 2005)', Electr. Notes in Theor. Comput. Sci., Elsevier.2005
4. Barthe, G. and Rezk, T. (2005), Non-interference for a JVM-like language, in G. Morrisett, M. Fähndrich, eds., 'Proc. of 2005 ACM SIGPLAN Int. Wksh. on Types in Languages , ACM Press, Design and Implementation, TLDI '05 (Long Beach, CA, Jan. 2005) 103-112.
5. Benton, N. (2004), A typed logic for stacks and jumps, Draft.
6. Benton, N. (2005), A typed, compositional logic for a stack-based abstract machine, Tech. report MSR-TR-2005-84, Microsoft Research, Cambridge; shorter version to appear in K. Yi, ed., 'Proc. of 3rd Asian Symp. on Programming Languages and Systems, APLAS 2005 (Tsukuba, Nov. )', Lect. Notes in Comput. Sci. 3780, Springer-Verlag.2005
7. Clint, M. and Hoare, C. A. R. (1972), Program proving: Jumps and functions, Acta Inform. 1, pp. 214- 224.
8. Cook, S. A. (1978), Soundness and completeness of an axiom system for verification, SIAM J. of Comput. 7, pp. 70-90.
9. de Bruin, A. (1981), Goto statements: Semantics and deduction systems, Acta Inform. 15, pp. 385- 424.
10. Denning, D. E. and Denning, P. J. (1977), Certification of programs for secure information flow, Commun. of ACM 20, pp. 504-513.
11. Floyd, R. W. (1967), Assigning meanings to programs, in J. T. Schwartz, ed., 'Mathematical Aspects of Computer Science', Proc. of Symp. in Appl. Math. 19, AMS, pp. 19-33.
12. Hoare, C. A. R. (1969), An axiomatic basis for computer programming, Commun. of ACM 12, pp. 576-583.
13. Huisman, M. and Jacobs, B. (2000), Java program verification via a Hoare Logic with abrupt termination, in T. Maibaum, ed., 'Proc. of 3rd Int. Conf. on Fundamental Approaches to Software Engineering, FASE 2000 (Berlin, March/Apr. 2000)', Lect. Notes in Comput. Sci. 1783, Springer- Verlag, pp. 284-303.
14. Kobayashi, N. and Kirane, K. (2002), Type-based information analysis for low-level languages, in 'Proc. of 3rd AsianWksh. On Programming Lanaguages and Systems, APLAS'02 (Shanghai, Nov./Dec. 2002)', Shanghai Jiao Tong University, pp. 302- 316.
15. Kowaltowski, T. (1977), Axiomatic approach to side effects and general jumps, Acta Inform. 7, pp. 357-360.
16. Laud, P., Uustalu, T. and Vene, V. (2005), Type systems equivalent to dataflow analyses for imperative languages, in M. Hofmann and H.-W. Loidl, eds., 'Proc. of 3rd APPSEM II Wksh., APPSEM '05 (Frauenchiemsee, Sept. 12 pp., Ludwig-Maximilians-Univ. München. 2005),
17. Morrisett, J. G., Walker, D., Crary, K. and Glew, N. (1999), From system F to typed assembly language, ACM Trans. On Program. Lang. and Syst. 21(3), pp. 527-568.
18. Morrisett, J. G., Crary, K., Glew, N., and Walker, D. (2002), Stack-based typed assembly language, J. of Funct. Program. 12(1), pp. 3-88
19. Naik, M. and Palsberg, J. (2005), In S. Sagiv, ed., 'Proc. of 14th European Symp. on Programming, ESOP 2005 (Edinburgh, Apr. )', Lect. Notes in Comput. Sci. 3444, Springer-Verlag, pp. 374- 388.2005
20. Quigley, C. L. (2003), A programming logic for Java bytecode programs, in D. A. Basin and B. Wolff, eds., 'Proc. of 16th Int. Conf. on Theorem Proving in Higher-Order Logics, TPHOLs 2003 (Rome, Italy, 8-12 Sept. 2003)', Lect. Notes in Comput. Sci. 2758, Springer-Verlag, pp. 41-54.
21. Saabas, A. vUustalu, T. (2005), A compositional natural semantics and Hoare logic for low-level languages, to appear in P.Mosses and I. Ulidowski, eds., 'Proc. of 2nd Wksh. on Structured Operational Semantics, SOS 2005 (Lisbon, July 2005)', Electr. Notes in Theor. Comput. Sci., Elsevier.
22. Schröder, L. and Mossakowski, T. (2003), Monadindependent Hoare logic in HASCASL, in M. Pezzé, ed., 'Proc. of 6th Int. Conf. on Fundamental Approaches to Software Engineering, FASE 2003 (Warsaw, Apr. 2003)', Lect. Notes in Comput. Sci. 2621, Springer-Verlag, pp. 261-277.
23. Schröder, L. and Mossakowski, T. (2004), Generic exception handling and the Java monad, in C. Rattray, S. Maharaj and C. Shankland, eds., 'Proc. of 10th Int. Conf. on Algebraic Methodology and Software Technology, AMAST 2004 (Stirling, July 2004)', Lect. Notes in Comput. Sci. 3116, Springer-Verlag, pp. 443-459.
24. Stata, R. and Abadi, M. (1999), A type system for Java bytecode subroutines, ACM Trans. on Program. Lang. and Syst. 21(1), pp. 90-137.
25. Tan, G. and Appel, A. W. (2005), A compositional logic for control flow, manuscript
26. Tan, G. (2005), A compositional logic for control flow and its application for proof-carrying code, PhD thesis, Princeton Univ.