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:

• Seunghwan O
• Peter W. O'Hearn
• Jan Obdrzálek
• Joanna Ochremiak
• Philip Offtermatt
• Pierre Ohlmann
• Christoph Ohrem
• Mitsuhiro Okada
• Frank J. Oles
• Federico Olimpieri
• Paulo Oliva
• Federico Olmedo
• Miroslav Olsák
• C.-H. Luke Ong
• Luke Ong
• Jakub Oprsal
• Lukasz Orlikowski
• Christopher J. Osborn
• Piotr Ostropolski-Nalewaja
• Jan Otop
• Martin Otto
• Joël Ouaknine
• Joël Ouaknine
• Youssouf Oualhadj

Seunghwan O

• Short Presentation: Hyunjun Eo Seunghwan O Nikolay Shilov
  Finite game semantics for Propositional Program Logics (LICS 2005) More Information...

Peter W. O'Hearn

• Paper: Cristiano Calcagno Peter W. O'Hearn Hongseok Yang
  Local Action and Abstract Separation Logic (LICS 2007) More Information...
• Paper: Peter W. O'Hearn
  From Categorical Logic to Facebook Engineering (LICS 2015) More Information...
• Invited Paper: Peter W. O'Hearn
  Continuous Reasoning: Scaling the impact of formal methods (LICS 2018) More Information...

Jan Obdrzálek

• Paper: Jakub Gajarský Petr Hlinený Jan Obdrzálek Daniel Lokshtanov M. S. Ramanujan
  A New Perspective on FO Model Checking of Dense Graph Classes (LICS 2016) More Information...

Joanna Ochremiak

• Paper: Bartek Klin Sławomir Lasota Joanna Ochremiak Szymon Torunczyk
  Turing machines with atoms, constraint satisfaction problems, and descriptive complexity (LICS 2014) More Information...
• Paper: Bartek Klin Eryk Kopczyński Joanna Ochremiak Szymon Torunczyk
  Locally Finite Constraint Satisfaction Problems (LICS 2015) More Information...
• Paper: Albert Atserias Joanna Ochremiak
  Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem (LICS 2018) More Information...
• Paper: Albert Atserias Anuj Dawar Joanna Ochremiak
  On the Power of Symmetric Linear Programs (LICS 2019) More Information...

Philip Offtermatt

• 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...

Pierre Ohlmann

• Paper: Pierre Ohlmann
  Characterizing Positionality in Games of Infinite Duration over Infinite Graphs (LICS 2022) More Information...

Christoph Ohrem

• Paper: Jens Oliver Gutsfeld Arne Meier Christoph Ohrem Jonni Virtema
  Temporal Team Semantics Revisited (LICS 2022) More Information...

Mitsuhiro Okada

• Paper: Nachum Dershowitz Mitsuhiro Okada
  Proof-theoretic techniques for term rewriting theory (LICS 1988) More Information...
• Paper: Jean-Pierre Jouannaud Mitsuhiro Okada
  A computation model for executable higher-order algebraic specification languages (LICS 1991) More Information...

Frank J. Oles

• Paper: Michael W. Mislove Lawrence S. Moss Frank J. Oles
  Non-well-founded sets obtained from ideal fixed points (LICS 1989) More Information...
• Short Presentation: Frank J. Oles
  Patterns Based on Multiple Interacting Partial Orders (LICS 2003) More Information...

Federico Olimpieri

• Paper: Federico Olimpieri
  Intersection Type Distributors (LICS 2021) More Information...

Paulo Oliva

• Paper: Paulo Oliva
  Polynomial-time Algorithms from Ineffective Proofs (LICS 2003) More Information...
• Paper: Paulo Oliva
  Modified Realizability Interpretation of Classical Linear Logic (LICS 2007) More Information...

Federico Olmedo

• Paper: Federico Olmedo Benjamin Lucien Kaminski Joost-Pieter Katoen Christoph Matheja
  Reasoning about Recursive Probabilistic Programs (LICS 2016) More Information...

Miroslav Olsák

• 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: 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...

C.-H. Luke Ong

• Paper: C.-H. Luke Ong
  Non-determinism in a functional setting (LICS 1993) More Information...
• Paper: C.-H. Luke Ong
  A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations (LICS 1996) More Information...
