Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS, 2013.

@proceedings{LICS-2013,
	acmid         = "2591370",
	address       = "New Orleans, Louisiana, USA",
	ee            = "http://www.computer.org/csdl/proceedings/lics/2013/5020/00/index.html",
	isbn          = "978-1-4799-0413-6",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science}",
	year          = 2013,
}

Contents (62 items)

21 ×#logic
5 ×#automaton
4 ×#calculus
4 ×#semantics
4 ×#type system
3 ×#complexity
3 ×#finite
3 ×#model checking
3 ×#modelling
3 ×#monad

LICS-2013-Comon-Lundh #logic #modelling #named #problem #security

LICS: Logic in Computer Security — Some Attacker’s Models and Related Decision Problems (HCL), p. 1.

LICS-2013-Halpern #first-order #logic #proving #security #using

From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic (JYH), pp. 2–3.

LICS-2013-Panangaden #logic

Duality in Logic and Computation (PP), pp. 4–11.

LICS-2013-Lynch #automaton #probability

Timed and Probabilistic I/O Automata (NAL), p. 12.

LICS-2013-AlurDDRY #automaton

Regular Functions and Cost Register Automata (RA, LD, JVD, MR, YY), pp. 13–22.

LICS-2013-Leroux

Presburger Vector Addition Systems (JL), pp. 23–32.

LICS-2013-DemriFP #reasoning

Reasoning about Data Repetitions with Counter Systems (SD, DF, MP), pp. 33–42.

LICS-2013-LerouxPS #on the #problem

On the Context-Freeness Problem for Vector Addition Systems (JL, VP, GS), pp. 43–52.

LICS-2013-Otto #finite #modelling #symmetry

Groupoids, Hypergraphs, and Symmetries in Finite Models (MO), pp. 53–62.

LICS-2013-HeimbergKS #bound #normalisation

An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree (LH, DK, NS), pp. 63–72.

LICS-2013-CharatonikW #logic

Two-Variable Logic with Counting and Trees (WC, PW), pp. 73–82.

LICS-2013-Jacobs #logic

Measurable Spaces and Their Effect Logic (BJ0), pp. 83–92.

LICS-2013-Vicary #algorithm #quantum

Topological Structure of Quantum Algorithms (JV), pp. 93–102.

LICS-2013-FereeHG #complexity #on the #query

On the Query Complexity of Real Functionals (HF, MH, WG), pp. 103–112.

LICS-2013-KreutzerR #higher-order #logic #monad

Quantitative Monadic Second-Order Logic (SK, CR), pp. 113–122.

LICS-2013-Colcombet #logic #monad #set #using #word

Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory (TC), p. 123.

LICS-2013-HoffmannMS #proving #reasoning

Quantitative Reasoning for Proving Lock-Freedom (JH, MM, ZS), pp. 124–133.

LICS-2013-EickmeyerKK #first-order #graph #invariant #logic #model checking

Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes (KE, KiK, SK), pp. 134–142.

LICS-2013-BalbianiHT #logic

Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL (PB, AH, NT), pp. 143–152.

LICS-2013-BoralS #model checking #parse tree

Model-Checking Parse Trees (AB, SS), pp. 153–162.

LICS-2013-BolligKM #complexity #model checking #multi

The Complexity of Model Checking Multi-stack Systems (BB, DK, RM), pp. 163–172.

LICS-2013-AndersonDH #fixpoint #linear #logic #programming

Maximum Matching and Linear Programming in Fixed-Point Logic with Counting (MA, AD, BH), pp. 173–182.

LICS-2013-BojanczykKLT #turing machine

Turing Machines with Atoms (MB, BK, SL, ST), pp. 183–192.

LICS-2013-MontanariS #complexity #equivalence #logic

Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness (AM, PS), pp. 193–202.

LICS-2013-HofmanMT #decidability #simulation

Decidability of Weak Simulation on One-Counter Nets (PH, RM, PT), pp. 203–212.

LICS-2013-BirkedalM #fixpoint #recursion #type system

Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes (LB, REM), pp. 213–222.

LICS-2013-LicataS #type system

Calculating the Fundamental Group of the Circle in Homotopy Type Theory (DRL, MS), pp. 223–232.

LICS-2013-Sacchini #calculus #type system

Type-Based Productivity of Stream Definitions in the Calculus of Constructions (JLS), pp. 233–242.

LICS-2013-GhaniMFS #data type

Fibred Data Types (NG, LM, FNF, AS), pp. 243–252.

LICS-2013-Hales #logic #synthesis

Arbitrary Action Model Logic and Action Model Synthesis (JH), pp. 253–262.

