Modular verification of assembly code with stack-based control abstractions

ACM SIGPLAN Notices

Volumn 41, Issue 6, 2006, Pages 401-414

  Feng, Xinyu ^a   Shao, Zhong ^a   Vaynberg, Alexander ^a   Xiang, Sen ^b   Ni, Zhaozhong ^a  

^a Yale University   (United States)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Assembly Code Verification; Modularity; Proof Carrying Code; Stack Based Control Abstractions

Indexed keywords

ABSTRACTING; COMPUTER SOFTWARE; CONTROL SYSTEMS; FORMAL LOGIC; FUNCTIONS; MATHEMATICAL OPERATORS;

ASSEMBLY CODE VERIFICATION; MODULARITY; PROOF-CARRYING CODE; STACK-BASED CONTROL ABSTRACTIONS;

CODES (SYMBOLS);

EID: 33745194613     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1133255.1134028     Document Type: Article

References (41)

1. A. Ahmed and D. Walker. The logical approach to stack typing. In Proc. of the 2003 ACM SIGPLAN Int'l workshop on Types in Lang. Design and Impl., pages 74-85. ACM Press, 2003.
2. A. W. Appel. Compiling with Continuations. Cambridge University Press, New York, 1992.
3. A. W. Appel. Foundational proof-carrying code. In Symp. on Logic in Camp. Sci. (LICS'01), pages 247-258. IEEE Comp. Soc., June 2001.
4. K. R. Apt. Ten years of Hoare's logic: A survey - part I. ACM Trans. on Programming Languages and Systems, 3(4):431-483, 1981.
5. N. Benton. A typed, compositional logic for a stack-based abstract machine. In Proc. Third Asian Symp. on Prog. Lang, and Sys., LNCS 3780, pages 364-380. Springer-Verlag, November 2005.
6. J. Berdine, P. O'hearn, U. Reddy, and H. Thielecke. Linear continuation-passing. Higher Order Symbol. Comput., 15(2-3):181-208, 2002.
7. D. Chase. Implementation of exception handling, Part I. The Journal of C Language Translation, 5(4):229-240, June 1994.
8. W. D. Clinger. Proper tail recursion and space efficiency. In Proc. 1997 ACM Conf. on Prog. Lang. Design and Impl., pages 174-185, New York, 1997. ACM Press.
9. C. Colby, P. Lee, G. Necula, F. Blau, M. Plesko, and K. Cline. A certifying compiler for Java. In Proc. 2000 ACM Conf. on Prog. Lang. Design and Impl., pages 95-107, New York, 2000. ACM Press.
10. M. E. Conway. Design of a separable transition-diagram compiler. Communications of the ACM, 6(7):396-408, July 1963.
11. K. Crary. Toward a foundational typed assembly language. Technical Report CMU-CS-02-196, Carnegie Mellon University, School of Computer Science, Dec. 2002.
12. S. J. Drew, J. Gough, and J. Ledermann. Implementing zero overhead exception handling. Technical Report 95-12, Faculty of Information Technology, Queensland U. of Technology, Brisbane, Australia, 1995.
13. X. Feng, Z. Shao, A. Vaynberg, S. Xiang, and Z. Ni. Modular verification of assembly code with stack-based control abstractions. Technical Report YALEU/DCS/TR-1336 and Coq Implementation, Dept. of Computer Science, Yale University, New Haven, CT, Nov. 2005. http://flint.cs.yale.edu/publications/ sbca.html.
14. N. A. Hamid, Z. Shao, V. Trifonov, S. Monnier, and Z. Ni. A syntactic approach to foundational proof-carrying code. In Proc. Seventeenth Annual IEEE Symposium on Logic In Computer Science (LICS'02), pages 89-100. IEEE Computer Society, July 2002.
15. D. R. Hanson. C Interface & Implementations. Add. Wesley, 1997.
16. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, Oct. 1969.
17. L. Jia, F. Spalding, D. Walker, and N. Glew. Certifying compilation for a language with stack allocation. In Proc. 20th IEEE Symposium on Logic in Computer Science, pages 407-416, June 2005.
18. C. B. Jones. Tentative steps toward a development method for interfering programs. ACM Trans. on Programming Languages and Systems, 5(4):596-619, 1983.
19. C. B. Jones. Systematic software development using VDM. Prentice Hall International (UK) Ltd., 1986.
20. B. W. Kernighan and D. M. Ritchie. The C Programming Language (Second Edition). Prentice Hall, 1988.
21. L. Lamport. The temporal logic of actions. ACM Trans. on Programming Languages and Systems, 16(3):872-923, May 1994.
22. T. Lindholm and F. Yellin. The Java Virtual Machine Specification (Second Edition). Addison-Wesley, 1999.
23. G. Morrisett, K. Crary, N. Clew, and D. Walker. Stack-based typed assembly language. In Proc. 1998 Int'l Workshop on Types in Compilation: LNCS Vol 1473, pages 28-52. Springer-Verlag, 1998.
24. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to typed assembly language. In Proc. 25th ACM Symp. on Principles of Prog. Lang., pages 85-97. ACM Press, Jan. 1998.
25. D. A. Naumann. Predicate transformer semantics of a higher-order imperative language with record subtyping. Science of Computer Programming, 41(1):1-51, 2001.
26. G. Necula. Compiling with Proofs. PhD thesis, School of Computer Science, Carnegie Mellon Univ., Sept. 1998.
27. G. Necula and P. Lee. The design and implementation of a certifying compiler. In Proc. 1998 ACM Conf. on Prog. Lang. Design and Impl., pages 333-344, New York, 1998.
28. Z. Ni and Z. Shao. A translation from typed assembly languages to certified assembly programming. Technical report, Dept. of Computer Science, Yale Univ., New Haven, CT, Nov. 2005. http://flint.cs.yale.edu/flint/ publications/talcap.html.
29. Z. Ni and Z. Shao. Certified assembly programming with embedded code pointers. In Proc. 33rd ACM Symp. on Principles of Prog. Lang., pages 320-333, Jan. 2006.
30. N. Ramsey and S. P. Jones. A single intermediate language that supports multiple implementations of exceptions. In Proc. 2000 ACM Conf. on Prog. Lang. Design and Impl., pages 285-298, 2000.
31. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. 17th Annual IEEE Symposium on Logic in Computer Science, pages 55-74. IEEE Computer Society, 2002.
32. O. Shivers and D. Fisher. Multi-return function call. In Proc. 2004 ACM SIGPLAN Int'l Conf. on Functional Prog., pages 79-89. ACM Press, Sept. 2004.
33. R. Stata and M. Abadi. A type system for java bytecode subroutines. In Proc. 25th ACM Symp. on Principles of Prog. Lang., pages 149-160. ACM Press, 1998.
34. G. L. Steele. Rabbit: a compiler for Scheme. Technical Report AI-TR-474, MIT, Cambridge, MA, 1978.
35. The Coq Development Team. The Coq proof assistant reference manual. The Coq release v8.0, Oct. 2004.
36. J. C. Vanderwaart and K. Crary. A typed interface for garbage collection. In Proc. 2003 ACM SIGPLAN International Workshop on Types in Language Design and Implementation, pages 109-122, 2003.
37. D. von Oheimb. Hoare logic for Java in Isabelle/HOL. Concurrency and Computation: Practice and Experience, 13(13):1173-1214, 2001.
38. A. K. Wright and M. Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38-94, 1994.
39. D. Yu, N. A. Hamid, and Z. Shao. Building certified libraries for PCC: Dynamic storage allocation. In Proc. 2005 European Symposium on Programming, LNCS Vol. 2618, pages 363-379, 2003.
40. D. Yu and Z. Shao. Verification of safety properties for concurrent assembly code. In Proc. 2004 ACM SIGPLAN Int'l Conf. on Functional Prog., pages 175-188, September 2004.
41. Y. Yu. Automated Proofs of Object Code For A Widely Used Microprocessor. PhD thesis, University of Texas at Austin, 1992.