Interpolation in computing science: The semantics of modularization
From MaRDI portal
Publication:1024120
DOI10.1007/s11229-008-9358-yzbMath1184.03017OpenAlexW2057205217MaRDI QIDQ1024120
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
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A simple algebraic proof of the equational interpolation theorem
- On a generalized modularization theorem
- An interpolating theorem prover
- On the Unusual Effectiveness of Logic in Computer Science
- Linear reasoning. A new form of the Herbrand-Gentzen theorem
- Module algebra
- A New, Simpler Proof of the Modularisation Theorem for Logical Specifications
- Logics in Artificial Intelligence
- Program development by stepwise refinement
- Lazy Abstraction with Interpolants
- Computer Aided Verification
This page was built for publication: Interpolation in computing science: The semantics of modularization