Finite Differencing of Logical Formulas for Static Analysis
- 28 February 2003
- book chapter
- Published by Springer Nature
- p. 380-398
- https://doi.org/10.1007/3-540-36575-3_26
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Automatic predicate abstraction of C programsPublished by Association for Computing Machinery (ACM) ,2001
- Incremental maintenance of recursive views using relational calculus/SQLACM SIGMOD Record, 2000
- TVLA: A System for Implementing Static AnalysesPublished by Springer Nature ,2000
- Experience with Predicate AbstractionPublished by Springer Nature ,1999
- Verification of Infinite State Systems by Compositional Model CheckingPublished by Springer Nature ,1999
- Discovering auxiliary information for incremental computationPublished by Association for Computing Machinery (ACM) ,1996
- Incremental and Decremental Evaluation of Transitive Closure by First-Order QueriesInformation and Computation, 1995
- Systematic derivation of incremental programsScience of Computer Programming, 1995
- Systematic design of program analysis frameworksPublished by Association for Computing Machinery (ACM) ,1979
- On a Theory of Boolean FunctionsJournal of the Society for Industrial and Applied Mathematics, 1959