Sciweavers

164 search results - page 4 / 33
» A Decidable Fragment of Separation Logic
Sort
View
LICS
2010
IEEE
13 years 6 months ago
The Undecidability of Boolean BI through Phase Semantics
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phas...
Dominique Larchey-Wendling, Didier Galmiche
LPAR
2005
Springer
14 years 1 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
VLC
2011
83views more  VLC 2011»
13 years 2 months ago
A decision procedure for a decidable fragment of generalized constraint diagrams
Constraint diagrams were introduced by Kent, in 1997, as an alternative to the OCL for placing formal constraints on software models. Since their introduction, constraint diagrams...
Jim Burton, Gem Stapleton, Ali Hamie
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 8 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia