ACM/IEEE Symposium on Logic in Computer Science

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Authors on this page:

• Franz Baader
• Matthias Baaz
• Giorgio Bacci
• Giovanni Bacci
• Leo Bachmair
• David Baelde
• Jos C. M. Baeten
• John C. Baez
• Patrick Bahr
• Christel Baier
• Patrick Baillot
• Adam Bakewell
• Nikhil Balaji
• A. R. Balasubramanian
• Vincent Balat
• Philippe Balbiani
• José L.Balcázar
• Michael Baldamus
• Paolo Baldan
• John T. Baldwin
• Thomas Ball
• Borja Balle
• Alexandru Baltag
• Stephanie Balzer
• Anindya Banerjee
• Aman Bansal
• Jialu Bao
• Krzysztof Bar
• Vince Bárány
• Franco Barbanera
• Davide Barbarossa
• Rui Soares Barbosa
• Pablo Barceló
• Pablo Barceló
• Pablo Barenbaum
• Henk Barendregt
• Luis Barguñó
• Corentin Barloy
• Michael Barnett
• Bruno Barras
• Clark W. Barrett
• David A. Mix Barrington
• Adam Barth
• Gilles Barthe
• Libor Barto
• Massimo Bartoletti
• K. Jon Barwise
• Eli Barzilay
• Michele Basaldella
• Félix Baschenis
• David A. Basin
• Henning Basold
• Marianne Baudinet
• Lujo Bauer
• Augustin Baziramwabo
• Paul Beame
• Lennart Beckman
• Arnold Beckmann
• Bartosz Bednarczyk
• Emmanuel Beffara
• Nicolas Behr
• Francesco Belardinelli
• Shai Ben-David
• Rachel Ben-Eliyahu-Zohary
• Ofer Ben-Shachar
• Michael Benedikt
• Massimo Benerecetti
• Jesper Bengtson
• David B. Benson
• Nick Benton
• Véronique Benzaken
• Harsh Beohar
• Stefano Berardi
• Martin Berger
• Ulrich Berger
• Steffen van Bergerem
• Stefan Berghofer
• Clifford Bergman
• Pascal Bergsträßer
• Christoph Berkholz
• Marco Bernardo
• Jean-Philippe Bernardy
• Karen L. Bernstein
• Gerard Berry
• Raphaël Berthon
• Nathalie Bertrand
• Inge Bethke
• Raven Beutner
• Olaf Beyersdorff
• Nick Bezhanishvili
• Girish Bhat
• Alessandro Bianco
• Mark Bickford
• Nicole Bidoit
• Meghyn Bienvenu
• Laurent Bienvenu
• Bodil Biering
• Malgorzata Biernacka
• Dariusz Biernacki
• Paul Bilokon
• Lars Birkedal
• Henrik Björklund
• Patrick Blackburn
• Bruno Blanchet
• Jasmin Christian Blanchette
• Frédéric Blanqui
• Andreas Blass
• Joshua Blinkhorn
• Michel Blockelet
• Michael Blondin
• Bard Bloom
• Valentin Blot
• Achim Blumensath
• Richard Blute
• Manuel Bodirsky
• Bertalan Bodor
• Miquel Bofill
• Corrado Böhm
• Stanislav Böhm
• Brandon Bohrer
• Mikolaj Bojanczyk
• Mikołaj Bojańczyk
• Udi Boker
• Benedikt Bollig
• Ilario Bonacina
• Filippo Bonchi
• Maria Luisa Bonet
• Iovka Boneva
• Édouard Bonnet
• Viviana Bono
• Marcello Bonsangue
• Michael Vanden Boom
• Anudhyan Boral
• Michele Boreale
• Richard Bornat
• Peio Borthelle
• Soumitra Bose
• Ahmed Bouajjani
• Alexandre Boudet
• Adel Bouhoula
• Pierre Bourhis
• Patricia Bouyer
• Simone Bova
• Nathan Bowler
• Laura Bozzelli
• Jendrik Brachter
• Zarathustra Brady
• Paul Brauner
• Tomáš Brázdil
• Tomás Brázdil
• Val Breazu-Tannen
• Matthew de Brecht
• Nuria Brede
• Romain Brenguier
• Davide Bresolin
• Flavien Breuvart
• Thomas Brihaye
• Christopher H. Broadbent
• Antonio Brogi
• Stephen D. Brookes
• James Brotherston
• Carolyn Brown
• Michael C. Browne
• Václav Brozek
• Kim B. Bruce
• Guillaume Brunerie
• Paul Brunet
• Roberto Bruni
• Glenn Bruns
• Véronique Bruyére
• Randal E. Bryant
• Antonio Bucciarelli
• Ulrik Buchholtz
• Andrei A. Bulatov
• Andrei Bulatov
• Daniel Bundala
• Jerry R. Burch
• Guillaume Burel
• Joshua Buresh-Oppenheim
• Elisabet Burjons
• Toby Cathcart Burn
• Rod M. Burstall
• Samuel R. Buss
• Jan Van den Bussche

Franz Baader

• Paper: Franz Baader
  Combination of Compatible Reduction Orderings that are Total on Ground Terms (LICS 1997) More Information...

Matthias Baaz

• Paper: Matthias Baaz Christian G. Fermüller Alexander Leitsch
  A non-elementary speed-up in proof length by structural clause form transformation (LICS 1994) More Information...
• Paper: Matthias Baaz Alexander Leitsch Giselle Reis
  A Note on the Complexity of Classical and Intuitionistic Proofs (LICS 2015) More Information...

Giorgio Bacci

• Paper: Giorgio Bacci Robert Furber Dexter Kozen Radu Mardare Prakash Panangaden Dana Scott
  Boolean-Valued Semantics for the Stochastic λ-Calculus (LICS 2018) More Information...
• Paper: Giorgio Bacci Radu Mardare Prakash Panangaden Gordon D. Plotkin
  An Algebraic Theory of Markov Processes (LICS 2018) More Information...
• Paper: Giorgio Bacci Giovanni Bacci Kim G. Larsen Mirco Tribastone Max Tschaikowski Andrea Vandin
  Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods (LICS 2021) More Information...

Giovanni Bacci

• Paper: Giorgio Bacci Giovanni Bacci Kim G. Larsen Mirco Tribastone Max Tschaikowski Andrea Vandin
  Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods (LICS 2021) More Information...

Leo Bachmair

• Paper: Leo Bachmair Nachum Dershowitz Jieh Hsiang
  Orderings for Equational Proofs (LICS 1986) More Information...
• Paper: Leo Bachmair Nachum Dershowitz
  Inference Rules for Rewrite-Based First-Order Theorem Proving (LICS 1987) More Information...
• Paper: Leo Bachmair
  Proof by consistency in equational theories (LICS 1988) More Information...
• Paper: Leo Bachmair Harald Ganzinger Uwe Waldmann
  Set constraints are the monadic class (LICS 1993) More Information...
• Paper: Leo Bachmair Harald Ganzinger
  Rewrite techniques for transitive relations (LICS 1994) More Information...

David Baelde

• Paper: David Baelde Gopalan Nadathur
  Combining Deduction Modulo and Logics of Fixed-Point Definitions (LICS 2012) More Information...
• Paper: Amina Doumane David Baelde Lucca Hirschi Alexis Saurin
  Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions (LICS 2016) More Information...
• Paper: David Baelde Amina Doumane Denis Kuperberg Alexis Saurin
  Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs (LICS 2022) More Information...

Jos C. M. Baeten

• Paper: Jos C. M. Baeten Flavio Corradini
  Regular Expressions in Process Algebra (LICS 2005) More Information...

John C. Baez

• Paper: John C. Baez Fabrizio Genovese Jade Master Michael Shulman
  Categories of Nets (LICS 2021) More Information...

Patrick Bahr

• Paper: Patrick Bahr Hans Bugge Grathwohl Rasmus E. Møgelberg
  The clocks are ticking: No more delays! (LICS 2017) More Information...

Christel Baier

• Paper: Christel Baier Marcus Größer
  Recognizing omega-regular Languages with Probabilistic Automata (LICS 2005) More Information...