LICS-2013-MogaveroMS #behaviour #bound #on the

On the Boundary of Behavioral Strategies (FM, AM, LS), pp. 263–272.

LICS-2013-GoncharovS #hoare #logic

A Relatively Complete Generic Hoare Logic for Order-Enriched Effects (SG, LS), pp. 273–282.

LICS-2013-LiangM #logic

Unifying Classical and Intuitionistic Logics for Computational Control (CL, DM), pp. 283–292.

LICS-2013-AspertiL #cost analysis #λ-calculus

The Cost of Usage in the λ-Calculus (AA, JJL), pp. 293–300.

LICS-2013-LairdMMP #modelling #relational #λ-calculus

Weighted Relational Models of Typed λ-Calculi (JL, GM, GM, MP), pp. 301–310.

LICS-2013-GundersenHP #λ-calculus

Atomic λ Calculus: A Typed λ-Calculus with Explicit Sharing (TG, WH, MP), pp. 311–320.

LICS-2013-KozenLMP #markov #process

Stone Duality for Markov Processes (DK, KGL, RM, PP), pp. 321–330.

LICS-2013-BrazdilCFK #markov #performance #process

Trading Performance for Stability in Markov Decision Processes (TB, KC, VF, AK), pp. 331–340.

LICS-2013-NainV #game studies #probability

Solving Partial-Information Stochastic Parity Games (SN, MYV), pp. 341–348.

LICS-2013-HunterOW #logic #metric

Expressive Completeness for Metric Temporal Logic (PH, JO, JW), pp. 349–357.

LICS-2013-RosuSCM #logic #reachability

One-Path Reachability Logic (GR, AS, SC, BMM), pp. 358–367.

LICS-2013-BenerecettiMM #logic

Substructure Temporal Logic (MB, FM, AM), pp. 368–377.

LICS-2013-HirschkoffMS #calculus

Name-Passing Calculi: From Fusions to Preorders and Types (DH, JMM, DS), pp. 378–387.

LICS-2013-CristescuKV #calculus #composition #semantics

A Compositional Semantics for the Reversible p-Calculus (IC, JK, DV), pp. 388–397.

LICS-2013-Kobayashi #type system

Pumping by Typing (NK0), pp. 398–407.

LICS-2013-Lahav #logic

From Frame Properties to Hypersequent Rules in Modal Logics (OL), pp. 408–417.

LICS-2013-Pattinson #logic

The Logic of Exact Covers: Completeness and Uniform Interpolation (DP), pp. 418–427.

LICS-2013-Accattoli

Compressing Polarized Boxes (BA), pp. 428–437.

LICS-2013-JungR #logic #semantics

Kripke Semantics for Modal Bilattice Logic (AJ, UR), pp. 438–447.

LICS-2013-Riba #infinity #word

Forcing MSO on Infinite Words in Weak MSO (CR), pp. 448–457.

LICS-2013-AlurDT #higher-order #monad #string #transducer

From Monadic Second-Order Definable String Transformations to Transducers (RA, ADG, AT), pp. 458–467.

LICS-2013-FiliotGRS #finite #transducer

From Two-Way to One-Way Finite State Transducers (EF, OG, PAR, FS), pp. 468–477.

LICS-2013-FacchiniVZ #calculus #theorem #μ-calculus

A Characterization Theorem for the Alternation-Free Fragment of the Modal μ-Calculus (AF, YV, FZ), pp. 478–487.

LICS-2013-BenediktGKM #automaton #similarity

Bisimilarity of Pushdown Automata is Nonelementary (MB, SG, SK, ASM), pp. 488–498.

LICS-2013-FacchiniMS #automaton #problem

Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata (AF, FM, MS), pp. 499–508.

LICS-2013-ChaudhuriSV #analysis

Regular Real Analysis (SC, SS, MYV), pp. 509–518.

LICS-2013-Staton #algebra #perspective

Instances of Computational Effects: An Algebraic Perspective (SS), p. 519.

LICS-2013-FioreH #algebra #equation #logic #multi #polymorphism #semantics #syntax

Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic (MPF, MH), pp. 520–529.

LICS-2013-DagandM #category theory

A Categorical Treatment of Ornaments (PÉD, CM), pp. 530–539.

LICS-2013-GogaczM #convergence #finite

Converging to the Chase — A Tool for Finite Controllability (TG, JM), pp. 540–549.

LICS-2013-Fontaine #consistency #query #question #why

Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? (GF), pp. 550–559.

LICS-2013-FredrikssonG #automaton #game studies #revisited #semantics

Abstract Machines for Game Semantics, Revisited (OF, DRG), pp. 560–569.