Add to ORKGWe describe EUREKA, a symbolic model checker for Linear Programs with arrays, i.e. programs where variables and ar-ray elements range over a numeric domain and expressions involve linear combinations of variables and array elements. This language fragment easily encodes a large class of pro-grams for which, as demonstrated by our experiments, tech-niques based on predicate abstraction do not apply success-fully. 1
Abstract-State-of-the-art hardware model checkers and equivalence checkers rely upon a diversity of ...
We present a method to verify the correctness of parallel programs that perform complex numerical co...
: A scheme is presented to enable the mode analysis of concurrent logic programs manipulating arrays...
In previous work we presented a model checking procedure for linear programs, i.e. programs in which...
AbstractIn previous work we proposed Linear Programs as a fine grained model for imperative programs...
Predicate abstraction refinement is one of the leading approaches to software verification. The key ...
Abstract Predicate abstraction refinement is one of the leading approaches to software verification....
Array access out of bounds is a typical programming error. From the ’70s, static analysis has been u...
Abstract. TAPAS is a suite of libraries dedicated to FO (R,Z,+,≤). The suite provides (1) the applic...
Finite-Element Analysis (FEA) program vendors go to great lengths to provide their customers with po...
In our laboratory, the application of Prolog language to chemical engineering problems have been stu...
We describe practical experiences of using a logic programming based approach to model and reason ab...
The development of formal models is often a key step when developing safety or mission critical soft...
interpretation [16] is used to compute the ranges for variables at each point of a program unit. Tha...
Abstract. Teaching formal methods is notoriously difficult but it is also often argued that formal m...
Abstract-State-of-the-art hardware model checkers and equivalence checkers rely upon a diversity of ...
We present a method to verify the correctness of parallel programs that perform complex numerical co...
: A scheme is presented to enable the mode analysis of concurrent logic programs manipulating arrays...
In previous work we presented a model checking procedure for linear programs, i.e. programs in which...
AbstractIn previous work we proposed Linear Programs as a fine grained model for imperative programs...
Predicate abstraction refinement is one of the leading approaches to software verification. The key ...
Abstract Predicate abstraction refinement is one of the leading approaches to software verification....
Array access out of bounds is a typical programming error. From the ’70s, static analysis has been u...
Abstract. TAPAS is a suite of libraries dedicated to FO (R,Z,+,≤). The suite provides (1) the applic...
Finite-Element Analysis (FEA) program vendors go to great lengths to provide their customers with po...
In our laboratory, the application of Prolog language to chemical engineering problems have been stu...
We describe practical experiences of using a logic programming based approach to model and reason ab...
The development of formal models is often a key step when developing safety or mission critical soft...
interpretation [16] is used to compute the ranges for variables at each point of a program unit. Tha...
Abstract. Teaching formal methods is notoriously difficult but it is also often argued that formal m...
Abstract-State-of-the-art hardware model checkers and equivalence checkers rely upon a diversity of ...
We present a method to verify the correctness of parallel programs that perform complex numerical co...
: A scheme is presented to enable the mode analysis of concurrent logic programs manipulating arrays...