default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th LICS 2013: New Orleans, LA, USA
- 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013. IEEE Computer Society 2013, ISBN 978-1-4799-0413-6
Tutorial
- Hubert Comon-Lundh:
LICS: Logic in Computer Security - Some Attacker's Models and Related Decision Problems. 1
Invited Talks
- Joseph Y. Halpern:
From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic. 2-3 - Prakash Panangaden:
Duality in Logic and Computation. 4-11 - Nancy A. Lynch:
Timed and Probabilistic I/O Automata. 12 - Rajeev Alur, Loris D'Antoni, Jyotirmoy V. Deshmukh, Mukund Raghothaman
, Yifei Yuan:
Regular Functions and Cost Register Automata. 13-22
Session 1: Vector Addition Systems
- Jérôme Leroux:
Presburger Vector Addition Systems. 23-32 - Stéphane Demri, Diego Figueira, M. Praveen:
Reasoning about Data Repetitions with Counter Systems. 33-42 - Jérôme Leroux, Vincent Penelle, Grégoire Sutre:
On the Context-Freeness Problem for Vector Addition Systems. 43-52
Session 2: Finite Model Theory
- Martin Otto:
Groupoids, Hypergraphs, and Symmetries in Finite Models. 53-62 - Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt:
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree. 63-72 - Witold Charatonik, Piotr Witkowski:
Two-Variable Logic with Counting and Trees. 73-82
Session 3: Complexity Theory and Quantum Computation
- Bart Jacobs:
Measurable Spaces and Their Effect Logic. 83-92 - Jamie Vicary:
Topological Structure of Quantum Algorithms. 93-102 - Hugo Férée, Mathieu Hoyrup, Walid Gomaa:
On the Query Complexity of Real Functionals. 103-112
Session 4: Quantitative Approach
- Stephan Kreutzer, Cristian Riveros:
Quantitative Monadic Second-Order Logic. 113-122 - Thomas Colcombet:
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory. 123 - Jan Hoffmann, Michael Marmar, Zhong Shao:
Quantitative Reasoning for Proving Lock-Freedom. 124-133
Session 5: Model Checking
- Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer:
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes. 134-142 - Philippe Balbiani, Andreas Herzig, Nicolas Troquard:
Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL. 143-152 - Anudhyan Boral, Sylvain Schmitz:
Model-Checking Parse Trees. 153-162 - Benedikt Bollig, Dietrich Kuske, Roy Mennicke:
The Complexity of Model Checking Multi-stack Systems. 163-172
Session 6: Complexity and Computability
- Matthew Anderson, Anuj Dawar, Bjarki Holm:
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting. 173-182 - Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk:
Turing Machines with Atoms. 183-192 - Angelo Montanari, Pietro Sala:
Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness. 193-202 - Piotr Hofman, Richard Mayr, Patrick Totzke:
Decidability of Weak Simulation on One-Counter Nets. 203-212
Session 7: Type Theory and Applications
- Lars Birkedal, Rasmus Ejlers Møgelberg:
Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes. 213-222 - Daniel R. Licata, Michael Shulman:
Calculating the Fundamental Group of the Circle in Homotopy Type Theory. 223-232 - Jorge Luis Sacchini:
Type-Based Productivity of Stream Definitions in the Calculus of Constructions. 233-242 - Neil Ghani, Lorenzo Malatesta, Fredrik Nordvall Forsberg, Anton Setzer:
Fibred Data Types. 243-252
Session 8: Multi-agent Systems and Programming Languages
- James Hales:
Arbitrary Action Model Logic and Action Model Synthesis. 253-262 - Fabio Mogavero, Aniello Murano, Luigi Sauro:
On the Boundary of Behavioral Strategies. 263-272 - Sergey Goncharov, Lutz Schröder:
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects. 273-282 - Chuck C. Liang, Dale Miller:
Unifying Classical and Intuitionistic Logics for Computational Control. 283-292
Session 9: Lambda Calculus
- Andrea Asperti, Jean-Jacques Lévy:
The Cost of Usage in the Lambda-Calculus. 293-300 - Jim Laird, Giulio Manzonetto, Guy McCusker, Michele Pagani:
Weighted Relational Models of Typed Lambda-Calculi. 301-310 - Tom Gundersen, Willem Heijltjes, Michel Parigot:
Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing. 311-320
Session 10: The Probabilistic Setting
- Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden:
Stone Duality for Markov Processes. 321-330 - Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Trading Performance for Stability in Markov Decision Processes. 331-340 - Sumit Nain, Moshe Y. Vardi:
Solving Partial-Information Stochastic Parity Games. 341-348
Session 11: Temporal Logic
- Paul Hunter, Joël Ouaknine, James Worrell:
Expressive Completeness for Metric Temporal Logic. 349-357 - Grigore Rosu, Andrei Stefanescu, Stefan Ciobaca, Brandon M. Moore:
One-Path Reachability Logic. 358-367 - Massimo Benerecetti, Fabio Mogavero, Aniello Murano:
Substructure Temporal Logic. 368-377
Session 12: Process Calculus and Recursion Theory
- Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Name-Passing Calculi: From Fusions to Preorders and Types. 378-387 - Ioana Cristescu, Jean Krivine, Daniele Varacca:
A Compositional Semantics for the Reversible p-Calculus. 388-397 - Naoki Kobayashi:
Pumping by Typing. 398-407
Session 13: Modal Logic and Proof Theory
- Ori Lahav:
From Frame Properties to Hypersequent Rules in Modal Logics. 408-417 - Dirk Pattinson:
The Logic of Exact Covers: Completeness and Uniform Interpolation. 418-427 - Beniamino Accattoli:
Compressing Polarized Boxes. 428-437 - Achim Jung, Umberto Rivieccio:
Kripke Semantics for Modal Bilattice Logic. 438-447
Session 14: Logic, Automata, and Transducers
- Colin Riba:
Forcing MSO on Infinite Words in Weak MSO. 448-457 - Rajeev Alur, Antoine Durand-Gasselin, Ashutosh Trivedi:
From Monadic Second-Order Definable String Transformations to Transducers. 458-467 - Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
From Two-Way to One-Way Finite State Transducers. 468-477 - Alessandro Facchini, Yde Venema, Fabio Zanasi:
A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus. 478-487
Session 15: Automata Theory
- Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski:
Bisimilarity of Pushdown Automata is Nonelementary. 488-498 - Alessandro Facchini, Filip Murlak, Michal Skrzypczak:
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata. 499-508 - Swarat Chaudhuri, Sriram Sankaranarayanan, Moshe Y. Vardi:
Regular Real Analysis. 509-518
Session 16: Algebraic Approach
- Sam Staton:
Instances of Computational Effects: An Algebraic Perspective. 519 - Marcelo P. Fiore, Makoto Hamana:
Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic. 520-529 - Pierre-Évariste Dagand, Conor McBride:
A Categorical Treatment of Ornaments. 530-539
Session 17: Databases
- Tomasz Gogacz, Jerzy Marcinkowski:
Converging to the Chase - A Tool for Finite Controllability. 540-549 - Gaëlle Fontaine:
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? 550-559 - Olle Fredriksson, Dan R. Ghica:
Abstract Machines for Game Semantics, Revisited. 560-569
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-11 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