• Paper: Christel Baier Nathalie Bertrand Patricia Bouyer Thomas Brihaye Marcus Größer
  Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (LICS 2008) More Information...
• Invited Paper: Christel Baier Clemens Dubslaff Sascha Klüppelholz
  Trade-off analysis meets probabilistic model checking (LICS 2014) More Information...
• Paper: Christel Baier Joachim Klein Sascha Klüppelholz Sascha Wunderlich
  Weight monitoring with linear temporal logic: complexity and decidability (LICS 2014) More Information...
• Paper: Christel Baier Nathalie Bertrand Clemens Dubslaff Daniel Gburek Ocan Sankur
  Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes (LICS 2018) More Information...
• Paper: Christel Baier Nathalie Bertrand Jakob Piribauer Ocan Sankur
  Long-run Satisfaction of Path Properties (LICS 2019) More Information...
• Paper: Corto Mascle Christel Baier Florian Funke Simon Jantsch Stefan Kiefer
  Responsibility and verification: Importance value in temporal logics (LICS 2021) More Information...

Patrick Baillot

• Paper: Patrick Baillot Vincent Danos Thomas Ehrhard Laurent Regnier
  Believe it or not, AJM's games model is a model of classical linear logic (LICS 1997) More Information...
• Paper: Patrick Baillot Kazushige Terui
  Light Types for Polynomial Time Computation in Lambda-Calculus (LICS 2004) More Information...
• Paper: Patrick Baillot Paolo Coppola Ugo Dal Lago
  Light Logics and Optimal Reduction: Completeness and Complexity (LICS 2007) More Information...

Adam Bakewell

• Paper: Dan R. Ghica Adam Bakewell
  Clipping: A Semantics-Directed Syntactic Approximation (LICS 2009) More Information...

Nikhil Balaji

• Paper: Nikhil Balaji Klara Nosan Mahsa Shirmohammadi James Worrell
  Identity Testing for Radical Expressions (LICS 2022) More Information...

A. R. Balasubramanian

• Paper: A. R. Balasubramanian
  Complexity of controlled bad sequences over finite sets of Nd (LICS 2020) More Information...
• Paper: A. R. Balasubramanian Timo Lang Revantha Ramanayake
  Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics (LICS 2021) More Information...

Vincent Balat

• Paper: Marcelo P. Fiore Roberto Di Cosmo Vincent Balat
  Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types (LICS 2002) More Information...

Philippe Balbiani

• Paper: Philippe Balbiani Andreas Herzig Nicolas Troquard
  Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL (LICS 2013) More Information...
• Paper: Philippe Balbiani Martín Diéguez David Fernández-Duque
  Some constructive variants of S4 with the finite model property (LICS 2021) More Information...

José L.Balcázar

• Paper: Albert Atserias José L.Balcázar
  Entailment among Probabilistic Implications (LICS 2015) More Information...

Michael Baldamus

• Paper: Michael Baldamus Joachim Parrow Björn Victor
  Spi Calculus Translated to π--Calculus Preserving May-Tests (LICS 2004) More Information...

Paolo Baldan

• Paper: Paolo Baldan Andrea Corradini Fabio Gadducci
  Domains and event structures for fusions (LICS 2017) More Information...

John T. Baldwin

• Paper: John T. Baldwin Michael Benedikt
  Embedded Finite Models, Stability Theory and the Impact of Order (LICS 1998) More Information...

Thomas Ball

• Paper: Thomas Ball Orna Kupferman
  An Abstraction-Refinement Framework for Multi-Agent Systems (LICS 2006) More Information...

Borja Balle

• Paper: Borja Balle Prakash Panangaden Doina Precup
  A Canonical Form for Weighted Automata and Applications to Approximate Minimization (LICS 2015) More Information...

Alexandru Baltag

• Paper: Alexandru Baltag Nick Bezhanishvili David Fernández-Duque
  The Topological Mu-Calculus: completeness and decidability (LICS 2021) More Information...

Stephanie Balzer

• Paper: Farzaneh Derakhshan Stephanie Balzer Limin Jia
  Session Logical Relations for Noninterference (LICS 2021) More Information...

Anindya Banerjee

• Paper: Anindya Banerjee Nevin Heintze Jon G. Riecke
  Region Analysis and the Polymorphic Lambda Calculus (LICS 1999) More Information...

Aman Bansal

• Paper: Preey Shah Aman Bansal S. Akshay Supratik Chakraborty
  A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis (LICS 2021) More Information...

Jialu Bao

• Paper: Jialu Bao Simon Docherty Justin Hsu Alexandra Silva
  A Bunched Logic for Conditional Independence (LICS 2021) More Information...

Krzysztof Bar

• Paper: Krzysztof Bar Jamie Vicary
  Data structures for quasistrict higher categories (LICS 2017) More Information...

Vince Bárány

• Paper: Vince Bárány Georg Gottlob Martin Otto
  Querying the Guarded Fragment (LICS 2010) More Information...

Franco Barbanera

• Paper: Fabio Alessi Franco Barbanera
  Toward a semantics for the QUEST language (LICS 1991) More Information...
• Paper: Franco Barbanera Maribel Fernández Herman Geuvers
  Modularity of strong normalization and confluence in the algebraic-λ-cube (LICS 1994) More Information...

Davide Barbarossa

• Paper: Davide Barbarossa
  Resource approximation for the lambda-mu-calculus (LICS 2022) More Information...

Rui Soares Barbosa

• Paper: Samson Abramsky Rui Soares Barbosa Martti Karvonen Shane Mansfield
  A comonadic view of simulation and quantum resources (LICS 2019) More Information...

Pablo Barceló

• Paper: Miguel Romero Pablo Barceló Moshe Y. Vardi
  The homomorphism problem for regular graph patterns (LICS 2017) More Information...
• Paper: Pablo Barceló Cristina Feier Carsten Lutz Andreas Pieris
  When is Ontology-Mediated Querying Efficient? 1-13 Willem B (LICS 2019) More Information...

Pablo Barceló

• Short Presentation: Marcelo Arenas Pablo Barceló Leonid Libkin
  Game-based Notions of Locality (LICS 2003) More Information...
• Paper: Pablo Barceló Leonid Libkin
  Temporal Logics over Unranked Trees (LICS 2005) More Information...
• Paper: Rajeev Alur Marcelo Arenas Pablo Barceló Kousha Etessami Neil Immerman Leonid Libkin
  First-Order and Temporal Logics for Nested Words (LICS 2007) More Information...
• Paper: Pablo Barceló Diego Figueira Leonid Libkin
  Graph Logics with Rational Relations and the Generalized Intersection Problem (LICS 2012) More Information...
• Short Presentation: Pablo Barceló Leonid Libkin Miguel Romero
  Approximations of Conjunctive Queries (LICS 2012) More Information...
• Paper: Pablo Barceló Pablo Muñoz
  Graph logics with rational relations: the role of word combinatorics (LICS 2014) More Information...

Pablo Barenbaum

• Paper: Pablo Barenbaum Teodoro Freund
  A Constructive Logic with Classical Proofs and Refutations (LICS 2021) More Information...

Henk Barendregt

• Invited Paper: Henk Barendregt
  Results and Problems Related to Proof Checking (LICS 1994) More Information...

Luis Barguñó

• Paper: Luis Barguñó Carles Creus Guillem Godoy Florent Jacquemard Camille Vacher
  The Emptiness Problem for Tree Automata with Global Constraints (LICS 2010) More Information...

Corentin Barloy

• Paper: Corentin Barloy Michaël Cadilhac Charles Paperman Thomas Zeume
  The Regular Languages of First-Order Logic with One Alternation (LICS 2022) More Information...

Michael Barnett

• Paper: David A. Naumann Michael Barnett
  Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State (LICS 2004) More Information...

Bruno Barras

• Paper: Bruno Barras Jean-Pierre Jouannaud Pierre-Yves Strub Qian Wang
  CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory (LICS 2011) More Information...

Clark W. Barrett

• Paper: Aaron Stump Clark W. Barrett David L. Dill Jeremy R. Levitt
  A Decision Procedure for an Extensional Theory of Arrays (LICS 2001) More Information...

