Inference of user-defined type qualifiers and qualifier rules

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

Volumn 3924 LNCS, Issue , 2006, Pages 264-278

  Chin, Brian ^a   Markstrum, Shane ^a   Millstein, Todd ^a   Palsberg, Jens ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANNOTATING PROGRAMS; QUALIFIER RULES; RULE INFERENCES; RUN-TIME INVARIANTS; CONDITIONAL SETS; NEW APPROACHES; OPEN SOURCES; RULE INFERENCE; SET OF RULES; TYPE QUALIFIERS; TYPECHECKING; USER-DEFINED TYPES;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; LOGIC PROGRAMMING; PROBLEM SOLVING; USER INTERFACES; OPEN SOURCE SOFTWARE;

INFERENCE ENGINES; C (PROGRAMMING LANGUAGE);

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

References (13)

1. T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, pages 203-213. ACM Press, 2001.
2. B. Chin, S. Markstrum, and T. Millstein. Semantic type qualifiers. In PLDI '05: Proceedings of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 85-95, New York, NY, USA, 2005. ACM Press.
3. B. Chin, S. Markstrum, T. Millstein, and J. Palsberg. Inference of user-defined type qualifiers and qualifier rules. Technical Report CSD-TR-050041, UCLA Computer Science Department, October 2005.
4. R. Davies and F. Pfenning. Intersection types and computational effects. In ICFP '00: Proceedings of the ACM SIGPLAN International Conference on Functional Programming, pages 198-208. ACM Press, 2000.
5. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: A theorem prover for program checking. Technical Report HPL-2003-148, HP Labs, 2003.
6. J. S. Foster, M. Fähndrich, and A. Aiken. A Theory of Type Qualifiers. In Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 192-203, Atlanta, Georgia, May 1999.
7. J. S. Foster, T. Terauchi, and A. Aiken. Flow-sensitive type qualifiers. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pages 1-12. ACM Press, 2002.
8. T. Freeman and F Pfenning. Refinement types for ML. In PLDI '91: Proceedings of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation, pages 268-277, New York, NY, USA, 1991. ACM Press.
9. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV97: Computer-aided Verification, LNCS 1254, pages 72-83. Springer-Verlag, 1997.
10. Y. Mandelbaum, D. Walker, and R. Harper. An effective theory of type refinements. In Proceedings of the eighth ACM SIGPLAN international conference on Functional programming, pages 213-225. ACM Press, 2003.
11. M. Odersky, M. Sulzmann, and M. Wehr. Type inference with constrained types. Theor. Pract. Object Syst., 5(1):35-55, 1999.
12. T. W. Reps, S. Sagiv, and G. Yorsh. Symbolic implementation of the best transformer. In 5th International Conference on Verification, Model Checking, and Abstract Interpretation, pages 252-266, 2004.
13. G. Yorsh, T. W. Reps, and S. Sagiv. Symbolically computing most-precise abstract operations for shape analysis. In 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pages 530-545, 2004.