Sciweavers

164 search results - page 9 / 33
» A Decidable Fragment of Separation Logic
Sort
View
FOSSACS
2009
Springer
14 years 2 months ago
Separating Graph Logic from MSO
Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of ...
Timos Antonopoulos, Anuj Dawar
CADE
2001
Springer
14 years 8 months ago
Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
Jörg Lücke
APLAS
2005
ACM
14 years 1 months ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
DKE
2007
136views more  DKE 2007»
13 years 7 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda
ECAI
2010
Springer
13 years 8 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...