David A. Mix Barrington

• Paper: David A. Mix Barrington Neil Immerman Clemens Lautemann Nicole Schweikardt Denis Thérien
  The Crane Beach Conjecture (LICS 2001) More Information...

Adam Barth

• Paper: Adam Barth John C. Mitchell
  Managing Digital Rights using Linear Logic (LICS 2006) More Information...

Gilles Barthe

• Paper: Gilles Barthe Marco Gaboardi Benjamin Grégoire Justin Hsu Pierre-Yves Strub
  Proving Differential Privacy via Probabilistic Couplings (LICS 2016) More Information...
• Paper: Tetsuya Sato Gilles Barthe Marco Gaboardi Justin Hsu Shin-ya Katsumata
  Approximate Span Liftings: Compositional Semantics for Relaxations of Differential Privacy (LICS 2019) More Information...
• Paper: Gilles Barthe Rohit Chadha Vishal Jagannath A. Prasad Sistla Mahesh Viswanathan
  Deciding Differential Privacy for Programs with Finite Inputs and Outputs (LICS 2020) More Information...
• Paper: Gilles Barthe Charlie Jacomme Steve Kremer
  Universal equivalence and majority of probabilistic programs over finite fields (LICS 2020) More Information...
• Paper: Li Zhou Gilles Barthe Justin Hsu Mingsheng Ying Nengkun Yu
  A Quantum Interpretation of Bunched Logic and Quantum Separation Logic (LICS 2021) More Information...
• Paper: Junyi Liu Li Zhou Gilles Barthe Mingsheng Ying
  Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs (LICS 2022) More Information...

Libor Barto

• Paper: Libor Barto Marcin Kozik
  New Conditions for Taylor Varieties and CSP (LICS 2010) More Information...
• Paper: Libor Barto
  The Dichotomy for Conservative Constraint Satisfaction Problems Revisited (LICS 2011) More Information...
• Paper: Libor Barto Marcin Kozik Ross Willard
  Near Unanimity Constraints Have Bounded Pathwidth Duality (LICS 2012) More Information...
• Paper: Libor Barto Michael Pinsker
  The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems (LICS 2016) More Information...
• Paper: Libor Barto Michael Kompatscher Miroslav Olsák Trung Van Pham Michael Pinsker
  The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems (LICS 2017) More Information...
• Paper: Libor Barto
  Promises Make Finite (Constraint Satisfaction) Problems Infinitary (LICS 2019) More Information...
• Paper: Libor Barto Zarathustra Brady Andrei Bulatov Marcin Kozik Dmitriy Zhuk
  Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP (LICS 2021) More Information...
• Paper: Libor Barto William J. DeMeo Antoine Mottet
  Constraint Satisfaction Problems over Finite Structures (LICS 2021) More Information...

Massimo Bartoletti

• Paper: Massimo Bartoletti Roberto Zunino
  A Calculus of Contracting Processes (LICS 2010) More Information...

K. Jon Barwise

• Invited Paper: K. Jon Barwise Jerry Seligman
  Imperfect information flow (LICS 1993) More Information...

Eli Barzilay

• Short Presentation: Eli Barzilay Stuart F. Allen Robert L. Constable
  Practical Reflection in Nuprl (LICS 2003) More Information...

Michele Basaldella

• Paper: Michele Basaldella Claudia Faggian
  Ludics with Repetitions (Exponentials, Interactive Types and Completeness) (LICS 2009) More Information...
• Paper: Michele Basaldella Kazushige Terui
  Infinitary Completeness in Ludics (LICS 2010) More Information...

Félix Baschenis

• Paper: Félix Baschenis Olivier Gauwin Anca Muscholl Gabriele Puppis
  Untwisting two-way transducers in elementary time (LICS 2017) More Information...

David A. Basin

• Paper: David A. Basin Harald Ganzinger
  Complexity Analysis Based on Ordered Resolution (LICS 1996) More Information...
• Invited Paper: Christoph Sprenger David A. Basin
  Cryptographically-Sound Protocol-Model Abstractions (LICS 2008) More Information...
• Paper: Grgur Petric Maretic Mohammad Torabi Dashti David A. Basin
  Anchored LTL separation (LICS 2014) More Information...

Henning Basold

• Paper: Henning Basold Herman Geuvers
  Type Theory based on Dependent Inductive and Coinductive Types (LICS 2016) More Information...

Marianne Baudinet

• Paper: Marianne Baudinet
  Proving termination properties of Prolog programs: a semantic approach (LICS 1988) More Information...

Lujo Bauer

• Short Presentation: Lujo Bauer Michael A. Schneider Edward W. Felten
  A proof-Carrying Authorization System (LICS 2001) More Information...

Augustin Baziramwabo

• Paper: Augustin Baziramwabo Pierre McKenzie Denis Thérien
  Modular Temporal Logic (LICS 1999) More Information...

Paul Beame

• Paper: Paul Beame Toniann Pitassi
  An exponential separation between the matching principle and the pigeonhole principle (LICS 1993) More Information...

Lennart Beckman

• Paper: Lennart Beckman Rune Gustavsson Annika Wærn
  An Algebraic Model of Parallel Execution of Logic Programs (LICS 1986) More Information...

Arnold Beckmann

• Paper: Klaus Aehlig Arnold Beckmann
  On the Computational Complexity of Cut-Reduction (LICS 2008) More Information...
• Paper: Arnold Beckmann Norbert Preining
  Hyper Natural Deduction (LICS 2015) More Information...

Bartosz Bednarczyk

• Paper: Bartosz Bednarczyk Stéphane Demri
  Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? 1-13 Patricia Johann, Andrew Polonsky: Higher-Kinded Data Types: Syntax and Semantics (LICS 2019) More Information...
• Paper: Bartosz Bednarczyk Stéphane Demri Raul Fervari Alessio Mansutti
  Modal Logics with Composition on Finite Forests: Expressivity and Complexity (LICS 2020) More Information...

Emmanuel Beffara

• Short Presentation: Emmanuel Beffara Sergei G. Vorobyov
  Is Randomized Gurvich-Karzanov-Khachiyan's Algorithm for Parity Games Polynomial? (LICS 2002) More Information...
• Paper: Emmanuel Beffara
  An Algebraic Process Calculus (LICS 2008) More Information...

Nicolas Behr

• Paper: Nicolas Behr Vincent Danos Ilias Garnier
  Stochastic mechanics of graph rewriting (LICS 2016) More Information...

Francesco Belardinelli

• Paper: Francesco Belardinelli Catalin Dima Vadim Malvone Ferucio Laurentiu Tiplea
  A Hennessy-Milner Theorem for ATL with Imperfect Information (LICS 2020) More Information...

Shai Ben-David

• Paper: Shai Ben-David Rachel Ben-Eliyahu-Zohary
  A modal logic for subjective default reasoning (LICS 1994) More Information...

Rachel Ben-Eliyahu-Zohary

• Paper: Shai Ben-David Rachel Ben-Eliyahu-Zohary
  A modal logic for subjective default reasoning (LICS 1994) More Information...

Ofer Ben-Shachar

• Paper: David B. Benson Ofer Ben-Shachar
  Strong Bisimulation of State Automata (LICS 1986) More Information...

Michael Benedikt

• Paper: Michael Benedikt Leonid Libkin
  On the Structure of Queries in Constraint Query Languages (LICS 1996) More Information...
• Paper: John T. Baldwin Michael Benedikt
  Embedded Finite Models, Stability Theory and the Impact of Order (LICS 1998) More Information...
• Paper: Michael Benedikt Leonid Libkin Thomas Schwentick Luc Segoufin
  A Model-Theoretic Approach to Regular String Relations (LICS 2001) More Information...
• Paper: Michael Benedikt Leonid Libkin
  Tree Extension Algebras: Logics, Automata, and Query Languages (LICS 2002) More Information...
• Invited Paper: Michael Benedikt
  An Insider's Guide to Logic in Telecommunications Data (LICS 2005) More Information...
• Paper: Michael Benedikt Gabriele Puppis Cristian Riveros
  Regular Repair of Specifications (LICS 2011) More Information...
