On Our Experience with Modular Pluggable Analyses

Note: MIT CSAIL report number 965 Reference LARA-REPORT-2004-006 Record created on 2007-08-21, modified on 2017-05-12

[1]  Martin Rinard,et al.  On Modular Pluggable Analyses Using Set Interfaces , 2003 .

[2]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[3]  Viktor Kuncak,et al.  Generalized typestate checking using set interfaces and pluggable analyses , 2004, SIGP.

[4]  K. Rustan M. Leino,et al.  Efficient weakest preconditions , 2005, Inf. Process. Lett..

[5]  Robert E. Strom,et al.  Typestate: A programming language concept for enhancing software reliability , 1986, IEEE Transactions on Software Engineering.

[6]  Nils Klarlund,et al.  MONA Implementation Secrets , 2000, Int. J. Found. Comput. Sci..

[7]  Bertrand Jeannet,et al.  A Relational Approach to Interprocedural Shape Analysis , 2004, SAS.

[8]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 1999, POPL '99.

[9]  Thomas A. Henzinger,et al.  Abstractions from proofs , 2004, POPL.

[10]  Edward Y. Chang,et al.  STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems , 1996, CAV.

[11]  Dexter Kozen,et al.  Complexity of Boolean Algebras , 1980, Theor. Comput. Sci..

[12]  Viktor Kuncak,et al.  The First-Order Theory of Sets with Cardinality Constraints is Decidable , 2004, ArXiv.

[13]  Cormac Flanagan,et al.  Avoiding exponential explosion: generating compact verification conditions , 2001, POPL '01.

[14]  Nicolas Halbwachs,et al.  Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[15]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[16]  Dexter Kozen.  Logical Aspects of Set Constraints , 1993, CSL.

[17]  Nils Klarlund,et al.  MONA Version 1.4 - User Manual , 2001 .

[18]  Viktor Kuncak,et al.  Role analysis , 2002, POPL '02.

[19]  Andreas Podelski,et al.  Relative Completeness of Abstraction Refinement for Software Model Checking , 2002, TACAS.

[20]  David R. Cheriton,et al.  Extensions for multi-module records in conventional programming languages , 1987, POPL '87.

[21]  Nils Klarlund,et al.  Graph types , 1993, POPL '93.

[22]  Rudolf Eigenmann,et al.  Performance Analysis of Parallelizing Compilers on the Perfect Benchmarks Programs , 1992, IEEE Trans. Parallel Distributed Syst..

[23]  Anders Møller,et al.  The Pointer Assertion Logic Engine , 2000 .

[24]  Sophia Drossopoulou,et al.  Fickle : Dynamic Object Re-classification , 2001, ECOOP.

[25]  Michael D. Ernst,et al.  An overview of JML tools and applications , 2003, Electron. Notes Theor. Comput. Sci..

[26]  Sagar Chaki,et al.  Types as models: model checking message-passing programs , 2002, POPL '02.

[27]  Mark Lillibridge,et al.  Extended static checking for Java , 2002, PLDI '02.

[28]  Wilhelm Ackermann,et al.  Solvable Cases Of The Decision Problem , 1954 .