In a bounded analysis, arithmetic operators become partial, and a different semantics becomes necessary. One approach, mimicking programming languages, is for overflow to result in wrap-around. Although easy to implement, wrap-around produces unexpected counterexamples that do not correspond to cases that would arise in the unbounded setting. This paper describes a new approach, implemented in the latest version of the Alloy Analyzer, in which instances that would involve overflow are suppressed, and consequently, spurious counterexamples are eliminated. The key idea is to interpret quantifiers so that bound variables range only over values that do not cause overflow
International audienceWe describe a new approach to find models for a computational higher-order log...
Alloy is an extension of first-order logic for modelling software systems. Alloy has a fully automat...
© The Author(s) 2015. This article is published with open access at Springerlink.com Abstract Many s...
We consider the problem of synthesizing provably non-overflowing integer arithmetic expressions or B...
AbstractBounded Model Checking (BMC) searches for counterexamples to a property ϕ with a bounded len...
Bounded Model Checking (BMC) searches for counterexamples to a property ϕ with a bounded length k. I...
International audienceWhen proving safety of programs, we must show, in particular, the absence of i...
AbstractAlloy is an extension of first-order logic for modelling software systems. Alloy has a fully...
Bounded Model Checking (BMC) searches for counterexamples to a property φ with a bounded length k. I...
Alloy is an extension of first-order logic for modelling software systems. Alloy has a fully automat...
AbstractIn this article, we focus on the synthesis of arithmetic expressions that can be evaluated e...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
AbstractAnalysis of convex polyhedra using abstract interpretation is a common and powerful program ...
Monotonicity in concurrent systems stipulates that, in any global state, system actions remain execu...
The last decade has seen a dramatic growth in the use of constraint solvers as a computational mecha...
International audienceWe describe a new approach to find models for a computational higher-order log...
Alloy is an extension of first-order logic for modelling software systems. Alloy has a fully automat...
© The Author(s) 2015. This article is published with open access at Springerlink.com Abstract Many s...
We consider the problem of synthesizing provably non-overflowing integer arithmetic expressions or B...
AbstractBounded Model Checking (BMC) searches for counterexamples to a property ϕ with a bounded len...
Bounded Model Checking (BMC) searches for counterexamples to a property ϕ with a bounded length k. I...
International audienceWhen proving safety of programs, we must show, in particular, the absence of i...
AbstractAlloy is an extension of first-order logic for modelling software systems. Alloy has a fully...
Bounded Model Checking (BMC) searches for counterexamples to a property φ with a bounded length k. I...
Alloy is an extension of first-order logic for modelling software systems. Alloy has a fully automat...
AbstractIn this article, we focus on the synthesis of arithmetic expressions that can be evaluated e...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
AbstractAnalysis of convex polyhedra using abstract interpretation is a common and powerful program ...
Monotonicity in concurrent systems stipulates that, in any global state, system actions remain execu...
The last decade has seen a dramatic growth in the use of constraint solvers as a computational mecha...
International audienceWe describe a new approach to find models for a computational higher-order log...
Alloy is an extension of first-order logic for modelling software systems. Alloy has a fully automat...
© The Author(s) 2015. This article is published with open access at Springerlink.com Abstract Many s...