• Paper: Andrzej S. Murawski C.-H. Luke Ong
  Dominator Trees and Fast Verification of Proof Nets (LICS 2000) More Information...
• Paper: C.-H. Luke Ong
  Observational equivalence of 3rd-order Idealized Algol is decidable (LICS 2002) More Information...
• Paper: Samson Abramsky Dan R. Ghica Andrzej S. Murawski C.-H. Luke Ong Ian D. B. Stark
  Nominal Games and Full Abstraction for the Nu-Calculus (LICS 2004) More Information...
• Paper: C.-H. Luke Ong
  On model-checking trees generated by higher-order recursion schemes (LICS 2006) More Information...
• Paper: Arnaud Carayol Matthew Hague Antoine Meyer C.-H. Luke Ong Olivier Serre
  Winning Regions of Higher-Order Pushdown Games (LICS 2008) More Information...
• Paper: Matthew Hague Andrzej S. Murawski C.-H. Luke Ong Olivier Serre
  Collapsible Pushdown Automata and Recursion Schemes (LICS 2008) More Information...
• Paper: Naoki Kobayashi C.-H. Luke Ong
  A Type System Equivalent to Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes (LICS 2009) More Information...
• Paper: C.-H. Luke Ong Nikos Tzevelekos
  Functional Reachability (LICS 2009) More Information...
• Paper: Christopher H. Broadbent Arnaud Carayol C.-H. Luke Ong Olivier Serre
  Recursion Schemes and Logical Reflection (LICS 2010) More Information...
• Paper: Takeshi Tsukada C.-H. Luke Ong
  Compositional higher-order model checking via ω-regular games over Böhm trees (LICS 2014) More Information...
• Paper: Takeshi Tsukada C.-H. Luke Ong
  Nondeterminism in Game Semantics via Sheaves (LICS 2015) More Information...
• Paper: Takeshi Tsukada C.-H. Luke Ong
  Plays as Resource Terms via Non-idempotent Intersection Types (LICS 2016) More Information...
• Invited Paper: C.-H. Luke Ong
  Quantitative semantics of the lambda calculus: Some generalisations of the relational model (LICS 2017) More Information...
• Paper: Takeshi Tsukada Kazuyuki Asada C.-H. Luke Ong
  Generalised species of rigid resource terms (LICS 2017) More Information...
• Paper: Takeshi Tsukada Kazuyuki Asada C.-H. Luke Ong
  Species, Profunctors and Taylor Expansion Weighted by SMCC: A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs (LICS 2018) More Information...
• Paper: C.-H. Luke Ong Dominik Wagner
  HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo Theories (LICS 2019) More Information...
• Paper: Andrew Kenyon-Roberts C.-H. Luke Ong
  Supermartingales, Ranking Functions and Probabilistic Lambda Calculus (LICS 2021) More Information...

Luke Ong

• Paper: Luke Ong
  Higher-Order Model Checking: An Overview (LICS 2015) More Information...
• 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...
• Paper: Guanyan Li Andrzej S. Murawski Luke Ong
  Probabilistic Verification Beyond Context-Freeness (LICS 2022) More Information...

Jakub Oprsal

• 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...

Lukasz Orlikowski

• Paper: Wojciech Czerwinski Lukasz Orlikowski
  Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes (LICS 2022) More Information...

Christopher J. Osborn

• Paper: Andrei Popescu Elsa L. Gunter Christopher J. Osborn
  Strong Normalization of System F by HOAS on Top of FOAS (LICS 2010) More Information...

Piotr Ostropolski-Nalewaja

• Paper: Grzegorz Gluch Jerzy Marcinkowski Piotr Ostropolski-Nalewaja
  Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable (LICS 2018) More Information...

Jan Otop

• Paper: Jakub Michaliszyn Jan Otop
  Decidable Elementary Modal Logics (LICS 2012) More Information...
• Short Presentation: Thomas A. Henzinger Jan Otop
  From Model Checking to Model Measuring (LICS 2013) More Information...
• Paper: Krishnendu Chatterjee Thomas A. Henzinger Jan Otop
  Nested Weighted Automata (LICS 2015) More Information...
• Paper: Udi Boker Thomas A. Henzinger Jan Otop
  The Target Discounted-Sum Problem (LICS 2015) More Information...
