Sciweavers

LICS
2005
IEEE
13 years 10 months ago
Name Generation and Linearity
A path-based domain theory for higher-order processes is extended to allow name generation. The original domain theory is built around the monoidal-closed category Lin consisting ...
Glynn Winskel
LICS
2005
IEEE
13 years 10 months ago
Relations in Concurrency
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisa...
Glynn Winskel
LICS
2005
IEEE
13 years 10 months ago
Generalizing Parametricity Using Information-flow
Run-time type analysis allows programmers to easily and concisely define operations based upon type structure, such as serialization, iterators, and structural equality. However,...
Geoffrey Washburn, Stephanie Weirich
LICS
2005
IEEE
13 years 10 months ago
Reactive Systems over Cospans
The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of well-behaved labelled transition systems (LTS) for...
Vladimiro Sassone, Pawel Sobocinski
LICS
2005
IEEE
13 years 10 months ago
On the Decidability of Metric Temporal Logic
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...
Joël Ouaknine, James Worrell
LICS
2005
IEEE
13 years 10 months ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
LICS
2005
IEEE
13 years 10 months ago
Eager Normal Form Bisimulation
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
Soren Lassen