Underapproximation of Procedure Summaries for Integer Programs
From MaRDI portal
Publication:5326329
DOI10.1007/978-3-642-36742-7_18zbMath1381.68052arXiv1210.4289MaRDI QIDQ5326329
Radu Iosif, Filip Konečný, Pierre Ganty
Publication date: 5 August 2013
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.4289
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Predicate Pairing for program verification, Unnamed Item, Unnamed Item, A Calculus for Modular Loop Acceleration, Interprocedural Reachability for Flat Integer Programs