Interpolation in computing science: The semantics of modularization
From MaRDI portal
Publication:1024120
DOI10.1007/S11229-008-9358-YzbMATH Open1184.03017OpenAlexW2057205217MaRDI QIDQ1024120FDOQ1024120
Authors: Gerard R. Renardel de Lavalette
Publication date: 16 June 2009
Published in: Synthese (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11229-008-9358-y
Recommendations
Cites Work
- Interpolation and SAT-based model checking.
- Program development by stepwise refinement
- An interpolating theorem prover
- Linear reasoning. A new form of the Herbrand-Gentzen theorem
- Lazy Abstraction with Interpolants
- Module algebra
- A simple algebraic proof of the equational interpolation theorem
- On a generalized modularization theorem
- Title not available (Why is that?)
- On the unusual effectiveness of logic in computer science
- Title not available (Why is that?)
- A New, Simpler Proof of the Modularisation Theorem for Logical Specifications
- Logics in Artificial Intelligence
Cited In (4)
Uses Software
This page was built for publication: Interpolation in computing science: The semantics of modularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024120)