ACMSE
2005
ACM
14 years 5 months ago
2005
ACM
Traditionally, computer science education has considered “objects-first” or “imperative-first” approaches, with the focus of the course on teaching design of programs star...
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
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 ...
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
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...
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
Run-time type analysis allows programmers to easily and concisely define operations based upon type structure, such as serialization, iterators, and structural equality. However,...
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
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...
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
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...
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...