Heap-Bounded Assembly Language

Journal of Automated Reasoning

Volumn 31, Issue 3-4, 2003, Pages 261-302

  Aspinall, David ^a   Compagnoni, Adriana ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b Stevens Institute of Technology   (United States)

Author keywords

Proof carrying code; Typed assembly language

Indexed keywords

ABSTRACTING; COMPUTER SIMULATION; COMPUTER SOFTWARE; ERROR ANALYSIS; INTERNET; JAVA PROGRAMMING LANGUAGE; LEARNING SYSTEMS; OPTIMIZATION; SEMANTICS;

PROOF-CARRYING CODE; TYPED ASSEMBLY LANGUAGE;

SECURITY OF DATA;

EID: 1942439908     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/b:jars.0000021014.79255.33     Document Type: Article

References (37)

1. Appel, A. W. and Felty, A. P.: A semantic model of types and machine instructions for proof-carrying code, in Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '00), 2000, pp. 243-253.
2. Aspinall, D. and Hofmann, M.: Another type system for in-place update, in Proceedings ESOP 2002 - European Symposium on Programming, 2002.
3. Baker, H.: Lively linear LISP - Look Ma, no garbage, ACM Sigplan Notices 27(8) (1992), 89-98.
4. Banerjee, A., Heintze, N. and Riecke, J. G.: Region analysis and the polymorphic lambda calculus, in Proceedings, Fourteenth Annual IEEE Symposium on Logic in Computer Science, 1999, pp. 88-97.
5. Crary, K., Glew, N., Grossman, D., Samuels, R., Smith, F., Walker, D., Weirich, S. and Zdancewic, S.: TALx86: A realistic typed assembly language, in 1999 ACM SIGPLAN Workshop on Compiler Support for System Software, Atlanta, GA, USA, 1999, pp. 25-35.
6. Crary, K. and Morrisett, G.: Type structure for low-level programming langauges, in Proceedings of the International Colloquium on Automata, Languages, and Programming, Prague, Czech Republic, 1999, pp. 40-54.
7. Crary, K. and Weirich, S.: Resource bound certification, in Proceedings of the 27th Symp. Principles of Prog. Lang. (POPL), 2000, pp. 184-198.
8. Girard, J.-Y.: Linear logic, Theoret. Comput. Sci. 50 (1987), 1-102.
9. Harper, R. and Morrisett, G.: Compiling polymorphism using intensional type analysis, in Proceedings of the ACM Symposium on Principles of Programming Languages, San Francisco, 1995, pp. 130-141.
10. Hofmann, M.: Linear types and non-size-increasing polynomial time computation, in Proceedings of the 14th Symposium on Logic in Computer Science (LICS '99), 1999a.
11. Hofmann, M.: Typed lambda calculi for polynomial-time computation, Habilitation thesis, TU Darmstadt, Germany. Edinburgh University LFCS Technical Report, ECS-LFCS-99-406, 1999b.
12. Hofmann, M.: Programming languages capturing complexity classes, SIGACT News Logic Column 9 (2000a).
13. Hofmann, M.: A type system for bounded space and functional in-place update, Nordic Journal of Computing 7(4) (2000b), 258-289. An extended abstract appeared in G. Smolka (ed.), Programming Languages and Systems, Springer LNCS, 2000.
14. Hofmann, M.: A type system for bounded space and functional in-place update, Nordic Journal of Computing 7(4) (2000b), 258-289. An extended abstract appeared in G. Smolka (ed.), Programming Languages and Systems, Springer LNCS, 2000.
15. Hofmann, M.: The strength of non-size-increasing computation, in Proceedings ACM Principles of Programming Languages, 2002.
16. Jim, T., Morrisett, G., Grossman, D., Hicks, M., Cheney, J. and Wang, Y.: Cyclone: A safe dialect of C, in USENIX Annual Technical Conference, Monterey, CA, 2002.
17. Kobayashi, N.: Quasi-linear types, in Proceedings ACM Principles of Programming Languages, 1999, pp. 29-42.
18. Lafont, Y.: The linear abstract machine, Theoret. Comput. Sci. 59 (1988), 157-180.
19. Morrisett, G.: Compiling with types, Ph.D. thesis, Carnegie Mellon University, Pittsburgh. Tech Report CMU-CS-95-226, 1995.
20. Morrisett, G., Crary, K., Glew, N. and Walker, D.: Stack-based typed assembly language, in Second International Workshop on Types in Compilation, Kyoto, pp. 95-117. Published in Xavier Leroy and Atsushi Ohori (eds.), Lecture Notes in Comput. Sci. 1473, Springer-Verlag, 1998, pp. 28-52.
21. Morrisett, G., Crary, K., Glew, N. and Walker, D.: Stack-based typed assembly language, in Second International Workshop on Types in Compilation, Kyoto, pp. 95-117. Published in Xavier Leroy and Atsushi Ohori (eds.), Lecture Notes in Comput. Sci. 1473, Springer-Verlag, 1998, pp. 28-52.
22. Morrisett, G., Walker, D., Crary, K. and Glew, N.: From system F to typed assembly language, ACM Trans. on Programming Languages and Systems 21(3) (1999), 528-569.
23. Necula, G. C., McPeak, S. and Weimer, W.: CCured: Type-safe retrofitting of legacy code, in Proceedings ACM Principles of Programming Languages, 2002.
24. O'Hearn, P. W. and Pym, D. J.: The logic of bunched implications, Bull. Symbolic Logic 5(2) (1999), 215-243.
25. Shao, Z.: Typed common intermediate format, in 1997 USENIX Conference on Domain-Specific Languages, Santa Barbara, CA, 1997.
26. Shao, Z., League, C. and Monnier, S.: Implementing typed intermediate languages, in Proc. 1998 ACM SIGPLAN International Conference on Functional Programming (ICFP'98), Baltimore, Maryland, 1998, pp. 313-323.
27. Smith, F., Walker, D. and Morrisett, G.: Alias types, in G. Smolka (ed.), Ninth European Symposium on Programming, LNCS 1782, Springer-Verlag, 2000, pp. 366-381.
28. Stata, R. and Abadi, M.: A type system for Java bytecode subroutines, ACM Trans. on Programming Languages and Systems 21(1) (1996), 90-137.
29. Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, R. and Lee, P.: TIL: A type-directed optimizing compiler for ML, in Proceedings of 1996 SIGPLAN Conference on Programming Language Design and Implementation, 1996, pp. 181-192.
30. Tofte, M. and Birkedal, L.: Region inference algorithm, ACM Trans. on Programming Languages and Systems 20(5) (1998), 724-767.
31. Tofte, M. and Talpin, J.-P.: Region-based memory management, Inform. and Comput. 132(2) (1997), 109-176.
32. Turner, D. and Wadler, P.: Operational interpretations of linear logic, Theoret. Comput. Sci. 227(1-2) (1999), 231-248.
33. Wadler, P.: Linear types can change the world!, in M. Broy and C. Jones (eds.), IFIP TC 2 Working Conference on Programming Concepts and Methods, Sea of Galilee, Israel, North-Holland, 1990, pp. 347-359.
34. Wadler, P.: Is there a use for linear logic?, in ACM Conference on Partial Evaluation and Semantics-Based Program Manipulation, New Haven, Connecticut, 1991.
35. Walker, D. and Morrisett, G.: Alias types for recursive data structures, in Third International Workshop on Types in Compilation, Montreal, Canada, 2000.
36. Wilhelm, R., Sagiv, M. and Reps, T.: Shape analysis, in Proceedings Compiler Construction, CC 2000, 2000.
37. Xi, H. and Harper, R.: A dependently typed assembly language, Technical Report OGI-CSE-99-008, Oregon Graduate Institute of Science and Technology, 1999.