Sciweavers

39 search results - page 6 / 8
» Ordering Constraints over Feature Trees Expressed in Second-...
Sort
View
105
Voted
ICTL
1994
15 years 2 months ago
Completeness through Flatness in Two-Dimensional Temporal Logic
We introduce a temporal logic TAL and prove that it has several nice features. The formalism is a two-dimensional modal system in the sense that formulas of the language are evalua...
Yde Venema
103
Voted
CORR
2007
Springer
133views Education» more  CORR 2007»
14 years 10 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
145
Voted
POPL
2011
ACM
14 years 1 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
126
Voted
CORR
2004
Springer
177views Education» more  CORR 2004»
14 years 10 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
102
Voted
CSFW
2003
IEEE
15 years 3 months ago
Understanding SPKI/SDSI Using First-Order Logic
SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-order logic (FOL) semantics for SDSI, and show that it ha...
Ninghui Li, John C. Mitchell