Sciweavers

CSL
2009
Springer
14 years 6 months ago
Nested Hoare Triples and Frame Rules for Higher-Order Store
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
Jan Schwinghammer, Lars Birkedal, Bernhard Reus, H...
CSL
2009
Springer
14 years 6 months ago
Algorithmic Analysis of Array-Accessing Programs
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
Rajeev Alur, Pavol Cerný, Scott Weinstein
CSL
2009
Springer
14 years 6 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
CSL
2009
Springer
14 years 6 months ago
On the Parameterised Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
Stephan Kreutzer
CSL
2009
Springer
14 years 6 months ago
Enriching an Effect Calculus with Linear Types
We define an “enriched effect calculus” by extending a type theory for computational effects with primitives from linear logic. The new calculus, which generalises intuitionis...
Jeff Egger, Rasmus Ejlers Møgelberg, Alex S...
CSL
2009
Springer
14 years 6 months ago
Expanding the Realm of Systematic Proof Theory
Abstract. This paper is part of a general project of developing a systematic and algebraic proof theory for nonclassical logics. Generalizing our previous work on intuitionistic-su...
Agata Ciabattoni, Lutz Straßburger, Kazushig...
CSL
2009
Springer
14 years 6 months ago
Decision Problems for Nash Equilibria in Stochastic Games
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
Michael Ummels, Dominik Wojtczak
CSL
2009
Springer
14 years 6 months ago
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...
Albert Atserias, Mark Weyer