• Paper: Michael Benedikt Stefan Göller Stefan Kiefer Andrzej S. Murawski
  Bisimilarity of Pushdown Automata is Nonelementary (LICS 2013) More Information...
• Paper: Michael Benedikt Balder ten Cate Michael Vanden Boom
  Effective interpolation and preservation in guarded logics (LICS 2014) More Information...
• Paper: Michael Benedikt Balder ten Cate Thomas Colcombet Michael Vanden Boom
  The Complexity of Boundedness for Guarded Logics (LICS 2015) More Information...
• Paper: Antoine Amarilli Michael Benedikt
  Finite Open-World Query Answering with Number Restrictions (LICS 2015) More Information...
• Paper: Michael Benedikt Balder ten Cate Michael Vanden Boom
  Interpolation with Decidable Fixpoint Logics (LICS 2015) More Information...
• Paper: Michael Benedikt Pierre Bourhis Balder ten Cate Gabriele Puppis
  Querying Visible and Invisible Information (LICS 2016) More Information...
• Paper: Michael Benedikt Pierre Bourhis Michael Vanden Boom
  A Step Up in Expressiveness of Decidable Fixpoint Logics (LICS 2016) More Information...
• Paper: Michael Benedikt Timothy Duff Aditya Sharad James Worrell
  Polynomial automata: Zeroness and applications (LICS 2017) More Information...

Massimo Benerecetti

• Paper: Massimo Benerecetti Fabio Mogavero Aniello Murano
  Substructure Temporal Logic (LICS 2013) More Information...

Jesper Bengtson

• Paper: Jesper Bengtson Magnus Johansson Joachim Parrow Björn Victor
  Psi-calculi: Mobile Processes, Nominal Data, and Logic (LICS 2009) More Information...
• Paper: Magnus Johansson Jesper Bengtson Joachim Parrow Björn Victor
  Weak Equivalences in Psi-Calculi (LICS 2010) More Information...

David B. Benson

• Paper: David B. Benson Ofer Ben-Shachar
  Strong Bisimulation of State Automata (LICS 1986) More Information...

Nick Benton

• Paper: Nick Benton Philip Wadler
  Linear Logic, Monads and the Lambda Calculus (LICS 1996) More Information...
• Paper: Neelakantan R. Krishnaswami Nick Benton
  Ultrametric Semantics of Reactive Programs (LICS 2011) More Information...

Véronique Benzaken

• Paper: Alain Frisch Giuseppe Castagna Véronique Benzaken
  Semantic subtyping (LICS 2002) More Information...

Harsh Beohar

• Paper: Chase Ford Stefan Milius Lutz Schröder Harsh Beohar Barbara König
  Graded Monads and Behavioural Equivalence Games (LICS 2022) More Information...

Stefano Berardi

• Paper: Yohji Akama Stefano Berardi Susumu Hayashi Ulrich Kohlenbach
  An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles (LICS 2004) More Information...
• Paper: Stefano Berardi Makoto Tatsuta
  Equivalence of inductive definitions and cyclic proofs under arithmetic (LICS 2017) More Information...

Martin Berger

• Paper: Kohei Honda Nobuko Yoshida Martin Berger
  Strong Normalisation in the π-Calculus (LICS 2001) More Information...
• Paper: Kohei Honda Nobuko Yoshida Martin Berger
  An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules (LICS 2005) More Information...

Ulrich Berger

• Paper: Ulrich Berger Helmut Schwichtenberg
  An inverse of the evaluation functional for typed λ-calculus (LICS 1991) More Information...
• Paper: Ulrich Berger
  A Computational Interpretation of Open Induction (LICS 2004) More Information...

Steffen van Bergerem

• Paper: Steffen van Bergerem
  Learning Concepts Definable in First-Order Logic with Counting (LICS 2019) More Information...

Stefan Berghofer

• Paper: Christian Urban James Cheney Stefan Berghofer
  Mechanizing the Metatheory of LF (LICS 2008) More Information...

Clifford Bergman

• Paper: Clifford Bergman Giora Slutzki
  Computational Complexity of Some Problems Involving Congruences on Algebras (LICS 2000) More Information...

Pascal Bergsträßer

• Paper: Pascal Bergsträßer Moses Ganardi Anthony W. Lin Georg Zetzsche
  Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification (LICS 2022) More Information...

Christoph Berkholz

• Paper: Christoph Berkholz
  Lower Bounds for Existential Pebble Games and k-Consistency Tests (LICS 2012) More Information...
• Paper: Christoph Berkholz Jakob Nordström
  Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps (LICS 2016) More Information...

Marco Bernardo

• Paper: Marco Bernardo Davide Sangiorgi Valeria Vignudelli
  On the discriminating power of passivation and higher-order interaction (LICS 2014) More Information...

Jean-Philippe Bernardy

• Paper: Jean-Philippe Bernardy Guilhem Moulin
  A Computational Interpretation of Parametricity (LICS 2012) More Information...
• Short Presentation: Jean-Philippe Bernardy Guilhem Moulin
  Type-Theory In Color (LICS 2013) More Information...

Karen L. Bernstein

• Paper: Karen L. Bernstein
  A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages (LICS 1998) More Information...

Gerard Berry

• Invited Paper: Gerard Berry
  The Semantics of Synchronous Concurrent Languages (LICS 1994) More Information...

Raphaël Berthon

• Paper: Raphaël Berthon Bastien Maubert Aniello Murano Sasha Rubin Moshe Y. Vardi
  Strategy logic with imperfect information (LICS 2017) More Information...
• Paper: Raphaël Berthon Shibashis Guha Jean-François Raskin
  Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes (LICS 2020) More Information...

Nathalie Bertrand

• Paper: Christel Baier Nathalie Bertrand Patricia Bouyer Thomas Brihaye Marcus Größer
  Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (LICS 2008) More Information...
• Paper: Nathalie Bertrand Blaise Genest Hugo Gimbert
  Qualitative Determinacy and Decidability of Stochastic Games with Signals (LICS 2009) More Information...
• Paper: Christel Baier Nathalie Bertrand Clemens Dubslaff Daniel Gburek Ocan Sankur
  Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes (LICS 2018) More Information...
• Paper: Christel Baier Nathalie Bertrand Jakob Piribauer Ocan Sankur
  Long-run Satisfaction of Path Properties (LICS 2019) More Information...

Inge Bethke

• Paper: Inge Bethke Jan Willem Klop Roel C. de Vrijer
  Completing Partial Combinatory Algebras with Unique Head-Normal Forms (LICS 1996) More Information...

Raven Beutner

• Paper: Raven Beutner David Carral Bernd Finkbeiner Jana Hofmann Markus Krötzsch
  Deciding Hyperproperties Combined with Functional Specifications (LICS 2022) More Information...

Olaf Beyersdorff

• Paper: Olaf Beyersdorff Ján Pich
  Understanding Gentzen and Frege Systems for QBF (LICS 2016) More Information...
• Paper: Olaf Beyersdorff Joshua Blinkhorn Meena Mahajan
  Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution (LICS 2020) More Information...

Nick Bezhanishvili

• Paper: Alexandru Baltag Nick Bezhanishvili David Fernández-Duque
  The Topological Mu-Calculus: completeness and decidability (LICS 2021) More Information...

Girish Bhat

• Paper: Girish Bhat Rance Cleaveland Orna Grumberg
  Efficient On-the-Fly Model Checking for CTL (LICS 1995) More Information...
• Paper: Girish Bhat Rance Cleaveland
  Efficient model checking via the equational mu-calculus (LICS 1996) More Information...

Alessandro Bianco

• Paper: Alessandro Bianco Fabio Mogavero Aniello Murano
  Graded Computation Tree Logic (LICS 2009) More Information...

Mark Bickford

• Paper: Vincent Rahli Mark Bickford Robert L. Constable
  Bar induction: The good, the bad, and the ugly (LICS 2017) More Information...
• Paper: Mark Bickford Liron Cohen Robert L. Constable Vincent Rahli
  Computability Beyond Church-Turing via Choice Sequences (LICS 2018) More Information...

Nicole Bidoit

