Sciweavers

FOSSACS
2007
Springer
15 years 6 months ago
Logical Reasoning for Higher-Order Functions with Local State
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
Nobuko Yoshida, Kohei Honda, Martin Berger
FOSSACS
2007
Springer
15 years 6 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
FOSSACS
2007
Springer
15 years 6 months ago
Complexity Results on Balanced Context-Free Languages
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Akihiko Tozawa, Yasuhiko Minamide
FOSSACS
2007
Springer
15 years 4 months ago
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...
FOSSACS
2007
Springer
15 years 6 months ago
Relational Parametricity and Separation Logic
Abstract. Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new inte...
Lars Birkedal, Hongseok Yang
Software Engineering
Top of PageReset Settings