Abstraction Refinement of Linear Programs with Arrays

DOI10.1007/978-3-540-71209-1_29MaRDI QIDQ5758120zbMATH OpenOpenAlexFDO

Authors Alessandro Armando, Massimo Benerecetti, Jacopo Mantovani

Publication date 3 September 2007

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71209-1_29

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Artificial Intelligence and Symbolic Computation
• Abstraction Refinement for Quantified Array Assertions
• An extension of lazy abstraction with interpolation for programs with arrays
• Lazy abstraction with interpolants for arrays
• Abstractions from proofs

Cited in

(7)

• Programming Languages and Systems
• Abstraction Refinement for Quantified Array Assertions
• An extension of lazy abstraction with interpolation for programs with arrays
• Array abstraction with symbolic pivots
• Verification problem for linear programs with Boolean arrays
• Artificial Intelligence and Symbolic Computation
• CPBPV: a constraint-programming framework for bounded program verification

Describes a project that uses

Uses Software

• SatAbs
• BLAST

This page was built for publication: Abstraction Refinement of Linear Programs with Arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758120)