Sciweavers

LICS
2008
IEEE
15 years 10 months ago
Structural Logical Relations
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
Carsten Schürmann, Jeffrey Sarnat
LICS
2008
IEEE
15 years 10 months ago
On the Expressiveness and Complexity of Randomization in Finite State Monitors
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
LICS
2008
IEEE
15 years 10 months ago
On the Expressiveness and Decidability of Higher-Order Process Calculi
In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators nec...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...
LICS
2008
IEEE
15 years 10 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
LICS
2008
IEEE
15 years 10 months ago
Context Matching for Compressed Terms
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
Adria Gascón, Guillem Godoy, Manfred Schmid...
LICS
2008
IEEE
15 years 10 months ago
A Logic for Algebraic Effects
We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the a-calculus, a minimal calcu...
Gordon D. Plotkin, Matija Pretnar
114
Voted
LICS
2008
IEEE
15 years 10 months ago
The Ordinal Recursive Complexity of Lossy Channel Systems
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
Pierre Chambart, Ph. Schnoebelen
LICS
2008
IEEE
15 years 10 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski
LICS
2008
IEEE
15 years 10 months ago
A Logical Characterization of Individual-Based Models
Individual-based models are a relatively new approach to modelling dynamical systems of interacting entities, for example molecules in a biological cell. Although they are computa...
James F. Lynch