Static Analysis
From MaRDI portal
Publication:5897437
DOI10.1007/11547662zbMath1141.68374OpenAlexW4229853237MaRDI QIDQ5897437
Publication date: 31 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11547662
Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (10)
Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data ⋮ Predicate Abstraction for Program Verification ⋮ Convergence: integrating termination and abort-freedom ⋮ Abstracting Complex Data Structures by Hyperedge Replacement ⋮ An extension of lazy abstraction with interpolation for programs with arrays ⋮ Verification of Boolean programs with unbounded thread creation ⋮ An Assume Guarantee Approach for Checking Quantified Array Assertions ⋮ The Spotlight Principle ⋮ Abstraction Refinement for Quantified Array Assertions ⋮ Refinement of Trace Abstraction
This page was built for publication: Static Analysis