• Paper: Nicole Bidoit Christine Froidevaux
  Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming (LICS 1987) More Information...

Meghyn Bienvenu

• Paper: Meghyn Bienvenu Stanislav Kikot Vladimir V. Podolskii
  Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results (LICS 2015) More Information...

Laurent Bienvenu

• Paper: Laurent Bienvenu Benoit Monin
  Von Neumann's Biased Coin Revisited (LICS 2012) More Information...

Bodil Biering

• Short Presentation: Bodil Biering Lars Birkedal Noah Torp-Smith
  Higher-Order Separation Logic (LICS 2005) More Information...

Malgorzata Biernacka

• Paper: Malgorzata Biernacka Dariusz Biernacki Sergueï Lenglet Piotr Polesiuk Damien Pous Alan Schmitt
  Fully abstract encodings of λ-calculus in HOcore through abstract machines (LICS 2017) More Information...

Dariusz Biernacki

• Paper: Malgorzata Biernacka Dariusz Biernacki Sergueï Lenglet Piotr Polesiuk Damien Pous Alan Schmitt
  Fully abstract encodings of λ-calculus in HOcore through abstract machines (LICS 2017) More Information...

Paul Bilokon

• Paper: Paul Bilokon Abbas Edalat
  A domain-theoretic approach to Brownian motion and general continuous stochastic processes (LICS 2014) More Information...

Lars Birkedal

• Paper: Lars Birkedal Aurelio Carboni Giuseppe Rosolini Dana S. Scott
  Type Theory via Exact Categories (LICS 1998) More Information...
• Paper: Lars Birkedal
  A General Notion of Realizability (LICS 2000) More Information...
• Paper: Lars Birkedal Noah Torp-Smith Hongseok Yang
  Semantics of Separation-Logic Typing and Higher-Order Frame Rules (LICS 2005) More Information...
• Short Presentation: Bodil Biering Lars Birkedal Noah Torp-Smith
  Higher-Order Separation Logic (LICS 2005) More Information...
• Paper: Derek Dreyer Amal J. Ahmed Lars Birkedal
  Logical Step-Indexed Logical Relations (LICS 2009) More Information...
• Paper: Lars Birkedal Rasmus E. Møgelberg Jan Schwinghammer Kristian Støvring
  First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees (LICS 2011) More Information...
• Short Presentation: Thomas Dinsdale-Young Lars Birkedal Philippa Gardner Matthew Parkinson Hongseok Yang
  Views: Compositional Reasoning for Concurrent Programs (LICS 2012) More Information...
• Paper: Lars Birkedal Rasmus E. Møgelberg
  Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes (LICS 2013) More Information...
• Paper: Dan Frumin Robbert Krebbers Lars Birkedal
  ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency (LICS 2018) More Information...
• Paper: Daniel Gratzer G. A. Kavvos Andreas Nuyts Lars Birkedal
  Multimodal Dependent Type Theory (LICS 2020) More Information...

Henrik Björklund

• Short Presentation: Henrik Björklund Sergei G. Vorobyov
  Two Adversary Lower Bounds for Parity Games (LICS 2002) More Information...

Patrick Blackburn

• Short Presentation: Carlos E. Areces Patrick Blackburn Maarten Marx
  Repairing the Interpolation Theorem in First-Order Modal Logic (LICS 2001) More Information...

Bruno Blanchet

• Paper: Bruno Blanchet Martín Abadi Cédric Fournet
  Automated Verification of Selected Equivalences for Security Protocols (LICS 2005) More Information...

Jasmin Christian Blanchette

• Paper: Dmitriy Traytel Andrei Popescu Jasmin Christian Blanchette
  Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving (LICS 2012) More Information...
• Paper: Jasmin Christian Blanchette Fabian Meier Andrei Popescu Dmitriy Traytel
  Foundational nonuniform (Co)datatypes for higher-order logic (LICS 2017) More Information...

Frédéric Blanqui

• Paper: Frédéric Blanqui
  Definitions by Rewriting in the Calculus of Constructions (LICS 2001) More Information...

Andreas Blass

• Invited Paper: Andreas Blass
  Adapting Logics (LICS 2006) More Information...

Joshua Blinkhorn

• Paper: Olaf Beyersdorff Joshua Blinkhorn Meena Mahajan
  Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution (LICS 2020) More Information...

Michel Blockelet

• Paper: Eugene Asarin Michel Blockelet Aldric Degorre Catalin Dima Chunyan Mu
  Asymptotic behaviour in temporal logic (LICS 2014) More Information...

Michael Blondin

• Paper: Michael Blondin Alain Finkel Stefan Göller Christoph Haase Pierre McKenzie
  Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (LICS 2015) More Information...
• Paper: Michael Blondin Christoph Haase
  Logics for continuous reachability in Petri nets and vector addition systems with states (LICS 2017) More Information...
• Invited Paper: Michael Blondin Javier Esparza Stefan Jaax Antonín Kucera
  Black Ninjas in the Dark: Formal Analysis of Population Protocols (LICS 2018) More Information...
• Paper: Michael Blondin Mikhail A. Raskin
  The Complexity of Reachability in Affine Vector Addition Systems with States (LICS 2020) More Information...
• Paper: Michael Blondin Tim Leys Filip Mazowiecki Philip Offtermatt Guillermo A. Pérez
  Continuous One-Counter Automata (LICS 2021) More Information...
• Paper: Michael Blondin Filip Mazowiecki Philip Offtermatt
  The complexity of soundness in workflow nets (LICS 2022) More Information...

Bard Bloom

• Paper: Bard Bloom
  Can LCF be topped? Flat lattice models of typed lambda calculus (LICS 1988) More Information...
• Paper: Luca Aceto Bard Bloom Fritz W. Vaandrager
  Turning SOS rules into equations (LICS 1992) More Information...
• Paper: Bard Bloom Wan Fokkink Rob J. van Glabbeek
  Precongruence Formats for Decorated Trace Preorders (LICS 2000) More Information...

Valentin Blot

• Paper: Valentin Blot
  Hybrid realizability for intuitionistic and classical choice (LICS 2016) More Information...
• Paper: Valentin Blot
  An interpretation of system F through bar recursion (LICS 2017) More Information...
• Paper: Valentin Blot James Laird
  Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types (LICS 2018) More Information...
• Paper: Valentin Blot
  A direct computational interpretation of second-order arithmetic via update recursion (LICS 2022) More Information...

Achim Blumensath

• Paper: Achim Blumensath Erich Grädel
  Automatic Structures (LICS 2000) More Information...
• Paper: Achim Blumensath Thomas Colcombet Denis Kuperberg Pawel Parys Michael Vanden Boom
  Two-way cost automata and cost logics over infinite trees (LICS 2014) More Information...

Richard Blute

• Paper: Richard Blute Josée Desharnais Abbas Edalat Prakash Panangaden
  Bisimulation for Labelled Markov Processes (LICS 1997) More Information...

Manuel Bodirsky

• Short Presentation: Manuel Bodirsky Tobias Gärtner Timo von Oertzen Jan Schwinghammer
  Computing the Density of Regular Languages (LICS 2001) More Information...
• Paper: Manuel Bodirsky Hubie Chen
  Quantified Equality Constraints (LICS 2007) More Information...
• Paper: Manuel Bodirsky Martin Hils Barnaby Martin
  On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction (LICS 2010) More Information...
• Paper: Manuel Bodirsky Michael Pinsker Todor Tsankov
  Decidability of Definability (LICS 2011) More Information...
• Paper: Manuel Bodirsky Antoine Mottet
  Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction (LICS 2016) More Information...
• Paper: Manuel Bodirsky Florent R. Madelaine Antoine Mottet
  A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP (LICS 2018) More Information...
• Paper: Manuel Bodirsky Antoine Mottet Miroslav Olsák Jakub Oprsal Michael Pinsker Ross Willard
  Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems) (LICS 2019) More Information...
• Paper: Manuel Bodirsky Wied Pakusa Jakub Rydval
  Temporal Constraint Satisfaction Problems in Fixed-Point Logic (LICS 2020) More Information...
• Paper: Manuel Bodirsky Thomas Feller Simon Knäuer Sebastian Rudolph
  On Logics and Homomorphism Closure (LICS 2021) More Information...
