Partial Completeness of Abstract Fixpoint Checking
- 11 August 2000
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Comparing the Galois connection and widening/narrowing approaches to abstract interpretationPublished by Springer Nature ,2005
- Verification of Infinite-State Systems by Combining Abstraction and Reachability AnalysisPublished by Springer Nature ,1999
- Refining Model Checking by Abstract InterpretationAutomated Software Engineering, 1999
- Computing abstractions of infinite state systems compositionally and automaticallyPublished by Springer Nature ,1998
- Generating finite-state abstractions of reactive systems using decision proceduresPublished by Springer Nature ,1998
- Model checking and abstractionACM Transactions on Programming Languages and Systems, 1994
- Abstract interpretation and application to logic programsThe Journal of Logic Programming, 1992
- Constructive versions of Tarski’s fixed point theoremsPacific Journal of Mathematics, 1979
- Systematic design of program analysis frameworksPublished by Association for Computing Machinery (ACM) ,1979
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977