Table of Contents

• LICS: Logic in Computer Security - Some Attacker's Models and Related Decision ProblemsHubert Comon-Lundh. 1 [doi]
• From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional LogicJoseph Y. Halpern. 2-3 [doi]
• Duality in Logic and ComputationPrakash Panangaden. 4-11 [doi]
• Timed and Probabilistic I/O AutomataNancy A. Lynch. 12 [doi]
• Regular Functions and Cost Register AutomataRajeev Alur, Loris D'Antoni, Jyotirmoy V. Deshmukh, Mukund Raghothaman, Yifei Yuan. 13-22 [doi]
• Presburger Vector Addition SystemsJérôme Leroux. 23-32 [doi]
• Reasoning about Data Repetitions with Counter SystemsStéphane Demri, Diego Figueira, M. Praveen. 33-42 [doi]
• On the Context-Freeness Problem for Vector Addition SystemsJérôme Leroux, Vincent Penelle, Grégoire Sutre. 43-52 [doi]
• Groupoids, Hypergraphs, and Symmetries in Finite ModelsMartin Otto. 53-62 [doi]
• An Optimal Gaifman Normal Form Construction for Structures of Bounded DegreeLucas Heimberg, Dietrich Kuske, Nicole Schweikardt. 63-72 [doi]
• Two-Variable Logic with Counting and TreesWitold Charatonik, Piotr Witkowski. 73-82 [doi]
• Measurable Spaces and Their Effect LogicBart Jacobs. 83-92 [doi]
• Topological Structure of Quantum AlgorithmsJamie Vicary. 93-102 [doi]
• On the Query Complexity of Real FunctionalsHugo Férée, Mathieu Hoyrup, Walid Gomaa. 103-112 [doi]
• Quantitative Monadic Second-Order LogicStephan Kreutzer, Cristian Riveros. 113-122 [doi]
• Magnitude Monadic Logic over Words and the Use of Relative Internal Set TheoryThomas Colcombet. 123 [doi]
• Quantitative Reasoning for Proving Lock-FreedomJan Hoffmann 0002, Michael Marmar, Zhong Shao. 124-133 [doi]
• Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph ClassesKord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer. 134-142 [doi]
• Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDLPhilippe Balbiani, Andreas Herzig, Nicolas Troquard. 143-152 [doi]
• Model-Checking Parse TreesAnudhyan Boral, Sylvain Schmitz. 153-162 [doi]
• The Complexity of Model Checking Multi-stack SystemsBenedikt Bollig, Dietrich Kuske, Roy Mennicke. 163-172 [doi]
• Maximum Matching and Linear Programming in Fixed-Point Logic with CountingMatthew Anderson, Anuj Dawar, Bjarki Holm. 173-182 [doi]
• Turing Machines with AtomsMikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk. 183-192 [doi]
• Adding an Equivalence Relation to the Interval Logic ABB: Complexity and ExpressivenessAngelo Montanari, Pietro Sala. 193-202 [doi]
• Decidability of Weak Simulation on One-Counter NetsPiotr Hofman, Richard Mayr, Patrick Totzke. 203-212 [doi]
• Intensional Type Theory with Guarded Recursive Types qua Fixed Points on UniversesLars Birkedal, Rasmus Ejlers Møgelberg. 213-222 [doi]
• Calculating the Fundamental Group of the Circle in Homotopy Type TheoryDaniel R. Licata, Michael Shulman. 223-232 [doi]
• Type-Based Productivity of Stream Definitions in the Calculus of ConstructionsJorge Luis Sacchini. 233-242 [doi]
• Fibred Data TypesNeil Ghani, Lorenzo Malatesta, Fredrik Nordvall Forsberg, Anton Setzer. 243-252 [doi]
• Arbitrary Action Model Logic and Action Model SynthesisJames Hales. 253-262 [doi]
• On the Boundary of Behavioral StrategiesFabio Mogavero, Aniello Murano, Luigi Sauro. 263-272 [doi]
• A Relatively Complete Generic Hoare Logic for Order-Enriched EffectsSergey Goncharov, Lutz Schröder. 273-282 [doi]
• Unifying Classical and Intuitionistic Logics for Computational ControlChuck Liang, Dale Miller. 283-292 [doi]
• The Cost of Usage in the Lambda-CalculusAndrea Asperti, Jean-Jacques Lévy. 293-300 [doi]
• Weighted Relational Models of Typed Lambda-CalculiJim Laird, Giulio Manzonetto, Guy McCusker, Michele Pagani. 301-310 [doi]
• Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit SharingTom Gundersen, Willem Heijltjes, Michel Parigot. 311-320 [doi]
• Stone Duality for Markov ProcessesDexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden. 321-330 [doi]
• Trading Performance for Stability in Markov Decision ProcessesTomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera. 331-340 [doi]
• Solving Partial-Information Stochastic Parity GamesSumit Nain, Moshe Y. Vardi. 341-348 [doi]
• Expressive Completeness for Metric Temporal LogicPaul Hunter, Joël Ouaknine, James Worrell. 349-357 [doi]
• One-Path Reachability LogicGrigore Rosu, Andrei Stefanescu, Stefan Ciobaca, Brandon M. Moore. 358-367 [doi]
• Substructure Temporal LogicMassimo Benerecetti, Fabio Mogavero, Aniello Murano. 368-377 [doi]
• Name-Passing Calculi: From Fusions to Preorders and TypesDaniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi. 378-387 [doi]
• A Compositional Semantics for the Reversible p-CalculusIoana Cristescu, Jean Krivine, Daniele Varacca. 388-397 [doi]
• Pumping by TypingNaoki Kobayashi 0001. 398-407 [doi]
• From Frame Properties to Hypersequent Rules in Modal LogicsOri Lahav. 408-417 [doi]
• The Logic of Exact Covers: Completeness and Uniform InterpolationDirk Pattinson. 418-427 [doi]
• Compressing Polarized BoxesBeniamino Accattoli. 428-437 [doi]
• Kripke Semantics for Modal Bilattice LogicAchim Jung, Umberto Rivieccio. 438-447 [doi]
• Forcing MSO on Infinite Words in Weak MSOColin Riba. 448-457 [doi]
• From Monadic Second-Order Definable String Transformations to TransducersRajeev Alur, Antoine Durand-Gasselin, Ashutosh Trivedi. 458-467 [doi]
• From Two-Way to One-Way Finite State TransducersEmmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais. 468-477 [doi]
• A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-CalculusAlessandro Facchini, Yde Venema, Fabio Zanasi. 478-487 [doi]
• Bisimilarity of Pushdown Automata is NonelementaryMichael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski. 488-498 [doi]
• Rabin-Mostowski Index Problem: A Step beyond Deterministic AutomataAlessandro Facchini, Filip Murlak, Michal Skrzypczak. 499-508 [doi]
• Regular Real AnalysisSwarat Chaudhuri, Sriram Sankaranarayanan, Moshe Y. Vardi. 509-518 [doi]
• Instances of Computational Effects: An Algebraic PerspectiveSam Staton. 519 [doi]
• Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational LogicMarcelo P. Fiore, Makoto Hamana. 520-529 [doi]
• A Categorical Treatment of OrnamentsPierre-Évariste Dagand, Conor McBride. 530-539 [doi]
• Converging to the Chase - A Tool for Finite ControllabilityTomasz Gogacz, Jerzy Marcinkowski. 540-549 [doi]
• Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?Gaëlle Fontaine. 550-559 [doi]
• Abstract Machines for Game Semantics, RevisitedOlle Fredriksson, Dan R. Ghica. 560-569 [doi]