Sciweavers

164 search results - page 16 / 33
» A Decidable Fragment of Separation Logic
Sort
View
ICDT
2007
ACM
114views Database» more  ICDT 2007»
14 years 1 months ago
Axiomatizing the Logical Core of XPath 2.0
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
Balder ten Cate, Maarten Marx
JANCL
2006
74views more  JANCL 2006»
13 years 7 months ago
Linear-time temporal logics with Presburger constraints: an overview
We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are welldesi...
Stéphane Demri
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 7 months ago
Separability in the Ambient Logic
Abstract. The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semi...
Daniel Hirschkoff, Étienne Lozes, Davide Sa...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 7 months ago
Nominal Unification from a Higher-Order Perspective
Abstract. Nominal Logic is an extension of first-order logic with equality, name-binding, name-swapping, and freshness of names. Contrarily to higher-order logic, bound variables a...
Jordi Levy, Mateu Villaret
CADE
2005
Springer
14 years 8 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard