Search results for "CSL"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Alexis Saurin	On the Relations between the Syntactic Theories of lambda-mu-Calculi.	CSL	2008	DBLP DOI BibTeX RDF	Classical ?-calculi, ??-calculi, Streams, Type Systems, Confluence, Strong Normalization
1	Anuj Dawar, Erich Grädel	The Descriptive Complexity of Parity Games.	CSL	2008	DBLP DOI BibTeX RDF
1	Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem	Recursion Schemata for NCk.	CSL	2008	DBLP DOI BibTeX RDF
1	Andreas Abel 0001, Dulma Rodriguez	Syntactic Metatheory of Higher-Order Subtyping.	CSL	2008	DBLP DOI BibTeX RDF	Higher-order subtyping, bounded quantification, algorithmic subtyping, hereditary substitution
1	Johann A. Makowsky, Damian Niwinski	The Ackermann Award 2008.	CSL	2008	DBLP DOI BibTeX RDF
1	Mariangiola Dezani-Ciancaglini, Roberto Di Cosmo, Elio Giovannetti, Makoto Tatsuta	On Isomorphisms of Intersection Types.	CSL	2008	DBLP DOI BibTeX RDF
1	Pierre McKenzie, Michael Thomas 0001, Heribert Vollmer	Extensional Uniformity for Boolean Circuits.	CSL	2008	DBLP DOI BibTeX RDF	descriptive complexity, uniformity, Boolean circuits
1	Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano	Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence.	CSL	2008	DBLP DOI BibTeX RDF	domain-free type system, undecidability, existential type, CPS-translation
1	Gaëlle Fontaine	Continuous Fragment of the mu-Calculus.	CSL	2008	DBLP DOI BibTeX RDF	Scott continuity, constructive fixpoints, preservation results, automata, mu-calculus
1	Olivier Hermant, James Lipton	A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms.	CSL	2008	DBLP DOI BibTeX RDF
1	Olaf Beyersdorff, Sebastian Müller 0003	A Tight Karp-Lipton Collapse Result in Bounded Arithmetic.	CSL	2008	DBLP DOI BibTeX RDF	Karp-Lipton Theorem, Optimal Propositional Proof Systems, Extended Frege, Bounded Arithmetic, Advice
1	Matthias Horbach, Christoph Weidenbach	Superposition for Fixed Domains.	CSL	2008	DBLP DOI BibTeX RDF
1	Michael Kaminski, Simone Martini 0001 (eds.)	Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings	CSL	2008	DBLP DOI BibTeX RDF
1	Krishnendu Chatterjee, Laurent Doyen 0001, Thomas A. Henzinger	Quantitative Languages.	CSL	2008	DBLP DOI BibTeX RDF
1	Wolfgang Thomas	Model Transformations in Decidability Proofs for Monadic Theories.	CSL	2008	DBLP DOI BibTeX RDF
1	Gilles Barthe, Benjamin Grégoire, Colin Riba	Type-Based Termination with Sized Products.	CSL	2008	DBLP DOI BibTeX RDF
1	Jochen Eisinger	Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract).	CSL	2008	DBLP DOI BibTeX RDF
1	Phuong Nguyen	Proving Infinitude of Prime Numbers Using Binomial Coefficients.	CSL	2008	DBLP DOI BibTeX RDF
1	Salvatore La Torre, P. Madhusudan, Gennaro Parlato	An Infinite Automaton Characterization of Double Exponential Time.	CSL	2008	DBLP DOI BibTeX RDF
1	Thomas Place	Characterization of Logics over Ranked Tree Languages.	CSL	2008	DBLP DOI BibTeX RDF
1	Sven Schewe	An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games.	CSL	2008	DBLP DOI BibTeX RDF
1	Shin-ya Katsumata	A Characterisation of Lambda Definability with Sums Via TT-Closure Operators.	CSL	2008	DBLP DOI BibTeX RDF
1	Thomas Colcombet, Christof Löding	The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem.	CSL	2008	DBLP DOI BibTeX RDF
1	Rémi Brochenin, Stéphane Demri, Étienne Lozes	On the Almighty Wand.	CSL	2008	DBLP DOI BibTeX RDF
1	Pierre-Louis Curien	The Joy of String Diagrams.	CSL	2008	DBLP DOI BibTeX RDF
1	Martin Hofmann 0001, Ulrich Schöpp	Pure Pointer Programs with Iteration.	CSL	2008	DBLP DOI BibTeX RDF
1	Luca Cardelli	Molecules as Automata.	CSL	2008	DBLP DOI BibTeX RDF
1	Ruzica Piskac, Viktor Kuncak	Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars.	CSL	2008	DBLP DOI BibTeX RDF	verification and program analysis, cardinality operator, mixed linear integer-rational arithmetic, fuzzy sets, sets, multisets
1	Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio	The Computability Path Ordering: The End of a Quest.	CSL	2008	DBLP DOI BibTeX RDF
1	Nadia Creignou, Henning Schnoor, Ilka Schnoor	Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint.	CSL	2008	DBLP DOI BibTeX RDF
1	Andrzej S. Murawski	Bad Variables Under Control.	CSL	2007	DBLP DOI BibTeX RDF
1	Eryk Kopczynski	Omega-Regular Half-Positional Winning Conditions.	CSL	2007	DBLP DOI BibTeX RDF	omega-regular languages, positional strategies, winning condtions, automata, infinite games
1	Mikolaj Bojanczyk	Forest Expressions.	CSL	2007	DBLP DOI BibTeX RDF
1	Paulin Jacobé de Naurois, Virgile Mogbil	Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete.	CSL	2007	DBLP DOI BibTeX RDF
1	Alexander Rabinovich, Wolfgang Thomas	Logical Refinements of Church's Problem.	CSL	2007	DBLP DOI BibTeX RDF
1	Yijia Chen, Jörg Flum	Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping.	CSL	2007	DBLP DOI BibTeX RDF
1	Dale Miller 0001, Vivek Nigam	Incorporating Tables into Proofs.	CSL	2007	DBLP DOI BibTeX RDF
1	Thomas Gawlitza, Helmut Seidl	Precise Relational Invariants Through Strategy Iteration.	CSL	2007	DBLP DOI BibTeX RDF
1	Konstantin Korovin, Andrei Voronkov	Integrating Linear Arithmetic into Superposition Calculus.	CSL	2007	DBLP DOI BibTeX RDF
1	Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison	Satisfiability of a Spatial Logic with Tree Variables.	CSL	2007	DBLP DOI BibTeX RDF
1	Arnaud Carayol, Christof Löding	MSO on the Infinite Binary Tree: Choice and Order.	CSL	2007	DBLP DOI BibTeX RDF
1	Klaus Aehlig, Arnold Beckmann	Propositional Logic for Circuit Classes.	CSL	2007	DBLP DOI BibTeX RDF
1	Arnold Beckmann	Proofs, Programs and Abstract Complexity.	CSL	2007	DBLP DOI BibTeX RDF
1	Jacques Duparc, Thomas A. Henzinger (eds.)	Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings	CSL	2007	DBLP DOI BibTeX RDF
1	Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas	A Cut-Free and Invariant-Free Sequent Calculus for PLTL.	CSL	2007	DBLP DOI BibTeX RDF
1	Alexandre Miquel	Classical Program Extraction in the Calculus of Constructions.	CSL	2007	DBLP DOI BibTeX RDF
1	Manuel Bodirsky, Hubie Chen	Qualitative Temporal and Spatial Reasoning Revisited.	CSL	2007	DBLP DOI BibTeX RDF
1	Stefan Göller	On the Complexity of Reasoning About Dynamic Policies.	CSL	2007	DBLP DOI BibTeX RDF
1	Delia Kesner	The Theory of Calculi with Explicit Substitutions Revisited.	CSL	2007	DBLP DOI BibTeX RDF
1	Marco Gaboardi, Simona Ronchi Della Rocca	A Soft Type Assignment System for lambda -Calculus.	CSL	2007	DBLP DOI BibTeX RDF
1	Jean Goubault-Larrecq	Continuous Previsions.	CSL	2007	DBLP DOI BibTeX RDF
1	Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin	Comparing the Expressive Power of Well-Structured Transition Systems.	CSL	2007	DBLP DOI BibTeX RDF	well-structured systems, language theory, Expressiveness
1	Luca de Alfaro	The Symbolic Approach to Repeated Games (Abstract).	CSL	2007	DBLP DOI BibTeX RDF
1	Guillaume Burel	Unbounded Proof-Length Speed-Up in Deduction Modulo.	CSL	2007	DBLP DOI BibTeX RDF	rewriting, arithmetic, higher order logic, proof theory
1	Chantal Berline, Giulio Manzonetto, Antonino Salibra	Lambda Theories of Effective Lambda Models.	CSL	2007	DBLP DOI BibTeX RDF	Effective lambda models, Recursively enumerable lambda theories, Löwenheim-Skolem theorem, Lambda calculus, Graph models
1	Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski	The Ackermann Award 2007.	CSL	2007	DBLP DOI BibTeX RDF
1	Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto	Not Enough Points Is Enough.	CSL	2007	DBLP DOI BibTeX RDF	?-models, relational model, ?-calculus, non-determinism, cartesian closed categories
1	Guillaume Bagan, Arnaud Durand 0001, Etienne Grandjean	On Acyclic Conjunctive Queries and Constant Delay Enumeration.	CSL	2007	DBLP DOI BibTeX RDF
1	Philipp Weis, Neil Immerman	Structure Theorem and Strict Alternation Hierarchy for FO2 on Words.	CSL	2007	DBLP DOI BibTeX RDF
1	Olivier Finkel, Dominique Lecomte	There Exist Some omega -Powers of Any Borel Rank.	CSL	2007	DBLP DOI BibTeX RDF	Infinite words, ?-languages, ?-powers, Cantor topology, topological complexity, Borel sets, Borel ranks, complete sets
1	Orna Kupferman	Tightening the Exchange Rates Between Automata.	CSL	2007	DBLP DOI BibTeX RDF
1	Jan Obdrzálek	Clique-Width and Parity Games.	CSL	2007	DBLP DOI BibTeX RDF
1	Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub	Building Decision Procedures in the Calculus of Inductive Constructions.	CSL	2007	DBLP DOI BibTeX RDF	Calculus of Inductive Constructions, Decision procedures, Theorem provers
1	Samson Abramsky	Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract).	CSL	2007	DBLP DOI BibTeX RDF
1	Anuj Dawar	Model-Checking First-Order Logic: Automata and Locality.	CSL	2007	DBLP DOI BibTeX RDF
1	Guy McCusker, David J. Pym	A Games Model of Bunched Implications.	CSL	2007	DBLP DOI BibTeX RDF
1	Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc	Classical and Intuitionistic Logic Are Asymptotically Identical.	CSL	2007	DBLP DOI BibTeX RDF	Implicational formulas, Tautologies, Analytic combinatorics, Intuitionistic logic
1	Klaus Aehlig, Stephen A. Cook, Phuong Nguyen	Relativizing Small Complexity Classes and Their Theories.	CSL	2007	DBLP DOI BibTeX RDF
1	Chuck C. Liang, Dale Miller 0001	Focusing and Polarization in Intuitionistic Logic.	CSL	2007	DBLP DOI BibTeX RDF
1	Alexander Hertel, Alasdair Urquhart	Game Characterizations and the PSPACE-Completeness of Tree Resolution Space.	CSL	2007	DBLP DOI BibTeX RDF
1	Naohiko Hoshino	Linear Realizability.	CSL	2007	DBLP DOI BibTeX RDF
1	Dale Miller 0001, Alexis Saurin	From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic.	CSL	2007	DBLP DOI BibTeX RDF
1	Anuj Dawar, David Richerby	The Power of Counting Logics on Restricted Classes of Finite Structures.	CSL	2007	DBLP DOI BibTeX RDF
1	Søren B. Lassen, Paul Blain Levy	Typed Normal Form Bisimulation.	CSL	2007	DBLP DOI BibTeX RDF
1	Nick Benton	Abstracting Allocation.	CSL	2006	DBLP DOI BibTeX RDF
1	Sven Schewe, Bernd Finkbeiner	Satisfiability and Finite Model Property for the Alternating-Time mu-Calculus.	CSL	2006	DBLP DOI BibTeX RDF
1	Krishnendu Chatterjee, Laurent Doyen 0001, Thomas A. Henzinger, Jean-François Raskin	Algorithms for Omega-Regular Games with Imperfect Information, .	CSL	2006	DBLP DOI BibTeX RDF
1	Rohit Chadha, Paulo Mateus, Amílcar Sernadas	Reasoning About States of Probabilistic Sequential Programs.	CSL	2006	DBLP DOI BibTeX RDF
1	Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem	Towards an Implicit Characterization of NCk.	CSL	2006	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract).	CSL	2006	DBLP DOI BibTeX RDF
1	Manuel Bodirsky, Hubie Chen	Collapsibility in Infinite-Domain Quantified Constraint Satisfaction.	CSL	2006	DBLP DOI BibTeX RDF
1	Bernhard Reus, Jan Schwinghammer	Separation Logic for Higher-Order Store.	CSL	2006	DBLP DOI BibTeX RDF
1	Alexander Moshe Rabinovich, Wolfgang Thomas	Decidable Theories of the Ordering of Natural Numbers with Unary Predicates.	CSL	2006	DBLP DOI BibTeX RDF
1	Will Harwood, Faron Moller, Anton Setzer	Weak Bisimulation Approximants.	CSL	2006	DBLP DOI BibTeX RDF
1	Krishnendu Chatterjee	Nash Equilibrium for Upward-Closed Objectives.	CSL	2006	DBLP DOI BibTeX RDF
1	Alexander Moshe Rabinovich	Church Synthesis Problem with Parameters.	CSL	2006	DBLP DOI BibTeX RDF
1	Krishnendu Chatterjee	Concurrent Games with Tail Objectives.	CSL	2006	DBLP DOI BibTeX RDF
1	Clemens Lautemann, Pascal Tesson, Denis Thérien	An Algebraic Point of View on the Crane Beach Property.	CSL	2006	DBLP DOI BibTeX RDF
1	Michele Pagani	Acyclicity and Coherence in Multiplicative Exponential Linear Logic.	CSL	2006	DBLP DOI BibTeX RDF
1	Stéphane Lengrand, Roy Dyckhoff, James McKinna	A Sequent Calculus for Type Theory.	CSL	2006	DBLP DOI BibTeX RDF
1	Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu	Relating Two Standard Notions of Secrecy.	CSL	2006	DBLP DOI BibTeX RDF
1	Arnaud Carayol, Christophe Morvan	On Rational Trees.	CSL	2006	DBLP DOI BibTeX RDF
1	Stefan Göller, Markus Lohrey	Infinite State Model-Checking of Propositional Dynamic Logics.	CSL	2006	DBLP DOI BibTeX RDF
1	Sergei N. Artëmov, Roman Kuznets	Logical Omniscience Via Proof Complexity.	CSL	2006	DBLP DOI BibTeX RDF
1	Arnaud Durand 0001, Frédéric Olive	First-Order Queries over One Unary Function.	CSL	2006	DBLP DOI BibTeX RDF
1	Andreas Abel 0001	Semi-continuous Sized Types and Termination.	CSL	2006	DBLP DOI BibTeX RDF
1	Vincent Atassi, Patrick Baillot, Kazushige Terui	Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic.	CSL	2006	DBLP DOI BibTeX RDF
1	Jirí Srba	Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation.	CSL	2006	DBLP DOI BibTeX RDF
1	Miroslaw Truszczynski	Nonmonotonic Logics and Their Algebraic Foundations.	CSL	2006	DBLP DOI BibTeX RDF
1	Guillaume Bagan	MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay.	CSL	2006	DBLP DOI BibTeX RDF

Publications at "CSL"( http://dblp.L3S.de/Venues/CSL )