We say a program is data-independent with respect to a data type X if the operations it can perform on values of type X are restricted to just equality testing, although the system may also input, store and move around values of type X within its variables. This property can be exploited to give procedures for the automatic veri cation, called model checking, of such programs independently of the instance for the type X
We present our efforts on the formalization and automated formal verification of data-intensive appl...
Abstraction and composition are the fundamental issues in making model checking viable for software....
We develop a framework for model checking infinite-state systems by automatically augmenting them wi...
We say a program is data-independent with respect to a data type X if the operations it can perform ...
We consider programs which are data independent with respect to two type variables X and Y, and can ...
AbstractData independence is a useful technique in reasoning about systems. Commonly, if one knows t...
A concurrent system is data-independent with respect to a data type when the only operation it can p...
International audienceWe address the problem of verification of program terms parameterized by a dat...
AbstractAlloy is an extension of first-order logic for modelling software systems. Alloy has a fully...
For programs whose data variables range over Boolean or finite domains, program verification is deci...
In previous work we presented a model checking procedure for linear programs, i.e. programs in which...
Model checking is a formal verification technique that exhaustively tests a piece of hardware or sof...
Despite the technological advances in languages and tools to support program development, pro-gramme...
Alloy is an extension of first-order logic for modelling software systems. Alloy has a fully automat...
A system is data independent in a type T if the only operations allowed on variables of type T are i...
We present our efforts on the formalization and automated formal verification of data-intensive appl...
Abstraction and composition are the fundamental issues in making model checking viable for software....
We develop a framework for model checking infinite-state systems by automatically augmenting them wi...
We say a program is data-independent with respect to a data type X if the operations it can perform ...
We consider programs which are data independent with respect to two type variables X and Y, and can ...
AbstractData independence is a useful technique in reasoning about systems. Commonly, if one knows t...
A concurrent system is data-independent with respect to a data type when the only operation it can p...
International audienceWe address the problem of verification of program terms parameterized by a dat...
AbstractAlloy is an extension of first-order logic for modelling software systems. Alloy has a fully...
For programs whose data variables range over Boolean or finite domains, program verification is deci...
In previous work we presented a model checking procedure for linear programs, i.e. programs in which...
Model checking is a formal verification technique that exhaustively tests a piece of hardware or sof...
Despite the technological advances in languages and tools to support program development, pro-gramme...
Alloy is an extension of first-order logic for modelling software systems. Alloy has a fully automat...
A system is data independent in a type T if the only operations allowed on variables of type T are i...
We present our efforts on the formalization and automated formal verification of data-intensive appl...
Abstraction and composition are the fundamental issues in making model checking viable for software....
We develop a framework for model checking infinite-state systems by automatically augmenting them wi...