Sciweavers

CSL
2006
Springer
15 years 16 days ago
Weak Bisimulation Approximants
Abstract. Bisimilarity and weak bisimilarity are canonical notions of equivalence between processes, which are defined co-inductively, but may be approached
Will Harwood, Faron Moller, Anton Setzer
CSL
2006
Springer
15 years 16 days ago
Jump from Parallel to Sequential Proofs: Multiplicatives
We introduce a new class of multiplicative proof nets, J-proof nets, which are a typed version of Faggian and Maurel's multiplicative L-nets. In J-proof nets, we can character...
Paolo Di Giamberardino, Claudia Faggian
CSL
2006
Springer
15 years 16 days ago
First-Order Queries over One Unary Function
Arnaud Durand, Frédéric Olive
74
Voted
CSL
2006
Springer
15 years 16 days ago
Relating Two Standard Notions of Secrecy
Abstract. Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s sh...
Véronique Cortier, Michaël Rusinowitch...
CSL
2006
Springer
15 years 16 days ago
Algorithms for Omega-Regular Games with Imperfect Information,
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
CSL
2006
Springer
15 years 16 days ago
Concurrent Games with Tail Objectives
Krishnendu Chatterjee
CSL
2006
Springer
15 years 16 days ago
Reasoning About States of Probabilistic Sequential Programs
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
Rohit Chadha, Paulo Mateus, Amílcar Sernada...
CSL
2006
Springer
15 years 16 days ago
On Rational Trees
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...
Arnaud Carayol, Christophe Morvan
CSL
2006
Springer
15 years 16 days ago
Towards an Implicit Characterization of NCk
We define a hierarchy of term systems Tk by means of restrictions of the recursion schema. We essentially use a pointer technique together with tiering. We prove Tk NCk Tk+1 , for ...
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Mari...
CSL
2006
Springer
15 years 16 days ago
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms...
Vincent Atassi, Patrick Baillot, Kazushige Terui