LICS A*

67 papers

YearTitle / Authors
2012A Computational Interpretation of Parametricity.
Jean-Philippe Bernardy, Guilhem Moulin
2012A Constructive Proof of Dependent Choice, Compatible with Classical Logic.
Hugo Herbelin
2012A Higher-Order Distributed Calculus with Name Creation.
Adrien Piérard, Eijiro Sumii
2012A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism.
Annabelle McIver, Larissa Meinicke, Carroll Morgan
2012A Perfect Model for Bounded Verification.
Javier Esparza, Pierre Ganty, Rupak Majumdar
2012An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction.
Hubie Chen, Moritz Müller
2012An Automata Model for Trees with Ordered Data Values.
Tony Tan
2012An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus.
Damiano Mazza
2012Approximate Verification of the Symbolic Dynamics of Markov Chains.
Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan
2012Automatic Sequences and Zip-Specifications.
Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss
2012Backward induction in games of perfect information.
Robert J. Aumann
2012Better Abstractions for Timed Automata.
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2012Capsules and Separation.
Jean-Baptiste Jeannin, Dexter Kozen
2012Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection.
Arnaud Carayol, Olivier Serre
2012Combining Deduction Modulo and Logics of Fixed-Point Definitions.
David Baelde, Gopalan Nadathur
2012Conservative Concurrency in Haskell.
David Sabel, Manfred Schmidt-Schauß
2012Constructing Fully Complete Models for Multiplicative Linear Logic.
Andrea Schalk, Hugh P. Steele
2012Coproducts of Monads on Set.
Jirí Adámek, Stefan Milius, Nathan J. Bowler, Paul Blain Levy
2012Countermodels from Sequent Calculi in Multi-Modal Logics.
Deepak Garg, Valerio Genovese, Sara Negri
2012Decidability of DPDA Language Equivalence via First-Order Grammars.
Petr Jancar
2012Decidable Elementary Modal Logics.
Jakub Michaliszyn, Jan Otop
2012Decidable Problems for Probabilistic Automata on Infinite Words.
Krishnendu Chatterjee, Mathieu Tracol
2012Deciding the Value 1 Problem for Probabilistic Leaktight Automata.
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
2012Decomposing Quantified Conjunctive (or Disjunctive) Formulas.
Hubie Chen, Víctor Dalmau
2012Delta-Decidability over the Reals.
Sicun Gao, Jeremy Avigad, Edmund M. Clarke
2012Dense-Timed Pushdown Automata.
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman
2012Extending Type Theory with Forcing.
Guilhem Jaber, Nicolas Tabareau, Matthieu Sozeau
2012First-Order and Monadic Second-Order Model-Checking on Ordered Structures.
Viktor Engelmann, Stephan Kreutzer, Sebastian Siebertz
2012Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving.
Dmitriy Traytel, Andrei Popescu, Jasmin Christian Blanchette
2012Functionals Using Bounded Information and the Dynamics of Algorithms.
Serge Grigorieff, Pierre Valarcher
2012Game Semantics in String Diagrams.
Paul-André Melliès
2012Graph Logics with Rational Relations and the Generalized Intersection Problem.
Pablo Barceló, Diego Figueira, Leonid Libkin
2012Higher Semantics of Quantum Protocols.
Jamie Vicary
2012Induction in Algebra: A First Case Study.
Peter Schuster
2012Inductive Types in Homotopy Type Theory.
Steven Awodey, Nicola Gambino, Kristina Sojakova
2012Interpretations in Trees with Countably Many Branches.
Alexander Rabinovich, Sasha Rubin
2012Learning Probabilistic Systems from Tree Samples.
Anvesh Komuravelli, Corina S. Pasareanu, Edmund M. Clarke
2012Logics of Dynamical Systems.
André Platzer
2012Lower Bounds for Existential Pebble Games and k-Consistency Tests.
Christoph Berkholz
2012Mean-Payoff Pushdown Games.
Krishnendu Chatterjee, Yaron Velner
2012Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics.
Arnon Avron, Beata Konikowska, Anna Zamansky
2012Near Unanimity Constraints Have Bounded Pathwidth Duality.
Libor Barto, Marcin Kozik, Ross Willard
2012Non-definability of Languages by Generalized First-order Formulas over (N, +).
Andreas Krebs, A. V. Sreejith
2012On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer.
Robert L. Constable
2012On the Complexity of Linear Authorization Logics.
Vivek Nigam
2012On the Magnitude of Completeness Thresholds in Bounded Model Checking.
Daniel Bundala, Joël Ouaknine, James Worrell
2012On the Ordered Conjecture.
Yijia Chen, Jörg Flum
2012On the Significance of the Collapse Operation.
Pawel Parys
2012Partial-Observation Stochastic Games: How to Win When Belief Fails.
Krishnendu Chatterjee, Laurent Doyen
2012Privacy, Anonymity, and Accountability in Ad-Supported Services.
Joan Feigenbaum
2012Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012
2012Regular Transformations of Infinite Strings.
Rajeev Alur, Emmanuel Filiot, Ashutosh Trivedi
2012Short Propositional Refutations for Dense Random 3CNF Formulas.
Sebastian Müller, Iddo Tzameret
2012Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects.
Naohiko Hoshino
2012Strong Complementarity and Non-locality in Categorical Quantum Mechanics.
Bob Coecke, Ross Duncan, Aleks Kissinger, Quanlong Wang
2012Term Rewriting and Lambda Calculus.
Jan Willem Klop
2012The Complete Proof Theory of Hybrid Systems.
André Platzer
2012The Complexity of Decomposing Modal and First-Order Theories.
Stefan Göller, Jean Christoph Jung, Markus Lohrey
2012The Complexity of Verbal Languages over Groups.
Sanjay Jain, Alexei Miasnikov, Frank Stephan
2012The HOM Problem is EXPTIME-Complete.
Carles Creus, Adrià Gascón, Guillem Godoy, Lander Ramos
2012The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets.
Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen
2012The Semantics of Parsing with Semantic Actions.
Robert Atkey
2012The Winning Ways of Concurrent Games.
Pierre Clairambault, Julian Gutierrez, Glynn Winskel
2012Turing's Password: What Internet Cannot Leak.
Leonid A. Levin
2012Two-Variable First-Order Logic with Equivalence Closure.
Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera
2012Von Neumann's Biased Coin Revisited.
Laurent Bienvenu, Benoit Monin
2012Where First-Order and Monadic Second-Order Logic Coincide.
Michael Elberfeld, Martin Grohe, Till Tantau