Towards Modular Algebraic Specifications for Pointer Programs: A Case Study
From MaRDI portal
Publication:3608820
DOI10.1007/978-3-540-73147-4_12zbMATH Open1186.68116OpenAlexW2116518308MaRDI QIDQ3608820FDOQ3608820
Publication date: 6 March 2009
Published in: Rewriting, Computation and Proof (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73147-4_12
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Abstract data types; algebraic specification (68Q65)
Cited In (1)
Uses Software
Recommendations
- Efficient modular SMT-based model checking of pointer programs π π
- Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper) π π
- Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives π π
- Proving pointer programs in higher-order logic π π
- Automated Deduction β CADE-19 π π
- Towards pointer algebra π π
- Concise Read-Only Specifications for Better Synthesis of Programs with Pointers π π
- Completeness and expressiveness of pointer program verification by separation logic π π
- Title not available (Why is that?) π π
This page was built for publication: Towards Modular Algebraic Specifications for Pointer Programs: A Case Study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608820)