A CLP Method for Compositional and Intermittent Predicate Abstraction
Abstract elided by the publisher.
Related papers
- CLP* and Constraint Abstraction POPL 1989
- Compositional Predicate Abstraction from Game Semantics TACAS 2009
- Sets and constraint logic programming TOPLAS 2000
- Predicate abstraction and refinement for verifying multi-threaded programs POPL 2011
- STAN: A Static Analyzer for CLP(R) Based on Abstract Interpretation SAS 1996
- An Abstract Machine for CLP(R) PLDI 1992
- WARio: efficient code generation for intermittent computing PLDI 2022
- Modal Crash Types for Intermittent Computing ESOP 2023