• Paper: Manuel Bodirsky Bertalan Bodor
  Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property (LICS 2021) More Information...

Bertalan Bodor

• Paper: Manuel Bodirsky Bertalan Bodor
  Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property (LICS 2021) More Information...

Miquel Bofill

• Paper: Miquel Bofill Guillem Godoy Robert Nieuwenhuis Albert Rubio
  Paramodulation with Non-Monotonic Orderings (LICS 1999) More Information...

Corrado Böhm

• Paper: Corrado Böhm Enrico Tronci
  X-Separability and Left-Invertibility in lambda-calculus (LICS 1987) More Information...
• Paper: Corrado Böhm Adolfo Piperno
  Characterizing X-separability and one-side invertibility in λ-β-Θ-calculus (LICS 1988) More Information...
• Invited Paper: Corrado Böhm
  An Algebraic View of the Lambda-Calculus (LICS 1994) More Information...

Stanislav Böhm

• Short Presentation: Stanislav Böhm Stefan Göller Petr Jančar
  Bisimilarity of one-counter processes is PSPACE-complete (LICS 2010) More Information...

Brandon Bohrer

• Paper: Brandon Bohrer André Platzer
  A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow (LICS 2018) More Information...

Mikolaj Bojanczyk

• Paper: Mikolaj Bojanczyk Michal Pilipczuk
  Definability equals recognizability for graphs of bounded treewidth (LICS 2016) More Information...
• Paper: Mikolaj Bojanczyk Laure Daviaud Shankara Narayanan Krishna
  Regular and First-Order List Functions (LICS 2018) More Information...
• Paper: Mikolaj Bojanczyk Martin Grohe Michal Pilipczuk
  Definable decompositions for graphs of bounded linear cliquewidth (LICS 2018) More Information...
• Paper: Mikolaj Bojanczyk Szymon Torunczyk
  On computability and tractability for infinite sets (LICS 2018) More Information...
• Paper: Mikolaj Bojanczyk Edon Kelmendi Michal Skrzypczak
  MSO+nabla is undecidable (LICS 2019) More Information...
• Paper: Mikolaj Bojanczyk Amina Doumane
  First-order tree-to-tree functions (LICS 2020) More Information...
• Paper: Mikolaj Bojanczyk Edon Kelmendi Rafal Stefanski Georg Zetzsche
  Extensions of ω-Regular Languages (LICS 2020) More Information...
• Paper: Mikolaj Bojanczyk Bartek Klin Joshua Moerman
  Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata (LICS 2021) More Information...
• Invited Paper: Mikolaj Bojanczyk
  Transducers of polynomial growth (LICS 2022) More Information...

Mikołaj Bojańczyk

• Paper: Mikołaj Bojańczyk Thomas Colcombet
  Omega-Regular Expressions with Bounds (LICS 2006) More Information...
• Paper: Mikołaj Bojańczyk Anca Muscholl Thomas Schwentick Luc Segoufin Claire David
  Two-Variable Logic on Words with Data (LICS 2006) More Information...
• Paper: Mikołaj Bojańczyk
  Two-way unary temporal logic over trees (LICS 2007) More Information...
• Short Presentation: Mikołaj Bojańczyk
  The Common Fragment of CTL and LTL Needs Existential Modalities (LICS 2007) More Information...
• Paper: Mikołaj Bojańczyk Luc Segoufin Howard Straubing
  Piecewise Testable Tree Languages (LICS 2008) More Information...
• Paper: Mikołaj Bojańczyk Howard Straubing Igor Walukiewicz
  Wreath Products of Forest Algebras, with Applications to Tree Logics (LICS 2009) More Information...
• Paper: Mikołaj Bojańczyk Sławomir Lasota
  An Extension of Data Automata that Captures XPath (LICS 2010) More Information...
• Paper: Mikołaj Bojańczyk Bartek Klin Sławomir Lasota
  Automata with Group Actions (LICS 2011) More Information...
• Paper: Mikołaj Bojańczyk Bartek Klin Sławomir Lasota Szymon Torunczyk
  Turing Machines with Atoms (LICS 2013) More Information...
• Paper: Mikołaj Bojańczyk Christoph Dittmann Stephan Kreutzer
  Decomposition theorems and model-checking for the modal μ-calculus (LICS 2014) More Information...
• Paper: Mikołaj Bojańczyk
  Star Height via Games (LICS 2015) More Information...

Udi Boker

• Paper: Udi Boker Orna Kupferman
  Co-ing Büchi Made Tight and Useful (LICS 2009) More Information...
• Paper: Udi Boker Krishnendu Chatterjee Thomas A. Henzinger Orna Kupferman
  Temporal Specifications with Accumulative Values (LICS 2011) More Information...
• Paper: Udi Boker Thomas A. Henzinger Jan Otop
  The Target Discounted-Sum Problem (LICS 2015) More Information...
• Paper: Udi Boker Yariv Shaulian
  Automaton-Based Criteria for Membership in CTL (LICS 2018) More Information...

Benedikt Bollig

• Paper: Benedikt Bollig Dietrich Kuske Roy Mennicke
  The Complexity of Model Checking Multi-stack Systems (LICS 2013) More Information...
• Paper: Benedikt Bollig
  Logic for communicating automata with parameterized topology (LICS 2014) More Information...
• Paper: Benedikt Bollig Paul Gastin Benjamin Monmege Marc Zeitoun
  Logical characterization of weighted pebble walking automata (LICS 2014) More Information...

Ilario Bonacina

• Paper: Ilario Bonacina Maria Luisa Bonet
  On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems (LICS 2022) More Information...

Filippo Bonchi

• Paper: Filippo Bonchi Ugo Montanari Barbara König
  Saturated Semantics for Reactive Systems (LICS 2006) More Information...
• Paper: Filippo Bonchi Daniela Petrisan Damien Pous Jurriaan Rot
  Coinduction up-to in a fibrational setting (LICS 2014) More Information...
• Paper: Filippo Bonchi Fabio Gadducci Aleks Kissinger Pawel Sobocinski Fabio Zanasi
  Rewriting modulo symmetric monoidal structure (LICS 2016) More Information...
• Paper: Filippo Bonchi Fabio Gadducci Aleks Kissinger Pawel Sobocinski Fabio Zanasi
  Rewriting with Frobenius (LICS 2018) More Information...
• Paper: Filippo Bonchi Pierre Ganty Roberto Giacobazzi Dusko Pavlovic
  Sound up-to techniques and Complete abstract domains (LICS 2018) More Information...
• Paper: Filippo Bonchi Ana Sokolova Valeria Vignudelli
  The Theory of Traces for Systems with Nondeterminism and Probability (LICS 2019) More Information...
• Paper: Filippo Bonchi Robin Piedeleu Pawel Sobocinski Fabio Zanasi
  Graphical Affine Algebra (LICS 2019) More Information...

Maria Luisa Bonet

• Paper: Maria Luisa Bonet Samuel R. Buss
  On the deduction rule and the number of proof lines (LICS 1991) More Information...
• Paper: Ilario Bonacina Maria Luisa Bonet
  On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems (LICS 2022) More Information...

Iovka Boneva

• Paper: Iovka Boneva Jean-Marc Talbot Sophie Tison
  Expressiveness of a Spatial Logic for Trees (LICS 2005) More Information...

Édouard Bonnet

• Paper: Édouard Bonnet Jan Dreier Jakub Gajarský Stephan Kreutzer Nikolas Mählmann Pierre Simon Szymon Torunczyk
  Model Checking on Interpretations of Classes of Bounded Local Cliquewidth (LICS 2022) More Information...

Viviana Bono

• Invited Paper: Viviana Bono Mariangiola Dezani-Ciancaglini
  A tale of intersection types (LICS 2020) More Information...

Marcello Bonsangue

• Paper: Marcello Bonsangue Jan Rutten Alexandra Silva
  An Algebra for Kripke Polynomial Coalgebras (LICS 2009) More Information...

Michael Vanden Boom