• Paper: Krishnendu Chatterjee Thomas A. Henzinger Jan Otop
  Quantitative Automata under Probabilistic Semantics (LICS 2016) More Information...

Martin Otto

• Paper: Martin Otto
  Generalized quantifiers for simple properties (LICS 1994) More Information...
• Paper: Martin Otto
  PTime Canonization for Two Variables with Counting (LICS 1995) More Information...
• Paper: Erich Grädel Martin Otto Eric Rosen
  Two-variable logic with counting is decidable (LICS 1997) More Information...
• Paper: Phokion G. Kolaitis Martin Otto
  On the Boundedness Problem for Two-Variable First-Order Logic (LICS 1998) More Information...
• Paper: Erich Grädel Colin Hirsch Martin Otto
  Back and Forth between Guarded and Modal Logics (LICS 2000) More Information...
• Paper: Martin Otto
  Modal and guarded characterisation theorems over finite transition systems (LICS 2002) More Information...
• Paper: Anuj Dawar Martin Otto
  Modal Characterisation Theorems over Special Classes of Frames (LICS 2005) More Information...
• Paper: Emanuel Kieronski Martin Otto
  Small Substructures and Decidability Issues for First-Order Logic with Two Variables (LICS 2005) More Information...
• Paper: Martin Otto
  The boundedness problem for monadic universal first-order logic (LICS 2006) More Information...
• Paper: Vince Bárány Georg Gottlob Martin Otto
  Querying the Guarded Fragment (LICS 2010) More Information...
• Paper: Martin Otto
  Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment (LICS 2010) More Information...
• Paper: Martin Otto
  Groupoids, Hypergraphs, and Symmetries in Finite Models (LICS 2013) More Information...
• Paper: Felix Canavoi Martin Otto
  Common knowledge and multi-scale locality analysis in Cayley structures (LICS 2017) More Information...

Joël Ouaknine

• Paper: Joël Ouaknine James Worrell
  Revisiting Digitization, Robustness, and Decidability for Timed Automata (LICS 2003) More Information...
• Paper: Joël Ouaknine James Worrell
  On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap (LICS 2004) More Information...
• Paper: Joël Ouaknine James Worrell
  On the Decidability of Metric Temporal Logic (LICS 2005) More Information...
• Paper: Patricia Bouyer Nicolas Markey Joël Ouaknine James Worrell
  The Cost of Punctuality (LICS 2007) More Information...
• Paper: Mark Jenkins Joël Ouaknine Alexander M. Rabinovich James Worrell
  Alternating Timed Automata over Bounded Time (LICS 2010) More Information...
• Paper: Daniel Bundala Joël Ouaknine James Worrell
  On the Magnitude of Completeness Thresholds in Bounded Model Checking (LICS 2012) More Information...
• Paper: Paul Hunter Joël Ouaknine James Worrell
  Expressive Completeness for Metric Temporal Logic (LICS 2013) More Information...
• Paper: Antonia Lechner Joël Ouaknine James Worrell
  On the Complexity of Linear Arithmetic with Divisibility (LICS 2015) More Information...
• Paper: Ventsislav Chonev Joël Ouaknine James Worrell
  On Recurrent Reachability for Continuous Linear Dynamical Systems (LICS 2016) More Information...
• Paper: Joël Ouaknine Amaury Pouly João Sousa Pinto James Worrell
  Solvability of Matrix-Exponential Equations (LICS 2016) More Information...
• Paper: Dror Fried Axel Legay Joël Ouaknine Moshe Y. Vardi
  Sequential Relational Decomposition (LICS 2018) More Information...
• Paper: Ehud Hrushovski Joël Ouaknine Amaury Pouly James Worrell
  Polynomial Invariants for Affine Programs (LICS 2018) More Information...
• Paper: Florian Luca Joël Ouaknine James Worrell
  Universal Skolem Sets (LICS 2021) More Information...

Joël Ouaknine

• Paper: Richard Lipton Florian Luca Joris Nieuwveld Joël Ouaknine David Purser James Worrell
  On the Skolem Problem and the Skolem Conjecture (LICS 2022) More Information...

Youssouf Oualhadj

• Paper: Nathanaël Fijalkow Hugo Gimbert Youssouf Oualhadj
  Deciding the Value 1 Problem for Probabilistic Leaktight Automata (LICS 2012) More Information...