Sciweavers

CSL
2006
Springer
14 years 1 months ago
First-Order Queries over One Unary Function
Arnaud Durand, Frédéric Olive
CSL
2006
Springer
14 years 1 months 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
14 years 1 months 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
14 years 1 months ago
Concurrent Games with Tail Objectives
Krishnendu Chatterjee
CSL
2006
Springer
14 years 1 months 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
14 years 1 months 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
14 years 1 months 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
14 years 1 months 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
CSL
2006
Springer
14 years 1 months ago
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
Manuel Bodirsky, Hubie Chen
CSL
2006
Springer
14 years 1 months ago
Logical Omniscience Via Proof Complexity
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...
Sergei N. Artëmov, Roman Kuznets