Computer Aided Verification
From MaRDI portal
Publication:5312904
DOI10.1007/B98490zbMATH Open1103.68635OpenAlexW4298302743MaRDI QIDQ5312904FDOQ5312904
Authors: Mooly Sagiv, Reinhard Wilhelm, Thomas Reps
Publication date: 25 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98490
Recommendations
Cited In (17)
- Verifying Reference Counting Implementations
- Title not available (Why is that?)
- Programming in three-valued logic
- Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
- Algebraic program analysis
- Abstraction Refinement for Quantified Array Assertions
- Data structures for symbolic multi-valued model-checking
- Non-disjunctive Numerical Domain for Array Predicate Abstraction
- Title not available (Why is that?)
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- Recent progress in program analysis
- Sorting algorithms in \textsc{MOQA}
- Title not available (Why is that?)
- The Spotlight Principle
- Logical Interpretation: Static Program Analysis Using Theorem Proving
- A logic of reachable patterns in linked data-structures
- Bounded model checking of infinite state systems
Uses Software
This page was built for publication: Computer Aided Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312904)