• Paper: Michael Benedikt Balder ten Cate Michael Vanden Boom
  Effective interpolation and preservation in guarded logics (LICS 2014) More Information...
• Paper: Achim Blumensath Thomas Colcombet Denis Kuperberg Pawel Parys Michael Vanden Boom
  Two-way cost automata and cost logics over infinite trees (LICS 2014) More Information...
• Paper: Michael Benedikt Balder ten Cate Thomas Colcombet Michael Vanden Boom
  The Complexity of Boundedness for Guarded Logics (LICS 2015) More Information...
• Paper: Michael Benedikt Balder ten Cate Michael Vanden Boom
  Interpolation with Decidable Fixpoint Logics (LICS 2015) More Information...
• Paper: Michael Benedikt Pierre Bourhis Michael Vanden Boom
  A Step Up in Expressiveness of Decidable Fixpoint Logics (LICS 2016) More Information...

Anudhyan Boral

• Paper: Anudhyan Boral Sylvain Schmitz
  Model-Checking Parse Trees (LICS 2013) More Information...

Michele Boreale

• Paper: Michele Boreale Davide Sangiorgi
  Bisimulation in Name-Passing Calculi without Matching (LICS 1998) More Information...
• Paper: Michele Boreale Rocco De Nicola Rosario Pugliese
  Proof Techniques for Cryptographic Processes (LICS 1999) More Information...

Richard Bornat

• Paper: Matthew Parkinson Richard Bornat Cristiano Calcagno
  Variables as Resource in Hoare Logics (LICS 2006) More Information...

Peio Borthelle

• Paper: Peio Borthelle Tom Hirschowitz Ambroise Lafont
  A Cellular Howe Theorem (LICS 2020) More Information...

Soumitra Bose

• Paper: Soumitra Bose Edmund M. Clarke David E. Long Spiro Michaylov
  PARTHENON: a parallel theorem prover for non-Horn clauses (LICS 1989) More Information...

Ahmed Bouajjani

• Paper: Ahmed Bouajjani Rachid Echahed Joseph Sifakis
  On model checking for real-time properties with durations (LICS 1993) More Information...
• Paper: Ahmed Bouajjani Rachid Echahed Peter Habermehl
  On the Verification Problem of Nonregular Properties for Nonregular Processes (LICS 1995) More Information...
• Paper: Eugene Asarin Ahmed Bouajjani
  Perturbed Turing Machines and Hybrid Systems (LICS 2001) More Information...
• Paper: Ahmed Bouajjani Anca Muscholl Tayssir Touili
  Permutation Rewriting and Algorithmic Verification (LICS 2001) More Information...

Alexandre Boudet

• Paper: Alexandre Boudet Jean-Pierre Jouannaud Manfred Schmidt-Schauß
  Unification in free extensions of Boolean rings and Abelian groups (LICS 1988) More Information...
• Paper: Alexandre Boudet Evelyne Contejean Hervé Devie
  A new AC unification algorithm with an algorithm for solving systems of diophantine equations (LICS 1990) More Information...

Adel Bouhoula

• Paper: Adel Bouhoula Jean-Pierre Jouannaud
  Automata-driven automated induction (LICS 1997) More Information...

Pierre Bourhis

• Paper: Michael Benedikt Pierre Bourhis Balder ten Cate Gabriele Puppis
  Querying Visible and Invisible Information (LICS 2016) More Information...
• Paper: Michael Benedikt Pierre Bourhis Michael Vanden Boom
  A Step Up in Expressiveness of Decidable Fixpoint Logics (LICS 2016) More Information...

Patricia Bouyer

• Paper: Patricia Bouyer Thomas Brihaye Fabrice Chevalier
  Control in o-minimal hybrid systems (LICS 2006) More Information...
• Paper: Patricia Bouyer Nicolas Markey Joël Ouaknine James Worrell
  The Cost of Punctuality (LICS 2007) More Information...
• Paper: Christel Baier Nathalie Bertrand Patricia Bouyer Thomas Brihaye Marcus Größer
  Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (LICS 2008) More Information...

Simone Bova

• Paper: Simone Bova Robert Ganian Stefan Szeider
  Model checking existential logic on partially ordered sets (LICS 2014) More Information...
• Paper: Simone Bova Fabio Mogavero
  Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries (LICS 2017) More Information...

Nathan Bowler

• Paper: Jiri Adamek Stefan Milius Nathan Bowler Paul Blain Levy
  Coproducts of Monads on Set (LICS 2012) More Information...

Laura Bozzelli

• Paper: Laura Bozzelli David Pearce
  On the Complexity of Temporal Equilibrium Logic (LICS 2015) More Information...
• Paper: Laura Bozzelli Adriano Peron César Sánchez
  Asynchronous Extensions of HyperLTL (LICS 2021) More Information...

Jendrik Brachter

• Paper: Jendrik Brachter Pascal Schweitzer
  On the Weisfeiler-Leman Dimension of Finite Groups (LICS 2020) More Information...

Zarathustra Brady

• Paper: Libor Barto Zarathustra Brady Andrei Bulatov Marcin Kozik Dmitriy Zhuk
  Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP (LICS 2021) More Information...

Paul Brauner

• Paper: Paul Brauner Clément Houtmann Claude Kirchner
  Principles of Superdeduction (LICS 2007) More Information...

Tomáš Brázdil

• Paper: Tomáš Brázdil Václav Brozek Vojtech Forejt Antonín Kučera
  Stochastic Games with Branching-Time Winning Objectives (LICS 2006) More Information...
• Paper: Tomáš Brázdil Vojtech Forejt Jan Kretínský Antonín Kučera
  The Satisfiability Problem for Probabilistic CTL (LICS 2008) More Information...
• Paper: Tomáš Brázdil Václav Brozek Krishnendu Chatterjee Vojtech Forejt Antonín Kučera
  Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (LICS 2011) More Information...
• Paper: Tomáš Brázdil Krishnendu Chatterjee Vojtech Forejt Antonín Kučera
  Trading Performance for Stability in Markov Decision Processes (LICS 2013) More Information...
• Paper: Tomáš Brázdil Stefan Kiefer Antonín Kučera Petr Novotný Joost-Pieter Katoen
  Zero-reachability in probabilistic multi-counter automata (LICS 2014) More Information...
• Paper: Tomáš Brázdil Stefan Kiefer Antonín Kučera Petr Novotný
  Long-Run Average Behaviour of Probabilistic Vector Addition Systems (LICS 2015) More Information...

Tomás Brázdil

• Paper: Tomás Brázdil Krishnendu Chatterjee Antonín Kucera Petr Novotný Dominik Velan Florian Zuleger
  Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS (LICS 2018) More Information...

Val Breazu-Tannen

• Paper: Val Breazu-Tannen Albert R. Meyer
  Polymorphism is conservative over simple types (Preliminary Report) (LICS 1987) More Information...
• Paper: Val Breazu-Tannen
  Combining algebra and higher-order types (LICS 1988) More Information...
• Paper: Val Breazu-Tannen Thierry Coquand Carl A. Gunter Andre Scedrov
  Inheritance and explicit coercion (LICS 1989) More Information...
• Paper: Val Breazu-Tannen Delia Kesner Laurence Puel
  A typed pattern calculus (LICS 1993) More Information...

Matthew de Brecht

• Paper: Arno Pauly Matthew de Brecht
  Descriptive Set Theory in the Category of Represented Spaces (LICS 2015) More Information...

Nuria Brede

• Paper: Nuria Brede Hugo Herbelin
  On the logical structure of choice and bar induction principles (LICS 2021) More Information...

Romain Brenguier

• Paper: Romain Brenguier Jean-François Raskin Mathieu Sassolas
  The complexity of admissibility in Omega-regular games (LICS 2014) More Information...

Davide Bresolin

• Paper: Davide Bresolin Angelo Montanari Pietro Sala Guido Sciavicco
  What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBL (LICS 2011) More Information...

Flavien Breuvart

• Paper: Flavien Breuvart
  On the characterization of models of H (LICS 2014) More Information...

Thomas Brihaye

• Paper: Patricia Bouyer Thomas Brihaye Fabrice Chevalier
  Control in o-minimal hybrid systems (LICS 2006) More Information...
