Sciweavers

27 search results - page 1 / 6
» Reachability Logic: An Efficient Fragment of Transitive Clos...
Sort
View
64
Voted
IGPL
2000
68views more  IGPL 2000»
14 years 10 months ago
Reachability Logic: An Efficient Fragment of Transitive Closure Logic
Natasha Alechina, Neil Immerman
FSTTCS
2004
Springer
15 years 3 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
ICALP
2009
Springer
15 years 2 months ago
Decidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quantiers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
Jakub Michaliszyn
ICDT
2003
ACM
121views Database» more  ICDT 2003»
15 years 3 months ago
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
Floris Geerts, Bart Kuijpers
CSL
2004
Springer
15 years 3 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...