Sciweavers

CSL
2008
Springer
14 years 19 days ago
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
Abstract. This paper shows undecidability of type-checking and typeinference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragmen...
Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama,...
CSL
2010
Springer
14 years 19 days ago
Classical and Intuitionistic Subexponential Logics Are Equally Expressive
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented i...
Kaustuv Chaudhuri
CSL
2010
Springer
14 years 19 days ago
Automata vs. Logics on Data Words
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
Michael Benedikt, Clemens Ley, Gabriele Puppis
CSL
2010
Springer
14 years 19 days ago
Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries
Abstract. We present a symbolic framework, based on a modular operational semantics, for formalizing different notions of compromise relevant for the analysis of cryptographic prot...
David A. Basin, Cas J. F. Cremers
CSL
2010
Springer
14 years 19 days ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel
CSL
2010
Springer
14 years 19 days ago
Graded Computation Tree Logic with Binary Coding
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
Alessandro Bianco, Fabio Mogavero, Aniello Murano
CSL
2010
Springer
14 years 19 days ago
Exact Exploration and Hanging Algorithms
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
CSL
2010
Springer
14 years 19 days ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous
CSL
2010
Springer
14 years 19 days ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek