Sciweavers

FSTTCS
2007
Springer
13 years 10 months ago
Symbolic Bisimulation for the Applied Pi Calculus
Stéphanie Delaune, Steve Kremer, Mark Ryan
FSTTCS
2007
Springer
13 years 10 months ago
Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables that hold secret data to variables that hold public data. In this work we...
Judicaël Courant, Cristian Ene, Yassine Lakhn...
FSTTCS
2007
Springer
13 years 10 months ago
Safely Composing Security Protocols
Security protocols are small programs that are executed in hostile environments. Many results and tools have been developed to formally analyze the security of a protocol. However ...
Véronique Cortier, Jérémie De...
FSTTCS
2007
Springer
13 years 10 months ago
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
We introduce PEP, the Post Embedding Problem, a variant of PCP where one compares strings with the subword relation, and PEPreg , a further variant where solutions are constrained ...
Pierre Chambart, Ph. Schnoebelen
FSTTCS
2007
Springer
13 years 10 months ago
Triangulations of Line Segment Sets in the Plane
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
Mathieu Brévilliers, Nicolas Chevallier, Do...
FSTTCS
2007
Springer
13 years 10 months ago
Propositional Dynamic Logic for Message-Passing Systems
We examine a bidirectional Propositional Dynamic Logic (PDL) for message sequence charts (MSCs) extending LTL and TLC− . Every formula is translated into an equivalent communicat...
Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
FSTTCS
2007
Springer
13 years 10 months ago
Undirected Graphs of Entanglement 2
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale
FSTTCS
2007
Springer
13 years 10 months ago
Synthesis of Safe Message-Passing Systems
We show that any regular set of basic MSCs can be implemented by a deadlock-free communicating finite-state machine with local termination: Processes stop in local dead-states ind...
Nicolas Baudru, Rémi Morin