Sciweavers

508 search results - page 15 / 102
» A logical account of pspace
Sort
View
STACS
2010
Springer
14 years 2 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
BIRTHDAY
2003
Springer
14 years 22 days ago
A Logic of Object-Oriented Programs
Abstract. We develop a logic for reasoning about object-oriented programs. The logic is for a language with an imperative semantics and aliasing, and accounts for self-reference in...
Martín Abadi, K. Rustan M. Leino
CADE
2006
Springer
14 years 7 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 7 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick
FSTTCS
2010
Springer
13 years 5 months ago
Expressiveness of streaming string transducers
Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and us...
Rajeev Alur, Pavol Cerný