Craig interpolation in the presence of non-linear constraints
From MaRDI portal
Publication:3172854
DOI10.1007/978-3-642-24310-3_17zbMATH Open1348.68141OpenAlexW207011911MaRDI QIDQ3172854FDOQ3172854
Bernd Becker, Stefan Kupferschmid
Publication date: 7 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24310-3_17
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Interpolation, preservation, definability (03C40)
Cites Work
- Computer Aided Verification
- A two-dimensional mapping with a strange attractor
- Title not available (Why is that?)
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- The algorithmic analysis of hybrid systems
- An interpolating theorem prover
- Efficient generation of craig interpolants in satisfiability modulo theories
- Linear reasoning. A new form of the Herbrand-Gentzen theorem
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Automated Deduction – CADE-20
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Interpolation and model checking for nonlinear arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sharper and Simpler Nonlinear Interpolants for Program Verification
- NIL: learning nonlinear interpolants
- Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF
- Temporal Logic Verification for Delay Differential Equations
Uses Software
This page was built for publication: Craig interpolation in the presence of non-linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172854)
