A type system equivalent to a model checker

Lecture Notes in Computer Science

Volumn 3444, Issue , 2005, Pages 374-388

  Naik, Mayur ^a   Palsberg, Jens ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; SEMANTICS; SYNTACTICS;

FINITE-STATE ABSTRACTION; IMPERATIVE PROGRAMS; MODEL CHECKING; TYPE SYSTEMS;

COMPUTER PROGRAMMING;

EID: 24644450824     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31987-0_26     Document Type: Conference Paper

References (47)

1. R. Agarwal and S. D. Stoller. Type inference for parameterized race-free java. In Proceedings of VMCAI'04, pages 149-160, January 2004.
2. Roberto M. Amadio and Luca Cardelli. Subtyping recursive types. ACM TOPLAS, 15(4):575-631, 1993.
3. Torben Amtoft and Franklyn Turbak. Faithful translations between polyvariant flows and polymorphic types. In Proceedings of ESOP'00, pages 26-40, 2000.
4. Thomas Ball and Sriram Rajamani. The SLAM project: Debugging system software via static analysis. In Proceedings of POPL'02, pages 1-3, 2002.
5. Anindya Banerjee. A modular, polyvariant and type-based closure analysis. In Proceedings of ICFP'97, pages 1-10, 1997.
6. M. Beaven and R. Stansifer. Explaining type errors in polymorphic languages. ACM LOPLAS, 2(1-4):17-30, 1993.
7. S. Chaki, E. M. Clarke, A. Groce, S. Jha, and H. Veith. Modular verification of software components in C. In Proceedings of ICSE'03, pages 385-395, May 2003.
8. Sagar Chaki, Sriram K. Rajamani, and Jakob Rehof. Types as models: Model checking message-passing programs. In Proceedings of POPL'02, pages 45-57, 2002.
9. Olaf Chitil. Compositional explanation of types and algorithmic debugging of type errors. In Proceedings of ICFP'01, pages 193-204, 2001.
10. Patrick Cousot. Types as abstract interpretations. In Proceedings of POPL'97, pages 316-331, 1997.
11. Patrick Cousot and Radhia Cousot. Temporal abstract interpretation. In Proceedings of POPL'00, pages 12-25, 2000.
12. M. Debbabi, A. Benzakour, and K. Ktari. A synergy between model-checking and type inference for the verification of value-passing higher-order processes. In Proceedings of AMAST'98, pages 214-230, 1999.
13. Robert DeLine and Manuel Fahndrich. Enforcing high-level protocols in low-level software. In Proceedings of PLDI'01, pages 59-69, 2001.
14. Dominic Duggan and Frederick Bent. Explaining type inference. Science of Computer Programming, 27(1):37-83, 1996.
15. Cormac Flanagan and Stephen N. Freund. Type inference against races. In Proceedings of SAS'04, 2004.
16. Cormac Flanagan, Stephen N. Freund, and Marina Lifshin. Type inference for atomicity. In Proceedings of TLDI'05, January 2005.
17. Jeffrey S. Foster, Tachio Terauchi, and Alexander Aiken. Flow-sensitive type qualifiers. In Proceedings of PLDI'02, pages 1-12, 2002.
18. S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In Proceedings of CAV'97, pages 72-83, 1997.
19. Christian Haack and Joe B. Wells. Type error slicing in implicitly typed higher-order languages. In Proceedings of ESOP'03, pages 284-301, 2003.
20. Nevin Heintze. Control-flow analysis and type systems. In Proceedings of SAS'95, pages 189-206, September 1995.
21. T. A. Henzinger, R. Jhala, R. Majumdar, G. C. Necula, G. Sutre, and W. Weimer. Temporal-safety proofs for systems code. In Proceedings of CAV'02, pages 526-538, 2002.
22. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Software verification with Blast. In Proceedings of SPIN'03, pages 235-239, 2003.
23. Atsushi Igarashi and Naoki Kobayashi. Resource usage analysis. In Proceedings of POPL'02, pages 331-342, 2002.
24. G. F. Johnson and J. A. Walz. A maximum flow approach to anomaly isolation in unification-based incremental type inference. In Proceedings of POPL'86, pages 44-57, 1986.
25. Di Ma. Bounding the Stack Size of Interrupt-Driven Programs. PhD thesis, Purdue University, 2004.
26. Yitzhak Mandelbaum, David Walker, and Robert Harper. An effective theory of type refinements. In Proceedings of ICFP'03, 2003.
27. Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, 1978.
28. C. Mossin. Exact flow analysis. In Proceedings of SAS'97, pages 250-264, 1997.
29. Mayur Naik. A type system equivalent to a model checker. Master's thesis, Purdue University, 2004.
30. Mayur Naik and Jens Palsberg. A type system equivalent to a model checker. In Proceedings of ESOP'05, 2005. Full version with proofs available at http://www.cs.stanford.edu/~mhn/pubs/esop05.html.
31. K. S. Namjoshi. Certifying model checkers. In Proceedings of CAV'01, pages 2-12, 2001.
32. K. S. Namjoshi. Lifting temporal proofs through abstractions. In Proceedings of VMCAI'03, pages 174-188, 2003.
33. J. Palsberg and C. Pavlopoulou. From polyvariant flow information to intersection and union types. Journal of Functional Programming, 11(3):263-317, May 2001.
34. Jens Palsberg. Equality-based flow analysis versus recursive types. ACM TOPLAS, 20(6):1251-1264, 1998.
35. Jens Palsberg and Di Ma. A typed interrupt calculus. In Proceedings of FTRTFT'02, pages 291-310, September 2002.
36. Jens Palsberg and Patrick M. O'Keefe. A type system equivalent to flow analysis. ACM TOPLAS, 17(4):576-599, July 1995.
37. Jens Palsberg and Scott Smith. Constrained types and their expressiveness. ACM TOPLAS, 18(5):519-527, September 1996.
38. Doron Peled, Amir Pnueli, and Lenore D. Zuck. From falsification to verification. In Proceedings of FSTTCS'01, pages 292-304, 2001.
39. Doron Peled and Lenore D. Zuck. From model checking to a temporal proof. In Proceedings of SPIN'01, pages 1-14, 2001.
40. David Schmidt and Bernhard Steffen. Program analysis as model checking of abstract interpretations. In Proceedings of SAS'98, pages 351-380, 1998.
41. David A. Schmidt. Data flow analysis is model checking of abstract interpretations. In Proceedings of POPL'98, pages 38-48, 1998.
42. Bernhard Steffen. Data flow analysis as model checking. In Proceedings of TACS'91, Theoretical Aspects of Computer Science, pages 346-364, 1991.
43. Li Tan and Rance Cleaveland. Evidence-based model checking. In Proceedings of CAV'02, pages 455-470, 2002.
44. Frank Tip and T. B. Dinesh. A slicing-based approach for locating type errors. ACM TOSEM, 10(1):5-55, 2001.
45. David Walker and Greg Morrisett. Alias types for recursive data structures. In Proceedings of TIC'00, pages 177-206, 2001.
46. Mitchell Wand. Finding the source of type errors. In Proceedings of POPL'86, pages 38-43, 1986.
47. Hongwei Xi. Imperative programming with dependent types. In Proceedings of LICS'00, pages 375-387, 2000.