Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data
From MaRDI portal
Publication:4649295
DOI10.1007/978-3-642-33386-6_14zbMath1374.68112OpenAlexW12427088MaRDI QIDQ4649295
Cezara Dragoi, Constantin Enea, Ahmed Bouajjani, Mihaela Sighireanu
Publication date: 21 November 2012
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33386-6_14
Logic in computer science (03B70) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
Verification of heap manipulating programs with ordered data by extended forest automata ⋮ Counterexample Validation and Interpolation-Based Refinement for Forest Automata ⋮ Predicate Abstraction in Program Verification: Survey and Current Trends ⋮ A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints
This page was built for publication: Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data
