Abstraction Refinement of Linear Programs with Arrays
نویسندگان
چکیده
ion Refinement of Linear Programs
منابع مشابه
Definability of Accelerated Relations in a Theory of Arrays and Its Applications
ion and Acceleration in SMT-based Model-Checking for Array Programs Francesco Alberti1, Silvio Ghilardi2, Natasha Sharygina1 1 Faculty of Informatics, University of Lugano, Switzerland 2 Università degli Studi di Milano, Milan, Italy Abstract Abstraction (in its various forms) is a powerful established technique in modelchecking; still, when unbounded data-structures are concerned, it cannot al...
متن کاملAbstraction and Acceleration in SMT-based Model-Checking for Array Programs
ion and Acceleration in SMT-based Model-Checking for Array Programs Francesco Alberti1, Silvio Ghilardi2, Natasha Sharygina1 1 Faculty of Informatics, University of Lugano, Switzerland 2 Università degli Studi di Milano, Milan, Italy Abstract Abstraction (in its various forms) is a powerful established technique in modelchecking; still, when unbounded data-structures are concerned, it cannot al...
متن کاملAn encoding of array verification problems into array-free Horn clauses
Automatically verifying safety properties of programs is hard, and it is even harder if the program acts upon arrays or other forms of maps. Many approaches exist for verifying programs operating upon Boolean and integer values (e.g. abstract interpretation, counterexample-guided abstraction refinement using interpolants), but transposing them to array properties has been fraught with difficult...
متن کاملAn extension of lazy abstraction with interpolation for programs with arrays
Lazy abstraction with interpolation-based refinement has been shown to be a powerful technique for verifying imperative programs. In presence of arrays, however, themethod suffers from an intrinsic limitation, due to the fact that invariants needed for verification usually contain universally quantified variables, which are not present in program specifications. In this work we present an exten...
متن کاملCell Morphing: From Array Programs to Array-Free Horn Clauses
Automatically verifying safety properties of programs is hard. Many approaches exist for verifying programs operating on Boolean and integer values (e.g. abstract interpretation, counterexampleguided abstraction refinement using interpolants), but transposing them to array properties has been fraught with difficulties. Our work addresses that issue with a powerful and flexible abstraction that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007