164 search results - page 27 / 33 » A Decidable Fragment of Separation Logic |
208
click to vote
PODS
2009
ACM
16 years 2 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
148
Voted
LICS
2006
IEEE
15 years 7 months ago
2006
IEEE
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
120
Voted
COCO
2003
Springer
15 years 7 months ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
146
Voted
MPC
2010
Springer
15 years 3 months ago
2010
Springer
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
110
click to vote
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....