LICS A*

47 papers

YearTitle / Authors
2010A Calculus of Contracting Processes.
Massimo Bartoletti, Roberto Zunino
2010A Finiteness Structure on Resource Terms.
Thomas Ehrhard
2010A Generic Operational Metatheory for Algebraic Effects.
Patricia Johann, Alex Simpson, Janis Voigtländer
2010A Sound and Complete Calculus for Finite Stream Circuits.
Stefan Milius
2010Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction.
Vincent Danos, Jérôme Feret, Walter Fontana, Russell Harmer, Jean Krivine
2010Addition-Invariant FO and Regularity.
Nicole Schweikardt, Luc Segoufin
2010Alternating Timed Automata over Bounded Time.
Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell
2010Amir Pnueli: A Gentle Giant, Lord of the Phi's and the Psi's.
David Harel
2010An Extension of Data Automata that Captures XPath.
Mikolaj Bojanczyk, Slawomir Lasota
2010An Intuitionistic Logic that Proves Markov's Principle.
Hugo Herbelin
2010Breaking Paths in Atomic Flows for Classical Logic.
Alessio Guglielmi, Tom Gundersen, Lutz Straßburger
2010Capturing Polynomial Time on Interval Graphs.
Bastian Laubner
2010Coalgebras, Chu Spaces, and Representations of Physical Systems.
Samson Abramsky
2010Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications.
Andrea Calì, Georg Gottlob, Thomas Lukasiewicz, Bruno Marnette, Andreas Pieris
2010Deciding Definability in FO
Thomas Place, Luc Segoufin
2010Equality Is Typable in Semi-full Pure Type Systems.
Vincent Siles, Hugo Herbelin
2010Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors.
Martin Grohe
2010Game Semantics for a Polymorphic Programming Language.
James Laird
2010Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment.
Martin Otto
2010Infinitary Completeness in Ludics.
Michele Basaldella, Kazushige Terui
2010Lower Bounds for the Complexity of Monadic Second-Order Logic.
Stephan Kreutzer, Siamak Tazari
2010Modular Construction of Fixed Point Combinators and Clocked Bohm Trees.
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
2010New Conditions for Taylor Varieties and CSP.
Libor Barto, Marcin Kozik
2010On Probabilistic Automata in Continuous Time.
Christian Eisentraut, Holger Hermanns, Lijun Zhang
2010On Strong Maximality of Paraconsistent Finite-Valued Logics.
Arnon Avron, Ofer Arieli, Anna Zamansky
2010On the Expressivity of Symmetry in Event Structures.
Sam Staton, Glynn Winskel
2010On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction.
Manuel Bodirsky, Martin Hils, Barnaby Martin
2010On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures.
Yuguo He
2010Parikh Images of Grammars: Complexity and Applications.
Eryk Kopczynski, Anthony Widjaja To
2010Polarity and the Logic of Delimited Continuations.
Noam Zeilberger
2010Probabilistic Information Flow.
Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi
2010Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom
2010Querying the Guarded Fragment.
Vince Bárány, Georg Gottlob, Martin Otto
2010Recursion Schemes and Logical Reflection.
Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
2010Regular Cost Functions over Finite Trees.
Thomas Colcombet, Christof Löding
2010Robin Milner, a Craftsman of Tools for the Mind.
Gordon D. Plotkin
2010Segal Condition Meets Computational Effects.
Paul-André Melliès
2010Strong Normalization for System F by HOAS on Top of FOAS.
Andrei Popescu, Elsa L. Gunter, Christopher J. Osborn
2010The Emptiness Problem for Tree Automata with Global Constraints.
Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher
2010The Expressive Power of Synchronizations.
Cosimo Laneve, Antonio Vitale
2010The Fine Print of Security.
Martín Abadi
2010The Isomorphism Problem on Classes of Automatic Structures.
Dietrich Kuske, Jiamou Liu, Markus Lohrey
2010The Undecidability of Boolean BI through Phase Semantics.
Dominique Larchey-Wendling, Didier Galmiche
2010Theorem Proving for Verification: The Early Days.
J Strother Moore
2010Undecidability of Propositional Separation Logic and Its Neighbours.
James Brotherston, Max I. Kanovich
2010Weak Equivalences in Psi-Calculi.
Magnus Johansson, Jesper Bengtson, Joachim Parrow, Björn Victor
2010omega-QRB-Domains and the Probabilistic Powerdomain.
Jean Goubault-Larrecq