CSL
2006
Springer
14 years 3 months ago
2006
Springer
CSL
2006
Springer
14 years 3 months ago
2006
Springer
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...
CSL
2006
Springer
14 years 3 months ago
2006
Springer
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...
CSL
2006
Springer
14 years 3 months ago
2006
Springer
CSL
2006
Springer
14 years 3 months ago
2006
Springer
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...
CSL
2006
Springer
14 years 3 months ago
2006
Springer
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...
CSL
2006
Springer
14 years 3 months ago
2006
Springer
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 ...
CSL
2006
Springer
14 years 3 months ago
2006
Springer
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...
CSL
2006
Springer
14 years 3 months ago
2006
Springer
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...
CSL
2006
Springer
14 years 3 months ago
2006
Springer
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...