Annotation inference for modular checkers

Information Processing Letters

Volumn 77, Issue 2-4, 2001, Pages 97-108

  Flanagan, Cormac ^a   Joshi, Rajeev ^a   Leino, K Rustan M ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFERENCE ENGINES; SUBROUTINES;

ANNOTATION INFERENCE; MODULAR PROGRAM CHECKING;

SOFTWARE ENGINEERING;

EID: 0035247718     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00196-4     Document Type: Article

References (12)

1. Back R.-J., von Wright J. Refinement Calculus: A Systematic Introduction. Graduate Texts in Computer Science. 1998;Springer, Berlin.
2. Cardelli L. Type systems. The Computer Science and Engineering Handbook. 1977;2208-2236.
3. Cousot P., Cousot R. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. Proc. 4th ACM Symp. on Principles of Programming Languages. 1977;238-252.
4. Detlefs D.L., Leino K.R.M., Nelson G., Saxe J.B. Extended static checking. Research Report 159. December 1998;Compaq SRC. Available from research.compaq.com/SRC/publications/.
5. Dijkstra E.W. A Discipline of Programming. 1976;Prentice-Hall, Englewood Cliffs, NJ.
6. Dijkstra E.W., Scholten C.S. Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. 1990;Springer, Berlin.
7. Extended Static Checking home page, Compaq Systems Research Center; On the Web at research.compaq.com/SRC/esc/.
8. Flanagan C., Freund S.N. Type-based race detection for Java. PLDI'00 ACM SIGPLAN Notices. 35:(5):2000;219-232.
9. Leino K.R.M., Saxe J.B., Stata R. Checking Java programs via guarded commands. Jacobs B., et al. Formal Techniques for Java Programs, Technical Report 251. May 1999;Fernuniversität Hagen. Also available as Technical Note 1999-002, Compaq SRC, from research.compaq.com/SRC/publications/.
10. Milner R. A theory of type polymorphism in programming. J. Comput. System Sci. 17:(3):1978;348-375.
11. J.C. Mitchell, Type systems for programming languages, in: J. van Leeuwen (Ed.), Formal Models and Sematics, Handbook of Theoretical Computer Science, Vol. B, Elsevier Science, Amsterdam / MIT Press, Cambridge, MA, 1990, pp. 365-458.
12. Nelson G. A generalization of Dijkstra's calculus. ACM Trans. Program. Languages Syst. 11:(4):1989;517-561.