FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
Metric Temporal Logic (MTL) is a real-time extension of Linear Temporal Logic that was proposed fifteen years ago and has since been extensively studied. Since the early 1990s, it ...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languag...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
A smooth orchestrator is a process with several alternative branches, every one defining synchronizations among co-located channels. Smooth orchestrators constitute a basic mechani...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...