Sciweavers

FOSSACS
2006
Springer
14 years 2 months ago
A Semantic Approach to Interpolation
Andrei Popescu, Traian Serbanuta, Grigore Rosu
FOSSACS
2006
Springer
14 years 2 months ago
Dynamic Policy Discovery with Remote Attestation
Corin Pitcher, James Riely
FOSSACS
2006
Springer
14 years 2 months ago
Register Allocation After Classical SSA Elimination is NP-Complete
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...
Fernando Magno Quintão Pereira, Jens Palsbe...
FOSSACS
2006
Springer
14 years 2 months ago
On Metric Temporal Logic and Faulty Turing Machines
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 ...
Joël Ouaknine, James Worrell
FOSSACS
2006
Springer
14 years 2 months ago
Reversing Algebraic Process Calculi
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...
Iain C. C. Phillips, Irek Ulidowski
FOSSACS
2006
Springer
14 years 2 months ago
A Logic of Reachable Patterns in Linked Data-Structures
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 ...
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sag...
FOSSACS
2006
Springer
14 years 2 months ago
Propositional Dynamic Logic with Recursive Programs
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...
Christof Löding, Olivier Serre
FOSSACS
2006
Springer
14 years 2 months ago
Parity Games Played on Transition Graphs of One-Counter Processes
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...
Olivier Serre
FOSSACS
2006
Springer
14 years 2 months ago
Smooth Orchestrators
A smooth orchestrator is a process with several alternative branches, every one defining synchronizations among co-located channels. Smooth orchestrators constitute a basic mechani...
Cosimo Laneve, Luca Padovani
FOSSACS
2006
Springer
14 years 2 months ago
A Finite Model Construction for Coalgebraic Modal Logic
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...
Lutz Schröder