Mode-based Reduction from Validity Checking of Fixpoint Logic Formulas to Test-Friendly Reachability Problem
No abstract available.
Related papers
- Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification POPL 2023
- HFL(Z) Validity Checking for Automated Program Verification POPL 2023
- Higher-Order Property-Directed Reachability ICFP 2023
- Model Checking via Reachability Testing for Timed Automata TACAS 1998
- Is the Interesting Part of Process Logic Uninteresting - A Translation from PL to PDL POPL 1982
- Modular reasoning about heap paths via effectively propositional formulas POPL 2014
- Efficient static analysis of XML paths and types PLDI 2007
- Model-guided synthesis of inductive lemmas for FOL with least fixpoints OOPSLA 2022