Computer Science Logic
From MaRDI portal
Publication:5394591
DOI10.1007/11538363zbMATH Open1136.68424OpenAlexW2479351976MaRDI QIDQ5394591FDOQ5394591
Authors: Witold Charatonik, Lilia Georgieva, Patrick Maier 
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11538363
Recommendations
- Bounded model checking of recursive programs with pointers in K
- Efficient modular SMT-based model checking of pointer programs
- Computer Aided Verification
- Symbolic bounded conformance checking of model programs
- Pointer logic for verification of pointer programs
- Completeness and expressiveness of pointer program verification by separation logic
- Bounded model checking with parametric data structures
- scientific article; zbMATH DE number 1979554
Cited In (5)
- Towards Model-Checking Programs with Lists
- Two-Variable Logic with Counting and Trees
- Convergence testing in term-level bounded model checking
- Complete Decision Procedure for the Theory of Bounded Pointer Arithmetic
- Correctness of Pointer Manipulating Algorithms Illustrated by a Verified BDD Construction
This page was built for publication: Computer Science Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394591)
