NASA Formal Methods
暂无分享,去创建一个
[1] Nicolas Halbwachs,et al. Dynamic Partitioning in Analyses of Numerical Properties , 1999, SAS.
[2] Sagar Chaki,et al. Combining Predicate and Numeric Abstraction for Software Model Checking , 2008, FMCAD.
[3] Patrick Cousot,et al. The Reduced Product of Abstract Domains and the Combination of Decision Procedures , 2011, FoSSaCS.
[4] Thomas W. Reps,et al. Bilateral Algorithms for Symbolic Abstraction , 2012, SAS.
[5] Cesare Tinelli,et al. Instantiation-Based Invariant Discovery , 2011, NASA Formal Methods.
[6] Thomas W. Reps,et al. Symbolic Implementation of the Best Transformer , 2004, VMCAI.
[7] Cesare Tinelli,et al. Incremental Verification with Mode Variable Invariants in State Machines , 2012, NASA Formal Methods.
[8] David Monniaux,et al. Improving Strategies via SMT Solving , 2011, ESOP.
[9] Bertrand Jeannet,et al. Apron: A Library of Numerical Abstract Domains for Static Analysis , 2009, CAV.
[10] Nicolas Halbwachs,et al. Combining Widening and Acceleration in Linear Relation Analysis , 2006, SAS.
[11] Harald Søndergaard,et al. Automatic Abstraction for Congruences , 2010, VMCAI.
[12] Thomas W. Reps,et al. Lookahead Widening , 2006, CAV.
[13] Pierre Roux,et al. SMT-AI: an Abstract Interpreter as Oracle for k-induction , 2010, Electron. Notes Theor. Comput. Sci..
[14] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[15] Nicolas Halbwachs. Détermination automatique de relations linéaires vérifiées par les variables d'un programme , 1979 .
[16] Bertrand Jeannet,et al. Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs , 2010, NSAD@SAS.
[17] Cesare Tinelli,et al. PKind: A parallel k-induction based model checker , 2011, PDMC.
[18] Patrick Cousot,et al. The ASTREÉ Analyzer , 2005, ESOP.
[19] Roberto Bagnara,et al. Precise widening operators for convex polyhedra , 2003, Sci. Comput. Program..
[20] Pascal Raymond,et al. The synchronous data flow programming language LUSTRE , 1991, Proc. IEEE.
[21] Herbert B. Enderton,et al. A mathematical introduction to logic , 1972 .
[22] Thomas W. Reps,et al. A Method for Symbolic Computation of Abstract Operations , 2012, CAV.
[23] Sumit Gulwani,et al. Logical Interpretation: Static Program Analysis Using Theorem Proving , 2007, CADE.
[24] Clark W. Barrett,et al. The SMT-LIB Standard Version 2.0 , 2010 .
[25] David Monniaux,et al. Automatic modular abstractions for linear constraints , 2008, POPL '09.
[26] Mary Sheeran,et al. Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.
[27] Laure Gonnord,et al. Using Bounded Model Checking to Focus Fixpoint Iterations , 2011, SAS.
[28] Patrick Cousot,et al. Systematic design of program analysis frameworks , 1979, POPL.