Sciweavers

FOSSACS
2009
Springer
13 years 11 months ago
Cryptographic Protocol Composition via the Authentication Tests
Although cryptographic protocols are typically analyzed in isolation, they are used in combinations. If a protocol was analyzed alone and shown to meet some security goals, will it...
Joshua D. Guttman
FOSSACS
2009
Springer
13 years 11 months ago
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
Parosh Aziz Abdulla, Richard Mayr
FOSSACS
2009
Springer
13 years 11 months ago
Coalgebraic Hybrid Logic
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...
Rob Myers, Dirk Pattinson, Lutz Schröder
FOSSACS
2009
Springer
13 years 11 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
FOSSACS
2009
Springer
13 years 11 months ago
Synthesis from Component Libraries
Abstract. Synthesis is the automatic construction of a system from its specification. In the classical synthesis algorithms it is always assumed the system is “constructed from ...
Yoad Lustig, Moshe Y. Vardi
FOSSACS
2009
Springer
13 years 11 months ago
Parameter Reduction in Grammar-Compressed Trees
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...
FOSSACS
2009
Springer
13 years 11 months ago
Dependency Tree Automata
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
Colin Stirling
FOSSACS
2009
Springer
13 years 11 months ago
Interrupt Timed Automata
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...
Béatrice Bérard, Serge Haddad