• Paper: Christel Baier Nathalie Bertrand Patricia Bouyer Thomas Brihaye Marcus Größer
  Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (LICS 2008) More Information...

Christopher H. Broadbent

• Paper: Christopher H. Broadbent Arnaud Carayol C.-H. Luke Ong Olivier Serre
  Recursion Schemes and Logical Reflection (LICS 2010) More Information...

Antonio Brogi

• Paper: Antonio Brogi Franco Turini
  Semantics of meta-logic in an algebra of programs (LICS 1994) More Information...

Stephen D. Brookes

• Paper: Stephen D. Brookes
  A Semantically Based Proof System for Partial Correctness and Deadlock in CSP (LICS 1986) More Information...
• Paper: Stephen D. Brookes
  Full abstraction for a shared variable parallel language (LICS 1993) More Information...
• Paper: Stephen D. Brookes
  The Essence of Parallel Algol (LICS 1996) More Information...

James Brotherston

• Paper: James Brotherston Alex K. Simpson
  Complete Sequent Calculi for Induction and Infinite Descent (LICS 2007) More Information...
• Paper: James Brotherston Max I. Kanovich
  Undecidability of Propositional Separation Logic and Its Neighbours (LICS 2010) More Information...
• Paper: James Brotherston Carsten Fuhs Juan A. Navarro Pérez Nikos Gorogiannis
  A decision procedure for satisfiability in separation logic with inductive predicates (LICS 2014) More Information...

Carolyn Brown

• Paper: Carolyn Brown Doug Gurr
  A categorical linear framework for Petri nets (LICS 1990) More Information...
• Paper: Carolyn Brown Graham Hutton
  Categories, allegories and circuit design (LICS 1994) More Information...

Michael C. Browne

• Paper: Michael C. Browne
  An Improved Algorithm for the Automatic Verification of Finite State Systems Using Temporal Logic (LICS 1986) More Information...

Václav Brozek

• Paper: Tomáš Brázdil Václav Brozek Vojtech Forejt Antonín Kučera
  Stochastic Games with Branching-Time Winning Objectives (LICS 2006) More Information...
• Paper: Tomáš Brázdil Václav Brozek Krishnendu Chatterjee Vojtech Forejt Antonín Kučera
  Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (LICS 2011) More Information...

Kim B. Bruce

• Paper: Roberto M. Amadio Kim B. Bruce Giuseppe Longo
  The Finitary Projection Model for Second Order Lambda Calculus and Solutions to Higher Order Domain Equations (LICS 1986) More Information...
• Paper: Kim B. Bruce Giuseppe Longo
  A modest model of records, inheritance and bounded quantification (LICS 1988) More Information...

Guillaume Brunerie

• Paper: Daniel R. Licata Guillaume Brunerie
  A Cubical Approach to Synthetic Homotopy Theory (LICS 2015) More Information...

Paul Brunet

• Paper: Paul Brunet Damien Pous
  Petri Automata for Kleene Allegories (LICS 2015) More Information...

Roberto Bruni

• Invited Paper: Roberto Bruni Ugo Montanari
  Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-Calculus (LICS 1999) More Information...
• Paper: Roberto Bruni Hernán C. Melgratti Ugo Montanari
  Concurrency and Probability: Removing Confusion, Compositionally (LICS 2018) More Information...
• Paper: Roberto Bruni Roberto Giacobazzi Roberta Gori Francesco Ranzato
  A Logic for Locally Complete Abstract Interpretations (LICS 2021) More Information...

Glenn Bruns

• Paper: Glenn Bruns Patrice Godefroid
  Temporal Logic Query Checking (LICS 2001) More Information...

Véronique Bruyére

• Paper: Véronique Bruyére Noémie Meunier Jean-François Raskin
  Secure equilibria in weighted games (LICS 2014) More Information...

Randal E. Bryant

• Paper: Sanjit A. Seshia Randal E. Bryant
  Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds (LICS 2004) More Information...
• Invited Paper: Randal E. Bryant
  Formal Verification of Infinite State Systems Using Boolean Methods (LICS 2006) More Information...

Antonio Bucciarelli

• Paper: Antonio Bucciarelli Thomas Ehrhard
  Sequentiality and strong stability (LICS 1991) More Information...
• Paper: Antonio Bucciarelli Silvia De Lorenzis Adolfo Piperno Ivano Salvo
  Some Computational Properties of Intersection Types (LICS 1999) More Information...
• Paper: Antonio Bucciarelli Antonino Salibra
  The Sensible Graph Theories of Lambda Calculus (LICS 2004) More Information...

Ulrik Buchholtz

• Paper: Ulrik Buchholtz Egbert Rijke
  The real projective spaces in homotopy type theory (LICS 2017) More Information...
• Paper: Ulrik Buchholtz Floris van Doorn Egbert Rijke
  Higher Groups in Homotopy Type Theory (LICS 2018) More Information...
• Paper: Ulrik Buchholtz Kuen-Bang Hou (Favonia)
  Cellular Cohomology in Homotopy Type Theory (LICS 2018) More Information...

Andrei A. Bulatov

• Paper: Andrei A. Bulatov
  Tractable conservative Constraint Satisfaction Problems (LICS 2003) More Information...
• Paper: Andrei A. Bulatov
  A Graph of a Relational Structure and Constraint Satisfaction Problems (LICS 2004) More Information...
• Paper: Andrei A. Bulatov Dániel Marx
  The Complexity of Global Cardinality Constraints (LICS 2009) More Information...
• Paper: Andrei A. Bulatov
  Graphs of relational structures: restricted types (LICS 2016) More Information...
• Paper: Andrei A. Bulatov
  Constraint satisfaction problems over semilattice block Mal'tsev algebras (LICS 2017) More Information...
• Paper: Andrei A. Bulatov
  A short story of the CSP dichotomy conjecture (LICS 2019) More Information...

Andrei Bulatov

• Paper: Libor Barto Zarathustra Brady Andrei Bulatov Marcin Kozik Dmitriy Zhuk
  Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP (LICS 2021) More Information...

Daniel Bundala

• Paper: Daniel Bundala Joël Ouaknine James Worrell
  On the Magnitude of Completeness Thresholds in Bounded Model Checking (LICS 2012) More Information...

Jerry R. Burch

• Paper: Jerry R. Burch Edmund M. Clarke Kenneth L. McMillan David L. Dill L. James Hwang
  Symbolic model checking: 10^20 states and beyond (LICS 1990) More Information...

Guillaume Burel

• Short Presentation: Guillaume Burel Claude Kirchner
  An Abstract Completion Procedure for Cut Elimination in Deduction Modulo (LICS 2006) More Information...
• Paper: Guillaume Burel
  A First-Order Representation of Pure Type Systems Using Superdeduction (LICS 2008) More Information...

Joshua Buresh-Oppenheim

• Paper: Joshua Buresh-Oppenheim Toniann Pitassi
  The Complexity of Resolution Refinements (LICS 2003) More Information...

Elisabet Burjons

• Paper: Elisabet Burjons Fabian Frei Martin Raszyk
  From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata (LICS 2021) More Information...

Toby Cathcart Burn

• Paper: Toby Cathcart Burn Luke Ong Steven J. Ramsay Dominik Wagner
  Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses (LICS 2021) More Information...

Rod M. Burstall

• Invited Paper: Rod M. Burstall
  Terms, proofs and refinement (LICS 1994) More Information...

Samuel R. Buss

• Paper: Maria Luisa Bonet Samuel R. Buss
  On the deduction rule and the number of proof lines (LICS 1991) More Information...
• Paper: Samuel R. Buss Bruce M. Kapron
  Resource-Bounded Continuity and Sequentiality for Type-Two Functionals (LICS 2000) More Information...

Jan Van den Bussche

• Paper: Dimitri Surinx Jan Van den Bussche Dirk Van Gucht
  The primitivity of operators in the algebra of binary relations under conjunctions of containments (LICS 2017) More Information...
• Paper: Miika Hannula Juha Kontinen Jan Van den Bussche Jonni Virtema
  Descriptive complexity of real computation and probabilistic independence logic (LICS 2020) More Information...