Recommendations
Cited in
(28)- Visibly pushdown transducers
- Dynamic nested brackets
- Learning inductive invariants by sampling from frequency distributions
- Farkas-based tree interpolation
- A complete refinement procedure for regular separability of context-free languages
- Interpolation in nest algebra modules
- Automated program verification
- Proof tree preserving tree interpolation
- Whale: an interpolation-based algorithm for inter-procedural verification
- Predicate abstraction for program verification
- Minimization of visibly pushdown automata using partial Max-SAT
- Solving constrained Horn clauses using dependence-disjoint expansions
- Regular separability of well-structured transition systems
- scientific article; zbMATH DE number 7444022 (Why is no real title available?)
- Domains for Higher-Order Games
- What's decidable about program verification modulo axioms?
- SMT-based model checking for recursive programs
- Ramsey-based inclusion checking for visibly pushdown automata
- Complete instantiation-based interpolation
- Efficient modular SMT-based model checking of pointer programs
- Trace Abstraction-Based Verification for Uninterpreted Programs
- Choose Your Colour: Tree Interpolation for Quantified Formulas in SMT
- Antichains algorithms for the inclusion problem between \(\omega\)-VPL
- Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
- On the complexity of multi-pushdown games
- Choose your proofs: commutativity and symmetry for smarter reasoning
- Completeness of interpolation algorithms in classical and non-classical logics
- On recursion-free Horn clauses and Craig interpolation
This page was built for publication: Nested interpolants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5255103)
