ILC: A foundation for automated reasoning about pointer programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3924 LNCS, Issue , 2006, Pages 131-145

  Jia, Limin ^a   Walker, David ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARRAYS; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; FORMAL LOGIC; LINEAR EQUATIONS; REYNOLDS NUMBER; SYNTACTICS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; LINEAR ALGEBRA;

CLASSICAL SUBLOGIC; INTUITIONISTIC LINEAR LOGIC WITH CONSTRAINTS (ILC); LINEAR LOGIC; LINEAR LOGICAL FORMULAS; AUTOMATED REASONING; CUT ELIMINATION; IMPERATIVE PROGRAMMING LANGUAGES; INTUITIONISTIC LINEAR LOGIC; LOGICAL FORMULAS; POINTER PROGRAMS; PROOF THEORY; VERIFICATION CONDITION;

COMPUTER PROGRAMMING; FORMAL LOGIC;

EID: 33745766111     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11693024_10     Document Type: Conference Paper

References (30)

1. Yang, Z.: Putting program analysis to work at Microsoft (2005) Princeton Computer Science Department Colloquium.
2. Detlefs, D.L.: An overview of the extended static checking system. In: The First Workshop on Formal Methods in Software Practice. (1996)
3. Flanagan, C., Leino, R., Lillibridge, M., Nelson, G., Saxes, J., Stata, R.: Extended static checking for Java. In: ACM Conference on Programming Language Design and Implementation. (2002)
4. Barnett, M., Leino, K.R.M., Schulte, W.: The spec# programming system: An overview. In: CASSIS 2004. Number 3362 in LNCS (2004) 49-69
5. Necula, G.: Proof-carrying code. In: Twenty-Fourth ACM Symposium on Principles of Programming Languages, Paris (1997) 106-119
6. Ishtiaq, S., O'Hearn, P.: BI as an assertion language for mutable data structures. In: 28th ACM Symposium on Principles of Programming Languages. (2001)
7. O'Hearn, P., Reynolds, J., Yang, H.: Local reasoning about programs that alter data structures. In: Computer Science Logic. Number 2142 in LNCS (2001)
8. Hodas, J., Miller, D.: Logic programming in a fragment of intuitionistic linear logic. Information and Computation 110 (1994)
9. Lopez, P., Pfenning, F., Polakow, J., Watkins, K.: Monadic concurrent linear logic programming. In: PPDP. (2005)
10. Chaudhuri, K., Pfenning, F.: A focusing inverse method prover for first-order linear logic. In: CADE-20. (2005)
11. Miller, D.: A multiple-conclusion meta-logic. In: Ninth Annual Symposium on Logic in Computer Science, IEEE Computer Society Press (1994) 272-281
12. Cervesato, I., Pfenning, F.: A linear logical framework. In: Information and Computation. (2000)
13. Watkins, K., Cervesato, I., Pfenning, F., Walker, D.: A concurrent logical framework: The propositional fragment. In: Types for Proofs and Programs. (2004)
14. Ahmed, A., Jia, L., Walker, D.: Reasoning about hierarchical storage. In: IEEE Symposium on Logic in Computer Science. (2003)
15. Jia, L., Spalding, P., Walker, D., Glew, N.: Certifying compilation for a language with stack allocation. In: IEEE Symposium on Logic in Computer Science. (2005)
16. Smith, F., Walker, D., Morrisett, G.: Alias types. In: European Symposium on Programming, Berlin (2000) 366-381
17. 3: A linear language with locations. In: 7th International Conference on Typed Lambda Calculi and Applications. (2005)
18. Hickey, Nogin, Constable, Aydemir, Barzilay, Bryukhov, Eaton, Granicz, Kopylov, Kreitz, Krupski, Lorigo, Schmitt, Witty, Yu: MetaPRL - A modular logical environment. In: IWHOLTP, LNCS (2003)
19. th International Conference on Computer Aided Verification (CAV '04). (2004)
20. Jia, L., Walker, D.: ILC: A foundation for automated reasoning about pointer programs. Technical Report TR-738-05, Princeton University (2005)
21. Gentzen, G.: The Collected Papers of Gerhard Gentzen. North Holland (1969) Edited by M. E. Szabo.
22. Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS. (2002)
23. Lincoln, P., Mitchell, J., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56 (1992) 239-311
24. Berdine, J., Calcagno, C., O'Hearn, P.W.: A decidable fragment of separation logic. In: FST TCS 2004. Number 3328 in LNCS (2004)
25. Berdine, J., Calcagno, C., O'Hearn, P.W.: Symbolic execution with separation logic. In: Asian Symposium on Programming Languages and Systems. Number 3780 in LNCS (2005) 52-68
26. Deline, R., Fähndrich, M.: Enforcing high-level protocols in low-level software. In: ACM Conference on Programming Language Design and Implementation. (2001)
27. Foster, J., Terauchi, T., Aiken, A.: Flow-sensitive type qualifiers. In: ACM Conference on Programming Language Design and Implementation. (2002)
28. Mandelbaum, Y., Walker, D., Harper, R.: An effective theory of type refinements. In: International conference on functional programming. (2003)
29. Zhu, D., Xi, H.: Safe Programming with Pointers through Stateful Views. In: Proceedings of the 7th International Symposium on Practical Aspects of Declarative Languages, Springer-Verlag LNCS vol. 3350 (2005)
30. Xi, H., Pfenning, F.: Eliminating array bound checking through dependent types. In: ACM Conference on Programming Language Design and Implementation, Montreal (1998) 249-257