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:

• David Sabel
• Jorge Luis Sacchini
• Mehrnoosh Sadrzadeh
• Shmuel Safra
• Shmuel Sagiv
• Yehoshua Sagiv
• Ildikó Sain
• Prakash Saivasan
• Pietro Sala
• Antonino Salibra
• Sylvain Salvati
• Anne Salvesen
• Ivano Salvo
• César Sánchez
• Sam Sanders
• Anders Sandholm
• Davide Sangiorgi
• Sriram Sankaranarayanan
• Ocan Sankur
• Donald Sannella
• Luigi Santocanale
• Felipe Ferreira Santos
• Ahmed Saoudi
• N. Ege Saraç
• Vijay A. Saraswat
• Saptarshi Sarkar
• Ralph Sarkis
• Jeffrey Sarnat
• Mathieu Sassolas
• Vladimiro Sassone
• Tetsuya Sato
• Christian Sattler
• Alexis Saurin
• Luigi Sauro
• Rahul Savani
• Philip Saville
• Bassem Sayrafi
• Andre Scedrov
• Andrea Schalk
• Svenja Schalthofer
• Christelle Scharff
• Sven Schewe
• John S. Schlipf
• Jeanette P. Schmidt
• Manfred Schmidt-Schauß
• Alan Schmitt
• Sylvain Schmitz
• Robert R. Schneck
• Michael A. Schneider
• Fred B. Schneider
• Philippe Schnoebelen
• Ulrich Schöpp
• Tom Schrijvers
• Lutz Schröder
• Peter Schroeder-Heister
• Matthias Schröder
• Lutz Schröder
• Paul E. Schupp
• Carsten Schürmann
• Peter Schuster
• Grigori Schwarz
• Nicole Schweikardt
• Pascal Schweitzer
• Thomas Schwentick
• Helmut Schwichtenberg
• Jan Schwinghammer
• Luke Sciarappa
• Guido Sciavicco
• Luis Scoccola
• Dana S. Scott
• Philip J. Scott
• Dana Scott
• Elizabeth Scott
• Robert A. G. Seely
• Luc Segoufin
• Peter-Michael Seidel
• Helmut Seidl
• Fatemeh Seifan
• Thomas Seiller
• R. C. Sekar
• Jerry Seligman
• Peter Selinger
• Bart Selman
• Jas Semrl
• Géraud Sénizergues
• Amilcar Sernadas
• Olivier Serre
• Frédéric Servais
• Rocco A. Servedio
• Sanjit A. Seshia
• Anil Seth
• Anton Setzer
• Peter Sewell
• Nihil Shah
• Preey Shah
• Natarajan Shankar
• Zhong Shao
• Ehud Y. Shapiro
• Aditya Sharad
• Yariv Shaulian
• Saharon Shelah
• Noam Shenwald
• Benjamin Sherman
• Rivi Sherman
• Nikolay Shilov
• Mahsa Shirmohammadi
• Vitaly Shmatikov
• Sharon Shoham
• Yoav Shoham
• Richard A. Shore
• Michael Shulman
• Jon Shultis
• Salomon Sickert
• Sebastian Siebertz
• Joseph Sifakis
• Vincent Siles
• Alexandra Silva
• Nadish de Silva
• Mantas Simkus
• Robert J. Simmons
• Pierre Simon
• Alex K. Simpson
• Parag Singla
• A. Prasad Sistla
• Michal Skrzypczak
• Giora Slutzki
• Scott F. Smith
• Jan M. Smith
• Geoffrey Smith
• Scott A. Smolka
• Wayne Snyder
• Pawel Sobocinski
• Kristina Sojakova
• Ana Sokolova
• Oleg Sokolsky
• Sylvain Soliman
• Sergei Soloviev
• Michael Soltys
• Lei Song
• Matthieu Sozeau
• Frances Spalding
• Sam Speight
• David I. Spivak
• Arnaud Spiwack
• Christoph Sprenger
• David Sprunger
• A. V. Sreejith
• Jai Srinivasan
• B. Srivathsan
• Eugene W. Stark
• Ian D. B. Stark
• Richard Statman
• Sam Staton
• Hugh Steele
• Léo Stefanesco
• Andrei Stefanescu
• Rafal Stefanski
• Kjartan Stefánsson
• Bernhard Steffen
• Dario Stein
• Florian Steinberg
• Jari Stenman
• Frank Stephan
• Jonathan Sterling
• Colin Stirling
• Mariëlle Stoelinga
• Alexei P. Stolboushkin
• Scott D. Stoller
• Viggo Stoltenberg-Hansen
• Allen Stoughton
• Lutz Straßburger
• Howard Straubing
• Thomas Streicher
• Pierre-Yves Strub
• Peter J. Stuckey
• Aaron Stump
• Thomas Sturm
• Robert F. Stärk
• Kristian Støvring
• Ramesh Subrahmanyam
• Dan Suciu
• Kohei Suenaga
• Eijiro Sumii
• Mikko Suonio
• Dimitri Surinx
• Grégoire Sutre
• Alexander Svozil
• Stefan Szeider
• Wieslaw Szwast

David Sabel

• Paper: David Sabel Manfred Schmidt-Schauß
  Conservative Concurrency in Haskell (LICS 2012) More Information...

Jorge Luis Sacchini

• Paper: Jorge Luis Sacchini
  Type-Based Productivity of Stream Definitions in the Calculus of Constructions (LICS 2013) More Information...

Mehrnoosh Sadrzadeh

• Short Presentation: Mehrnoosh Sadrzadeh
  Quantales for Reasoning about Security Protocols (LICS 2005) More Information...

Shmuel Safra

• Paper: Orna Kupferman Shmuel Safra Moshe Y. Vardi
  Relating word and tree automata (LICS 1996) More Information...

Shmuel Sagiv

• Paper: Thomas W. Reps Alexey Loginov Shmuel Sagiv
  Semantic Minimization of 3-Valued Propositional Formulae (LICS 2002) More Information...

Yehoshua Sagiv

• Paper: Haim Gaifman Harry G. Mairson Yehoshua Sagiv Moshe Y. Vardi
  Undecidable Optimization Problems for Database Logic Programs (LICS 1987) More Information...

Ildikó Sain

• Paper: Johann A. Makowsky Ildikó Sain
  On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems (LICS 1986) More Information...

Prakash Saivasan

• Paper: Mohamed Faouzi Atig Dmitry Chistikov Piotr Hofman K. Narayan Kumar Prakash Saivasan Georg Zetzsche
  The complexity of regular abstractions of one-counter languages (LICS 2016) More Information...
• Paper: C. Aiswarya Soumodev Mal Prakash Saivasan
  On the Satisfiability of Context-free String Constraints with Subword-Ordering (LICS 2022) More Information...

Pietro Sala

• 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...
• Paper: Angelo Montanari Pietro Sala
  Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness (LICS 2013) More Information...

Antonino Salibra

• Paper: Antonino Salibra
  A Continuum of Theories of Lambda Calculus without Semantics (LICS 2001) More Information...
• Paper: Antonio Bucciarelli Antonino Salibra
  The Sensible Graph Theories of Lambda Calculus (LICS 2004) More Information...
• Paper: Giulio Manzonetto Antonino Salibra
  Boolean algebras for lambda calculus (LICS 2006) More Information...
• Paper: Alberto Carraro Antonino Salibra
  Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus (LICS 2009) More Information...
• Paper: Antonino Salibra Giulio Manzonetto Giordano Favro
  Factor Varieties and Symbolic Computation (LICS 2016) More Information...

Sylvain Salvati

• Paper: Philippe de Groote Bruno Guillaume Sylvain Salvati
  Vector Addition Tree Automata (LICS 2004) More Information...
• Paper: Lorenzo Clemente Pawel Parys Sylvain Salvati Igor Walukiewicz
  The Diagonal Problem for Higher-Order Recursion Schemes is Decidable (LICS 2016) More Information...

Anne Salvesen

• Paper: Anne Salvesen Jan M. Smith
  The strength of the subset type in Martin-Löf's type theory (LICS 1988) More Information...

Ivano Salvo

• Paper: Antonio Bucciarelli Silvia De Lorenzis Adolfo Piperno Ivano Salvo
  Some Computational Properties of Intersection Types (LICS 1999) More Information...

César Sánchez

• Paper: Laura Bozzelli Adriano Peron César Sánchez
  Asynchronous Extensions of HyperLTL (LICS 2021) More Information...

Sam Sanders

• Short Presentation: Sam Sanders
  Computing the Infinite (LICS 2011) More Information...

Anders Sandholm

• Paper: Jon G. Riecke Anders Sandholm
  A Relational Account of Call-by-Value Sequentially (LICS 1997) More Information...

Davide Sangiorgi

• Paper: Davide Sangiorgi
  The lazy lambda calculus in a concurrency scenario (LICS 1992) More Information...
• Paper: Benjamin C. Pierce Davide Sangiorgi
  Typing and subtyping for mobile processes (LICS 1993) More Information...
• Paper: Marcelo P. Fiore Eugenio Moggi Davide Sangiorgi
  A Fully-Abstract Model for the pi-calculus (Extended Abstract) (LICS 1996) More Information...
• Paper: Michele Boreale Davide Sangiorgi
  Bisimulation in Name-Passing Calculi without Matching (LICS 1998) More Information...
• Paper: Daniel Hirschkoff Étienne Lozes Davide Sangiorgi
  Separability, expressiveness, and decidability in the Ambient Logic (LICS 2002) More Information...
• Invited Paper: Davide Sangiorgi
  Bisimulation: From The Origins to Today (LICS 2004) More Information...
• Paper: Davide Sangiorgi Naoki Kobayashi Eijiro Sumii
  Environmental Bisimulations for Higher-Order Languages (LICS 2007) More Information...
• Paper: Ivan Lanese Jorge A. Perez Davide Sangiorgi Alan Schmitt
  On the Expressiveness and Decidability of Higher-Order Process Calculi (LICS 2008) More Information...
• Paper: Daniel Hirschkoff Jean-Marie Madiot Davide Sangiorgi
  Name-Passing Calculi: From Fusions to Preorders and Types (LICS 2013) More Information...
• Paper: Marco Bernardo Davide Sangiorgi Valeria Vignudelli
  On the discriminating power of passivation and higher-order interaction (LICS 2014) More Information...
• Paper: Adrien Durier Daniel Hirschkoff Davide Sangiorgi
  Eager Functions as Processes (LICS 2018) More Information...
• Paper: Daniel Hirschkoff Enguerrand Prebet Davide Sangiorgi
  On sequentiality and well-bracketing in the π-calculus (LICS 2021) More Information...

Sriram Sankaranarayanan

• Paper: Swarat Chaudhuri Sriram Sankaranarayanan Moshe Y. Vardi
  Regular Real Analysis (LICS 2013) More Information...

Ocan Sankur

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

Donald Sannella

• Paper: Robert Harper Donald Sannella Andrzej Tarlecki
  Structure and representation in LF (LICS 1989) More Information...

Luigi Santocanale

• Paper: Luigi Santocanale
  Completions of µ-algebras (LICS 2005) More Information...

Felipe Ferreira Santos

• Paper: Anuj Dawar Felipe Ferreira Santos
  Separating LREC from LFP (LICS 2022) More Information...

Ahmed Saoudi

• Paper: David E. Muller Ahmed Saoudi Paul E. Schupp
  Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time (LICS 1988) More Information...

N. Ege Saraç

• Paper: Thomas Ferrère Thomas A. Henzinger N. Ege Saraç
  A Theory of Register Monitors (LICS 2018) More Information...
• Paper: Thomas A. Henzinger N. Ege Saraç
  Quantitative and Approximate Monitoring (LICS 2021) More Information...

Vijay A. Saraswat

• Paper: Vijay A. Saraswat
  The category of constraint systems is Cartesian-closed (LICS 1992) More Information...
• Paper: Vijay A. Saraswat Radha Jagadeesan Vineet Gupta
  Foundations of timed concurrent constraint programming (LICS 1994) More Information...
• Paper: Catuscia Palamidessi Vijay A. Saraswat Frank D. Valencia Björn Victor
  On the Expressiveness of Linearity vs Persistence in the Asynchronous Pi-Calculus (LICS 2006) More Information...

Saptarshi Sarkar

• Paper: Bharat Adsul Saptarshi Sarkar A. V. Sreejith
  Block products for algebras over countable words and applications to logic (LICS 2019) More Information...

Ralph Sarkis

• Paper: Matteo Mio Ralph Sarkis Valeria Vignudelli
  Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning (LICS 2021) More Information...
• Paper: Matteo Mio Ralph Sarkis Valeria Vignudelli
  Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning (LICS 2022) More Information...

Jeffrey Sarnat

• Paper: Carsten Schürmann Jeffrey Sarnat
  Structural Logical Relations (LICS 2008) More Information...

Mathieu Sassolas

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

Vladimiro Sassone

• Paper: Gian Luca Cattani Vladimiro Sassone
  Higher Dimensional Transition Systems (LICS 1996) More Information...
• Short Presentation: Jens C. Godskesen Thomas Hildebrandt Vladimiro Sassone
  An Overview of MR, a Calculus of Mobile Resources (LICS 2002) More Information...
• Paper: Vladimiro Sassone Pawel Sobocinski
  Reactive Systems over Cospans (LICS 2005) More Information...

Tetsuya Sato

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

Christian Sattler

• Paper: Christian Sattler Andrea Vezzosi
  Partial Univalence in n-truncated Type Theory (LICS 2020) More Information...

Alexis Saurin

• Short Presentation: Alexis Saurin
  Separation and the Lambdamu-Calculus (LICS 2004) More Information...
• Paper: Alexis Saurin
  Separation with Streams in the lambdaµ-calculus (LICS 2005) 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...

Luigi Sauro

• Paper: Fabio Mogavero Aniello Murano Luigi Sauro
  On the Boundary of Behavioral Strategies (LICS 2013) More Information...

Rahul Savani

• Paper: John Fearnley Rasmus Ibsen-Jensen Rahul Savani
  One-Clock Priced Timed Games are PSPACE-hard (LICS 2020) More Information...

Philip Saville

• Paper: Marcelo P. Fiore Philip Saville
  A type theory for cartesian closed bicategories (Extended Abstract) (LICS 2019) More Information...
• Paper: Marcelo P. Fiore Philip Saville
  Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure (LICS 2020) More Information...

Bassem Sayrafi

• Short Presentation: Bassem Sayrafi Dirk Van Gucht Marc Gyssens
  Measures and Measure-Based Constraints (LICS 2005) More Information...

Andre Scedrov

• Paper: Dale A. Miller Gopalan Nadathur Andre Scedrov
  Hereditary Harrop Formulas and Uniform Proof Systems (LICS 1987) More Information...
• Paper: Peter J. Freyd Andre Scedrov
  Some Semantic Aspects of Polymorphic Lambda Calculus (LICS 1987) More Information...
• Paper: Peter J. Freyd Jean-Yves Girard Andre Scedrov Philip J. Scott
  Semantic parametricity in polymorphic lambda calculus (LICS 1988) More Information...
• Paper: Val Breazu-Tannen Thierry Coquand Carl A. Gunter Andre Scedrov
  Inheritance and explicit coercion (LICS 1989) More Information...
• Paper: Anil Nerode Jeffrey B. Remmel Andre Scedrov
  Polynomially graded logic I. A graded version of system T (LICS 1989) More Information...
• Paper: Patrick Lincoln Andre Scedrov Natarajan Shankar
  Linearizing intuitionistic implication (LICS 1991) More Information...
• Paper: Patrick Lincoln Natarajan Shankar Andre Scedrov
  Decision Problems For Second-Order Linear Logic (LICS 1995) More Information...
• Invited Paper: John C. Mitchell Ajith Ramanathan Vanessa Teague Andre Scedrov
  Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis (LICS 2001) More Information...

Andrea Schalk

• Paper: Martin Hyland Andrea Schalk
  Games on Graphs and Sequentially Realizable Functionals (LICS 2002) More Information...
• Paper: Andrea Schalk Hugh Steele
  Constructing Fully Complete Models for Multiplicative Linear Logic (LICS 2012) More Information...

Svenja Schalthofer

• Paper: Erich Grädel Wied Pakusa Svenja Schalthofer Lukasz Kaiser
  Characterising Choiceless Polynomial Time with First-Order Interpretations (LICS 2015) More Information...

Christelle Scharff

• Short Presentation: Christopher Lynch Christelle Scharff
  Basic Completion Modulo with Simplification (LICS 2001) More Information...

Sven Schewe

• Paper: Bernd Finkbeiner Sven Schewe
  Uniform Distributed Synthesis (LICS 2005) More Information...
• Paper: Richard Mayr Sven Schewe Patrick Totzke Dominik Wojtczak
  MDPs with energy-parity objectives (LICS 2017) More Information...

John S. Schlipf

• Paper: John S. Schlipf
  How Uncomputable is General Circumscription? (Extended Abstract) (LICS 1986) More Information...

Jeanette P. Schmidt

• Paper: David Harel Amir Pnueli Jeanette P. Schmidt Rivi Sherman
  On the Formal Semantics of Statecharts (Extended Abstract) (LICS 1987) More Information...

Manfred Schmidt-Schauß

• Paper: Alexandre Boudet Jean-Pierre Jouannaud Manfred Schmidt-Schauß
  Unification in free extensions of Boolean rings and Abelian groups (LICS 1988) More Information...
• Paper: Adria Gascón Guillem Godoy Manfred Schmidt-Schauß
  Context Matching for Compressed Terms (LICS 2008) More Information...
• Paper: David Sabel Manfred Schmidt-Schauß
  Conservative Concurrency in Haskell (LICS 2012) More Information...
• Paper: Adria Gascón Ashish Tiwari Manfred Schmidt-Schauß
  One Context Unification Problems Solvable in Polynomial Time (LICS 2015) More Information...

Alan Schmitt

• Paper: Ivan Lanese Jorge A. Perez Davide Sangiorgi Alan Schmitt
  On the Expressiveness and Decidability of Higher-Order Process Calculi (LICS 2008) More Information...
• 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...

Sylvain Schmitz

• Paper: Diego Figueira Santiago Figueira Sylvain Schmitz Philippe Schnoebelen
  Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma (LICS 2011) More Information...
• Paper: Serge Haddad Sylvain Schmitz Philippe Schnoebelen
  The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets (LICS 2012) More Information...
• Paper: Anudhyan Boral Sylvain Schmitz
  Model-Checking Parse Trees (LICS 2013) More Information...
• Short Presentation: Sylvain Schmitz
  Complexity Hierarchies Beyond Elementary (LICS 2013) More Information...
• Paper: Ranko Lazic Sylvain Schmitz
  Non-elementary complexities for branching VASS, MELL, and extensions (LICS 2014) More Information...
• Paper: Jérôme Leroux Sylvain Schmitz
  Demystifying Reachability in Vector Addition Systems (LICS 2015) More Information...
• Paper: Ranko Lazic Sylvain Schmitz
  The Complexity of Coverability in ν-Petri Nets (LICS 2016) More Information...
• Paper: Thomas Colcombet Marcin Jurdzinski Ranko Lazic Sylvain Schmitz
  Perfect half space games (LICS 2017) More Information...
• Paper: Jérôme Leroux Sylvain Schmitz
  Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension (LICS 2019) More Information...
• Paper: Petr Jančar Sylvain Schmitz
  Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete (LICS 2019) More Information...

Robert R. Schneck

• Paper: George C. Necula Robert R. Schneck
  A Sound Framework for Untrusted Verification-Condition Generators (LICS 2003) More Information...

Michael A. Schneider

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

Fred B. Schneider

• Paper: Bowen Alpern Fred B. Schneider
  Proving Boolean Combinations of Deterministic Properties (LICS 1987) More Information...

Philippe Schnoebelen

• Paper: François Laroussinie Nicolas Markey Philippe Schnoebelen
  Temporal Logic with Forgettable Past (LICS 2002) More Information...
• Paper: Pierre Chambart Philippe Schnoebelen
  The Ordinal Recursive Complexity of Lossy Channel Systems (LICS 2008) More Information...
• Paper: Diego Figueira Santiago Figueira Sylvain Schmitz Philippe Schnoebelen
  Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma (LICS 2011) More Information...
• Paper: Serge Haddad Sylvain Schmitz Philippe Schnoebelen
  The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets (LICS 2012) More Information...
• Paper: Simon Halfon Philippe Schnoebelen Georg Zetzsche
  Decidability, complexity, and expressiveness of first-order logic over the subword ordering (LICS 2017) More Information...

Ulrich Schöpp

• Paper: Ulrich Schöpp
  Stratified Bounded Affine Logic for Logarithmic Space (LICS 2007) More Information...
• Paper: Martin Hofmann Ulrich Schöpp
  Pointer Programs and Undirected Reachability (LICS 2009) More Information...

Tom Schrijvers

• Paper: Maciej Piróg Tom Schrijvers Nicolas Wu Mauro Jaskelioff
  Syntax and Semantics for Operations with Scopes (LICS 2018) More Information...

Lutz Schröder

• Paper: Lutz Schröder Dirk Pattinson
  PSPACE reasoning for coalgebraic modal logic (LICS 2006) More Information...
• Paper: Sergey Goncharov Lutz Schröder
  Powermonads and Tensors of Unranked Effects (LICS 2011) More Information...
• Paper: Sergey Goncharov Lutz Schröder
  A Relatively Complete Generic Hoare Logic for Order-Enriched Effects (LICS 2013) More Information...
• Paper: Dirk Pattinson Lutz Schröder
  Program Equivalence is Coinductive (LICS 2016) More Information...
• Paper: Paul Wild Lutz Schröder Dirk Pattinson Barbara König
  A van Benthem Theorem for Fuzzy Modal Logic (LICS 2018) More Information...

Peter Schroeder-Heister

• Paper: Peter Schroeder-Heister
  Rules of definitional reflection (LICS 1993) More Information...

Matthias Schröder

• Paper: Matthias Schröder Florian Steinberg
  Bounded time computation on metric spaces and Banach spaces (LICS 2017) More Information...

Lutz Schröder

• Paper: Henning Urbat Lutz Schröder
  Automata Learning: An Algebraic Approach (LICS 2020) More Information...
• Paper: Chase Ford Stefan Milius Lutz Schröder
  Behavioural Preorders via Graded Monads (LICS 2021) More Information...
• Paper: Chase Ford Stefan Milius Lutz Schröder Harsh Beohar Barbara König
  Graded Monads and Behavioural Equivalence Games (LICS 2022) More Information...

Paul E. Schupp

• Paper: Dominique Perrin Paul E. Schupp
  Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (LICS 1986) More Information...
• Paper: David E. Muller Ahmed Saoudi Paul E. Schupp
  Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time (LICS 1988) More Information...

Carsten Schürmann

• Paper: Carsten Schürmann Jeffrey Sarnat
  Structural Logical Relations (LICS 2008) More Information...

Peter Schuster

• Paper: Peter Schuster
  Induction in Algebra: A First Case Study (LICS 2012) More Information...
• Paper: Peter Schuster Daniel Wessel
  Resolving finite indeterminacy: A definitive constructive universal prime ideal theorem (LICS 2020) More Information...

Grigori Schwarz

• Paper: Grigori Schwarz
  Minimal model semantics for nonmonotonic modal logics (LICS 1992) More Information...

Nicole Schweikardt

• Paper: David A. Mix Barrington Neil Immerman Clemens Lautemann Nicole Schweikardt Denis Thérien
  The Crane Beach Conjecture (LICS 2001) More Information...
• Paper: Martin Grohe Nicole Schweikardt
  The Succinctness of First-Order Logic on Linear Orders (LICS 2004) More Information...
• Paper: Anuj Dawar Martin Grohe Stephan Kreutzer Nicole Schweikardt
  Approximation Schemes for First-Order Definable Optimization Problems (LICS 2006) More Information...
• Paper: Nicole Schweikardt Luc Segoufin
  Addition-Invariant FO and Regularity (LICS 2010) More Information...
• Paper: Lucas Heimberg Dietrich Kuske Nicole Schweikardt
  An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree (LICS 2013) More Information...
• Paper: Frederik Harwath Lucas Heimberg Nicole Schweikardt
  Preservation and decomposition theorems for bounded degree structures (LICS 2014) More Information...
• Paper: Stephan Kreutzer Nicole Schweikardt
  On Hanf-equivalence and the number of embeddings of small induced subgraphs (LICS 2014) More Information...
• Paper: Lucas Heimberg Dietrich Kuske Nicole Schweikardt
  Hanf normal form for first-order logic with unary counting quantifiers (LICS 2016) More Information...
• Paper: Dietrich Kuske Nicole Schweikardt
  First-order logic with counting (LICS 2017) More Information...
• Invited Paper: Nicole Schweikardt
  Local normal forms and their use in algorithmic meta theorems (LICS 2019) More Information...
• Paper: Nicole Schweikardt
  Local normal forms and their use in algorithmic meta theorems (Invited Talk) (LICS 2019) More Information...

Pascal Schweitzer

• Paper: Sandra Kiefer Pascal Schweitzer
  Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (LICS 2016) More Information...
• Paper: Sandra Kiefer Ilia Ponomarenko Pascal Schweitzer
  The Weisfeiler-Leman dimension of planar graphs is at most 3 (LICS 2017) More Information...
• Paper: Moritz Lichter Ilia Ponomarenko Pascal Schweitzer
  Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm (LICS 2019) More Information...
• Paper: Jendrik Brachter Pascal Schweitzer
  On the Weisfeiler-Leman Dimension of Finite Groups (LICS 2020) More Information...
• Paper: Moritz Lichter Pascal Schweitzer
  Choiceless Polynomial Time with Witnessed Symmetric Choice (LICS 2022) More Information...

Thomas Schwentick

• Paper: Michael Benedikt Leonid Libkin Thomas Schwentick Luc Segoufin
  A Model-Theoretic Approach to Regular String Relations (LICS 2001) 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...

Helmut Schwichtenberg

• Paper: Ulrich Berger Helmut Schwichtenberg
  An inverse of the evaluation functional for typed λ-calculus (LICS 1991) More Information...
• Paper: Klaus Aehlig Helmut Schwichtenberg
  A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation (LICS 2000) More Information...

Jan Schwinghammer

• Short Presentation: Manuel Bodirsky Tobias Gärtner Timo von Oertzen Jan Schwinghammer
  Computing the Density of Regular Languages (LICS 2001) 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...

Luke Sciarappa

• Paper: Benjamin Sherman Luke Sciarappa Adam Chlipala Michael Carbin
  Computable decision making on the reals and other spaces: via partiality and nondeterminism (LICS 2018) More Information...

Guido Sciavicco

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

Luis Scoccola

• Paper: Thorsten Altenkirch Luis Scoccola
  The Integers as a Higher Inductive Type (LICS 2020) More Information...

Dana S. Scott

• Invited Paper: Dana S. Scott
  Domains and logics (LICS 1989) More Information...
• Paper: Peter J. Freyd Philip Mulry Giuseppe Rosolini Dana S. Scott
  Extensional PERs (LICS 1990) More Information...
• Paper: Lars Birkedal Aurelio Carboni Giuseppe Rosolini Dana S. Scott
  Type Theory via Exact Categories (LICS 1998) More Information...

Philip J. Scott

• Paper: Peter J. Freyd Jean-Yves Girard Andre Scedrov Philip J. Scott
  Semantic parametricity in polymorphic lambda calculus (LICS 1988) More Information...
• Paper: Thorsten Altenkirch Peter Dybjer Martin Hofmann Philip J. Scott
  Normalization by Evaluation for Typed Lambda Calculus with Coproducts (LICS 2001) More Information...

Dana Scott

• Paper: Giorgio Bacci Robert Furber Dexter Kozen Radu Mardare Prakash Panangaden Dana Scott
  Boolean-Valued Semantics for the Stochastic λ-Calculus (LICS 2018) More Information...

Elizabeth Scott

• Paper: Ursula Martin Elizabeth Scott
  The order types of termination orderings on monadic terms, strings and multisets (LICS 1993) More Information...

Robert A. G. Seely

• Paper: Robert A. G. Seely
  Modelling Computations: A 2-Categorical Framework (LICS 1987) More Information...

Luc Segoufin

• Paper: Martin Grohe Luc Segoufin
  On First-Order Topological Queries (LICS 2000) More Information...
• Paper: Michael Benedikt Leonid Libkin Thomas Schwentick Luc Segoufin
  A Model-Theoretic Approach to Regular String Relations (LICS 2001) 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 Luc Segoufin Howard Straubing
  Piecewise Testable Tree Languages (LICS 2008) More Information...
• Paper: Thomas Place Luc Segoufin
  Deciding Definability in FO(<) (or XPath) on Trees (LICS 2010) More Information...
• Paper: Nicole Schweikardt Luc Segoufin
  Addition-Invariant FO and Regularity (LICS 2010) More Information...

Peter-Michael Seidel

• Paper: Dusko Pavlovic Peter-Michael Seidel
  Quotients in monadic programming: Projective algebras are equivalent to coalgebras (LICS 2017) More Information...

Helmut Seidl

• Paper: Helmut Seidl
  A Modal Mu-Calculus for Durational Transition Systems (LICS 1996) More Information...

Fatemeh Seifan

• Paper: Sebastian Enqvist Fatemeh Seifan Yde Venema
  Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras (LICS 2015) More Information...

Thomas Seiller

• Short Presentation: Thomas Seiller
  Graphs of Interaction: Additives (LICS 2012) More Information...
• Paper: Thomas Seiller
  Interaction Graphs: Full Linear Logic (LICS 2016) More Information...

R. C. Sekar

• Paper: R. C. Sekar I. V. Ramakrishnan
  Programming in equational logic: beyond strong sequentiality (LICS 1990) More Information...

Jerry Seligman

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

Peter Selinger

• Paper: Peter Selinger
  Order-Incompleteness and Finite Lambda Models, Extended Abstract (LICS 1996) More Information...
• Paper: Peng Fu Kohei Kishida Peter Selinger
  Linear Dependent Type Theory for Quantum Programming Languages: Extended Abstract (LICS 2020) More Information...

Bart Selman

• Invited Paper: Bart Selman
  Satisfiability Testing: Recent Developments and Challenge Problems (LICS 2000) More Information...

Jas Semrl

• Paper: Robin Hirsch Jas Semrl
  Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition (LICS 2021) More Information...

Géraud Sénizergues

• Paper: Yuri Matiyasevich Géraud Sénizergues
  Decision Problems for Semi-Thue Systems with a Few Rules (LICS 1996) More Information...

Amilcar Sernadas

• Short Presentation: Paulo Mateus Amilcar Sernadas
  Complete exogenous quantum propositional logic (LICS 2005) More Information...

Olivier Serre

• 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: Christopher H. Broadbent Arnaud Carayol C.-H. Luke Ong Olivier Serre
  Recursion Schemes and Logical Reflection (LICS 2010) More Information...
• Paper: Arnaud Carayol Axel Haddad Olivier Serre
  Qualitative Tree Languages (LICS 2011) More Information...
• Paper: Arnaud Carayol Olivier Serre
  Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection (LICS 2012) More Information...
• Paper: Arnaud Carayol Olivier Serre
  How Good Is a Strategy in a Game with Nature? 609-620 Albert Atserias, José L (LICS 2015) More Information...
• Paper: Arnaud Carayol Christof Löding Olivier Serre
  Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings (LICS 2016) More Information...

Frédéric Servais

• Paper: Emmanuel Filiot Olivier Gauwin Pierre-Alain Reynier Frédéric Servais
  From Two-Way to One-Way Finite State Transducers (LICS 2013) More Information...

Rocco A. Servedio

• Invited Paper: Michael O. Rabin Rocco A. Servedio Christopher Thorpe
  Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications (LICS 2007) More Information...

Sanjit A. Seshia

• Paper: Sanjit A. Seshia Randal E. Bryant
  Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds (LICS 2004) More Information...

Anil Seth

• Paper: Anil Seth
  There is no recursive axiomatization for feasible functionals of type 2 (LICS 1992) More Information...
• Paper: Anil Seth
  Some desirable conditions for feasible functionals of type 2 (LICS 1993) More Information...
• Paper: Anil Seth
  When do Fixed Point Logics Capture Complexity Classes? (LICS 1995) More Information...
• Paper: Anuj Dawar Lauri Hella Anil Seth
  Ordering Finite Variable Types with Generalized Quantifiers (LICS 1998) More Information...

Anton Setzer

• Paper: Neil Ghani Lorenzo Malatesta Fredrik Nordvall Forsberg Anton Setzer
  Fibred Data Types (LICS 2013) More Information...

Peter Sewell

• Paper: Peter Sewell
  Bisimulation is not finitely (first order) equationally axiomatisable (LICS 1994) More Information...
• Paper: Gian Luca Cattani Peter Sewell
  Models for Name-Passing Processes: Interleaving and Causal (LICS 2000) More Information...

Nihil Shah

• Paper: Yoàv Montacute Nihil Shah
  The Pebble-Relation Comonad in Finite Model Theory (LICS 2022) More Information...

Preey Shah

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

Natarajan Shankar

• Paper: Patrick Lincoln Andre Scedrov Natarajan Shankar
  Linearizing intuitionistic implication (LICS 1991) More Information...
• Paper: Patrick Lincoln Natarajan Shankar
  Proof search in first-order linear logic and other cut-free sequent calculi (LICS 1994) More Information...
• Paper: Patrick Lincoln Natarajan Shankar Andre Scedrov
  Decision Problems For Second-Order Linear Logic (LICS 1995) More Information...
• Paper: Harald Rueß Natarajan Shankar
  Deconstructing Shostak (LICS 2001) More Information...
• Invited Paper: Natarajan Shankar
  Little Engines of Proof (LICS 2002) More Information...
• Short Presentation: Jonathan Ford Ian A. Mason Natarajan Shankar
  Lessons Learned from Formal Developments in PVS (LICS 2002) More Information...

Zhong Shao

• Paper: Nadeem A. Hamid Zhong Shao Valery Trifonov Stefan Monnier Zhaozhong Ni
  A Syntactic Approach to Foundational Proof-Carrying Code (LICS 2002) More Information...
• Paper: Jan Hoffmann Michael Marmar Zhong Shao
  Quantitative Reasoning for Proving Lock-Freedom (LICS 2013) More Information...
• Paper: Hongjin Liang Xinyu Feng Zhong Shao
  Compositional verification of termination-preserving refinement of concurrent programs (LICS 2014) More Information...
• Paper: Jérémie Koenig Zhong Shao
  Refinement-Based Game Semantics for Certified Abstraction Layers (LICS 2020) More Information...

Ehud Y. Shapiro

• Paper: Rob Gerth Michael Codish Yossi Lichtenstein Ehud Y. Shapiro
  Fully abstract denotational semantics for flat Concurrent Prolog (LICS 1988) More Information...
• Paper: Haim Gaifman Ehud Y. Shapiro
  Proof theory and semantics of logic programs (LICS 1989) More Information...
• Paper: Thom W. Frühwirth Ehud Y. Shapiro Moshe Y. Vardi Eyal Yardeni
  Logic programs as types for logic programs (LICS 1991) More Information...

Aditya Sharad

• Paper: Michael Benedikt Timothy Duff Aditya Sharad James Worrell
  Polynomial automata: Zeroness and applications (LICS 2017) More Information...

Yariv Shaulian

• Paper: Udi Boker Yariv Shaulian
  Automaton-Based Criteria for Membership in CTL (LICS 2018) More Information...

Saharon Shelah

• Paper: Yuri Gurevich Neil Immerman Saharon Shelah
  McColm's conjecture [positive elementary inductions] (LICS 1994) More Information...
• Paper: Yuri Gurevich Saharon Shelah
  Spectra of Monadic Second-Order Formulas with One Unary Function (LICS 2003) More Information...

Noam Shenwald

• Paper: Orna Kupferman Noam Shenwald
  Perspective Multi-Player Games (LICS 2021) More Information...

Benjamin Sherman

• Paper: Benjamin Sherman Luke Sciarappa Adam Chlipala Michael Carbin
  Computable decision making on the reals and other spaces: via partiality and nondeterminism (LICS 2018) More Information...

Rivi Sherman

• Paper: David Harel Amir Pnueli Jeanette P. Schmidt Rivi Sherman
  On the Formal Semantics of Statecharts (Extended Abstract) (LICS 1987) More Information...

Nikolay Shilov

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

Mahsa Shirmohammadi

• Paper: Karin Quaas Mahsa Shirmohammadi James Worrell
  Revisiting reachability in timed automata (LICS 2017) More Information...
• Paper: Stefan Kiefer Richard Mayr Mahsa Shirmohammadi Dominik Wojtczak
  Parity objectives in countable MDPs (LICS 2017) More Information...
• Paper: Stefan Kiefer Richard Mayr Mahsa Shirmohammadi Dominik Wojtczak
  On strong determinacy of countable stochastic games (LICS 2017) More Information...
• Paper: Nikhil Balaji Klara Nosan Mahsa Shirmohammadi James Worrell
  Identity Testing for Radical Expressions (LICS 2022) More Information...

Vitaly Shmatikov

• Paper: Hubert Comon-Lundh Vitaly Shmatikov
  Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or (LICS 2003) More Information...

Sharon Shoham

• Paper: Sharon Shoham Orna Grumberg
  3-Valued Abstraction: More Precision at Less Cost (LICS 2006) More Information...

Yoav Shoham

• Paper: Joseph Y. Halpern Yoav Shoham
  A Propositional Model Logic of Time Intervals (LICS 1986) More Information...
• Paper: Yoav Shoham
  A Semantical Approach to Nonmonotonic Logics (LICS 1987) More Information...

Richard A. Shore

• Paper: Joseph Y. Halpern Richard A. Shore
  Reasoning About Common Knowledge with Infinitely Many Agents (LICS 1999) More Information...

Michael Shulman

• Paper: Daniel R. Licata Michael Shulman
  Calculating the Fundamental Group of the Circle in Homotopy Type Theory (LICS 2013) More Information...
• Paper: Benedikt Ahrens Paige Randall North Michael Shulman Dimitris Tsementzis
  A Higher Structure Identity Principle (LICS 2020) More Information...
• Paper: John C. Baez Fabrizio Genovese Jade Master Michael Shulman
  Categories of Nets (LICS 2021) More Information...

Jon Shultis

• Paper: Jon Shultis
  The Design and Implementations of Intuit (LICS 1986) More Information...

Salomon Sickert

• Paper: Javier Esparza Jan Kretínský Salomon Sickert
  One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata (LICS 2018) More Information...
• Paper: Salomon Sickert Javier Esparza
  An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata (LICS 2020) More Information...

Sebastian Siebertz

• Paper: Viktor Engelmann Stephan Kreutzer Sebastian Siebertz
  First-Order and Monadic Second-Order Model-Checking on Ordered Structures (LICS 2012) More Information...
• Paper: Jan van den Heuvel Stephan Kreutzer Michal Pilipczuk Daniel A. Quiroz Roman Rabinovich Sebastian Siebertz
  Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion (LICS 2017) More Information...
• Paper: Michal Pilipczuk Sebastian Siebertz Szymon Torunczyk
  Parameterized circuit complexity of model-checking on sparse structures (LICS 2018) More Information...
• Paper: Michal Pilipczuk Sebastian Siebertz Szymon Torunczyk
  On the number of types in sparse graphs (LICS 2018) More Information...

Joseph Sifakis

• Paper: Thomas A. Henzinger Xavier Nicollin Joseph Sifakis Sergio Yovine
  Symbolic model checking for real-time systems (LICS 1992) More Information...
• Paper: Ahmed Bouajjani Rachid Echahed Joseph Sifakis
  On model checking for real-time properties with durations (LICS 1993) More Information...

Vincent Siles

• Paper: Vincent Siles Hugo Herbelin
  Equality is Typable in Semi-Full Pure Type Systems (LICS 2010) More Information...

Alexandra Silva

• Paper: Marcello Bonsangue Jan Rutten Alexandra Silva
  An Algebra for Kripke Polynomial Coalgebras (LICS 2009) More Information...
• Paper: Jialu Bao Simon Docherty Justin Hsu Alexandra Silva
  A Bunched Logic for Conditional Independence (LICS 2021) More Information...

Nadish de Silva

• Paper: Nadish de Silva
  Logical paradoxes in quantum computation (LICS 2018) More Information...

Mantas Simkus

• Paper: Tomer Kotek Mantas Simkus Helmut Veith Florian Zuleger
  Extending ALCQIO with Trees (LICS 2015) More Information...

Robert J. Simmons

• Paper: Frank Pfenning Robert J. Simmons
  Substructural Operational Semantics as Ordered Logic Programming (LICS 2009) More Information...
• Short Presentation: Robert J. Simmons Ian Zerny
  A Logical Correspondence between Natural Semantics and Abstract Machines (LICS 2013) More Information...

Pierre Simon

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

Alex K. Simpson

• Paper: Alex K. Simpson
  Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS (LICS 1995) More Information...
• Paper: Alex K. Simpson
  Elementary Axioms for Categories of Classes (LICS 1999) More Information...
• Paper: Alex K. Simpson Gordon D. Plotkin
  Complete Axioms for Categorical Fixed-Point Operators (LICS 2000) More Information...
• Paper: Martín H. Escardó Alex K. Simpson
  A Universal Characterization of the Closed Euclidean Interval (LICS 2001) More Information...
• Paper: Alex K. Simpson
  Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory (LICS 2002) More Information...
• Paper: James Brotherston Alex K. Simpson
  Complete Sequent Calculi for Induction and Infinite Descent (LICS 2007) More Information...
• Paper: Rasmus E. Møgelberg Alex K. Simpson
  Relational Parametricity for Computational Effects (LICS 2007) More Information...
• Paper: Patricia Johann Alex K. Simpson Janis Voigtländer
  A Generic Operational Metatheory for Algebraic Effects (LICS 2010) More Information...

Parag Singla

• Invited Paper: Pedro M. Domingos Daniel Lowd Stanley Kok Aniruddh Nath Hoifung Poon Matthew Richardson Parag Singla
  Unifying Logical and Statistical AI (LICS 2016) More Information...

A. Prasad Sistla

• Paper: A. Prasad Sistla Steven M. German
  Reasoning with Many Processes (LICS 1987) More Information...
• Paper: A. Prasad Sistla Lenore D. Zuck
  On the Eventuality Operator in Temporal Logic (LICS 1987) More Information...
• Paper: Rohit Chadha A. Prasad Sistla Mahesh Viswanathan
  On the Expressiveness and Complexity of Randomization in Finite State Monitors (LICS 2008) More Information...
• Paper: Stefan Kiefer A. Prasad Sistla
  Distinguishing Hidden Markov Chains (LICS 2016) More Information...
• Paper: Rohit Chadha A. Prasad Sistla Mahesh Viswanathan
  Verification of randomized security protocols (LICS 2017) 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: Rohit Chadha A. Prasad Sistla Mahesh Viswanathan
  On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs (LICS 2021) More Information...

Michal Skrzypczak

• Paper: Alessandro Facchini Filip Murlak Michal Skrzypczak
  Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata (LICS 2013) More Information...
• Paper: Mikolaj Bojanczyk Edon Kelmendi Michal Skrzypczak
  MSO+nabla is undecidable (LICS 2019) More Information...
• Paper: Grzegorz Fabianski Michal Skrzypczak Szymon Torunczyk
  Uniformisations of Regular Relations Over Bi-Infinite Words (LICS 2020) More Information...

Giora Slutzki

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

Scott F. Smith

• Paper: Robert L. Constable Scott F. Smith
  Partial Objects In Constructive Type Theory (LICS 1987) More Information...
• Paper: Robert L. Constable Scott F. Smith
  Computational foundations of basic recursive function theory (LICS 1988) More Information...

Jan M. Smith

• Paper: Anne Salvesen Jan M. Smith
  The strength of the subset type in Martin-Löf's type theory (LICS 1988) More Information...

Geoffrey Smith

• Paper: Geoffrey Smith
  Recent Developments in Quantitative Information Flow (Invited Tutorial) (LICS 2015) More Information...

Scott A. Smolka

• Paper: Rob J. van Glabbeek Scott A. Smolka Bernhard Steffen Chris M. N. Tofts
  Reactive, generative, and stratified models of probabilistic processes (LICS 1990) More Information...
• Paper: Shipei Zhang Oleg Sokolsky Scott A. Smolka
  On the parallel complexity of model checking in the modal mu-calculus (LICS 1994) More Information...
• Paper: Eugene W. Stark Scott A. Smolka
  Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata (LICS 1998) More Information...

Wayne Snyder

• Paper: Jean H. Gallier Stan Raatz Wayne Snyder
  Theorem Proving Using Rigid E-Unification Equational Matings (LICS 1987) More Information...
• Paper: Jean H. Gallier Wayne Snyder Paliath Narendran David A. Plaisted
  Rigid E-unification is NP-complete (LICS 1988) More Information...

Pawel Sobocinski

• Paper: Vladimiro Sassone Pawel Sobocinski
  Reactive Systems over Cospans (LICS 2005) More Information...
• Paper: Brendan Fong Pawel Sobocinski Paolo Rapisarda
  A categorical approach to open and interconnected dynamical systems (LICS 2016) 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 Robin Piedeleu Pawel Sobocinski Fabio Zanasi
  Graphical Affine Algebra (LICS 2019) More Information...

Kristina Sojakova

• Paper: Steven Awodey Nicola Gambino Kristina Sojakova
  Inductive Types in Homotopy Type Theory (LICS 2012) More Information...
• Paper: Kristina Sojakova Patricia Johann
  A General Framework for Relational Parametricity (LICS 2018) More Information...
• Paper: Kristina Sojakova Floris van Doorn Egbert Rijke
  Sequential Colimits in Homotopy Type Theory (LICS 2020) More Information...
• Paper: Kristina Sojakova G. A. Kavvos
  Syllepsis in Homotopy Type Theory (LICS 2022) More Information...

Ana Sokolova

• Paper: Filippo Bonchi Ana Sokolova Valeria Vignudelli
  The Theory of Traces for Systems with Nondeterminism and Probability (LICS 2019) More Information...

Oleg Sokolsky

• Paper: Shipei Zhang Oleg Sokolsky Scott A. Smolka
  On the parallel complexity of model checking in the modal mu-calculus (LICS 1994) More Information...

Sylvain Soliman

• Paper: François Fages Paul Ruet Sylvain Soliman
  Phase Semantics and Verification of Concurrent Constraint Programs (LICS 1998) More Information...
• Short Presentation: Sylvain Soliman
  CLP Implementation of a Phase Model Checker (LICS 2002) More Information...

Sergei Soloviev

• Paper: Giuseppe Longo Kathleen Milsted Sergei Soloviev
  The genericity theorem and the notion of parametricity in the polymorphic λ-calculus (LICS 1993) More Information...
• Paper: Giuseppe Longo Kathleen Milsted Sergei Soloviev
  A logic of subtyping (LICS 1995) More Information...

Michael Soltys

• Paper: Michael Soltys Stephen A. Cook
  The Proof Complexity of Linear Algebra (LICS 2002) More Information...
• Short Presentation: Ariel Fernández Michael Soltys
  Feasible combinatorial matrix theory (Polytime proofs for König's Min-Max and related theorems) (LICS 2013) More Information...

Lei Song

• Paper: Joost-Pieter Katoen Lei Song Lijun Zhang
  Probably safe or live (LICS 2014) More Information...

Matthieu Sozeau

• Paper: Guilhem Jaber Nicolas Tabareau Matthieu Sozeau
  Extending Type Theory with Forcing (LICS 2012) More Information...
• Paper: Guilhem Jaber Gabriel Lewertowski Pierre-Marie Pédrot Matthieu Sozeau Nicolas Tabareau
  The Definitional Side of the Forcing (LICS 2016) More Information...
• Paper: Eric Finster Antoine Allioux Matthieu Sozeau
  Types Are Internal ∞-Groupoids (LICS 2021) More Information...

Frances Spalding

• Paper: Limin Jia Frances Spalding David Walker Neal Glew
  Certifying Compilation for a Language with Stack Allocation (LICS 2005) More Information...

Sam Speight

• Paper: Steve Awodey Jonas Frey Sam Speight
  Impredicative Encodings of (Higher) Inductive Types (LICS 2018) More Information...

David I. Spivak

• Paper: Brendan Fong David I. Spivak Rémy Tuyéras
  Backprop as Functor: A compositional perspective on supervised learning (LICS 2019) More Information...

Arnaud Spiwack

• Paper: Thierry Coquand Arnaud Spiwack
  Proof of strong normalisation using domain theory (LICS 2006) More Information...

Christoph Sprenger

• Invited Paper: Christoph Sprenger David A. Basin
  Cryptographically-Sound Protocol-Model Abstractions (LICS 2008) More Information...

David Sprunger

• Paper: David Sprunger Shin-ya Katsumata
  Differentiable Causal Computations via Delayed Trace (LICS 2019) More Information...

A. V. Sreejith

• Paper: Andreas Krebs A. V. Sreejith
  Non-definability of Languages by Generalized First-order Formulas over (N, +) (LICS 2012) More Information...
• Paper: Bharat Adsul Saptarshi Sarkar A. V. Sreejith
  Block products for algebras over countable words and applications to logic (LICS 2019) More Information...

Jai Srinivasan

• Paper: E. Allen Emerson Michael Evangelist Jai Srinivasan
  On the limits of efficient temporal decidability (LICS 1990) More Information...

B. Srivathsan

• Paper: Frédéric Herbreteau B. Srivathsan Igor Walukiewicz
  Better Abstractions for Timed Automata (LICS 2012) More Information...
• Paper: R. Govind Frédéric Herbreteau B. Srivathsan Igor Walukiewicz
  Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods (LICS 2022) More Information...

Eugene W. Stark

• Paper: Eugene W. Stark
  A calculus of dataflow networks (LICS 1992) More Information...
• Paper: Eugene W. Stark Scott A. Smolka
  Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata (LICS 1998) More Information...

Ian D. B. Stark

• Paper: Ian D. B. Stark
  A Fully Abstract Domain Model for the pi-Calculus (LICS 1996) 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...

Richard Statman

• Paper: Richard Statman
  On Translating Lambda Terms into Combinators; The Basis Problem (LICS 1986) More Information...
• Paper: Richard Statman
  Freyd's hierarchy of combinator monoids (LICS 1991) More Information...
• Paper: Ugo de'Liguoro Adolfo Piperno Richard Statman
  Retracts in simply type λβη-calculus (LICS 1992) More Information...
• Paper: Paliath Narendran Frank Pfenning Richard Statman
  On the unification problem for Cartesian closed categories (LICS 1993) More Information...
• Paper: Richard Statman
  On the lambda Y calculus (LICS 2002) More Information...
• Paper: Benedetto Intrigila Richard Statman
  The Omega Rule is II_2^0-Hard in the λβ-Calculus (LICS 2004) More Information...

Sam Staton

• Paper: Marcelo P. Fiore Sam Staton
  A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics (LICS 2006) More Information...
• Paper: Sam Staton
  General Structural Operational Semantics through Categorical Logic (LICS 2008) More Information...
• Paper: Sam Staton Glynn Winskel
  On the Expressivity of Symmetry in Event Structures (LICS 2010) More Information...
• Paper: Sam Staton
  Instances of Computational Effects: An Algebraic Perspective (LICS 2013) More Information...
• Paper: Marcelo P. Fiore Sam Staton
  Substitution, jumps, and algebraic effects (LICS 2014) More Information...
• Paper: Paul Blain Levy Sam Staton
  Transition systems over games (LICS 2014) More Information...
• Paper: Sam Staton Hongseok Yang Frank Wood Chris Heunen Ohad Kammar
  Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints (LICS 2016) More Information...
• Paper: Ohad Kammar Paul Blain Levy Sean K. Moss Sam Staton
  A monad for full ground reference cells (LICS 2017) More Information...
• Paper: Chris Heunen Ohad Kammar Sam Staton Hongseok Yang
  A convenient category for higher-order probability theory (LICS 2017) More Information...
• Paper: Mathieu Huot Sam Staton
  Quantum channels as a categorical completion (LICS 2019) More Information...
• Paper: Dario Stein Sam Staton
  Compositional Semantics for Probabilistic Programs with Exact Conditioning (LICS 2021) More Information...
• Paper: Cristina Matache Sean K. Moss Sam Staton
  Concrete categories and higher-order recursion: With applications including probability, differentiability, and full abstraction (LICS 2022) More Information...

Hugh Steele

• Paper: Andrea Schalk Hugh Steele
  Constructing Fully Complete Models for Multiplicative Linear Logic (LICS 2012) More Information...

Léo Stefanesco

• Paper: Paul-André Melliès Léo Stefanesco
  An Asynchronous Soundness Theorem for Concurrent Separation Logic (LICS 2018) More Information...
• Paper: Paul-André Melliès Léo Stefanesco
  Concurrent Separation Logic Meets Template Games (LICS 2020) More Information...

Andrei Stefanescu

• Paper: Grigore Rosu Andrei Stefanescu Stefan Ciobaca Brandon M. Moore
  One-Path Reachability Logic (LICS 2013) More Information...

Rafal Stefanski

• Paper: Mikolaj Bojanczyk Edon Kelmendi Rafal Stefanski Georg Zetzsche
  Extensions of ω-Regular Languages (LICS 2020) More Information...

Kjartan Stefánsson

• Paper: Kjartan Stefánsson
  Systems of set constraints with negative constraints are NEXPTIME-complete (LICS 1994) More Information...

Bernhard Steffen

• Paper: Rob J. van Glabbeek Scott A. Smolka Bernhard Steffen Chris M. N. Tofts
  Reactive, generative, and stratified models of probabilistic processes (LICS 1990) More Information...
• Paper: Rance Cleaveland Bernhard Steffen
  When is `partial' adequate? A logic-based proof technique using partial specifications (LICS 1990) More Information...

Dario Stein

• Paper: Dario Stein Sam Staton
  Compositional Semantics for Probabilistic Programs with Exact Conditioning (LICS 2021) More Information...

Florian Steinberg

• Paper: Akitoshi Kawamura Florian Steinberg Martin Ziegler
  Complexity Theory of (Functions on) Compact Metric Spaces (LICS 2016) More Information...
• Paper: Matthias Schröder Florian Steinberg
  Bounded time computation on metric spaces and Banach spaces (LICS 2017) More Information...
• Paper: Bruce M. Kapron Florian Steinberg
  Type-two polynomial-time and restricted lookahead (LICS 2018) More Information...

Jari Stenman

• Paper: Parosh A. Abdulla Mohamed Faouzi Atig Jari Stenman
  Dense-Timed Pushdown Automata (LICS 2012) More Information...

Frank Stephan

• Paper: Bakhadyr Khoussainov Sasha Rubin Frank Stephan
  On Automatic Partial Orders (LICS 2003) More Information...
• Paper: Bakhadyr Khoussainov André Nies Sasha Rubin Frank Stephan
  Automatic Structures: Richness and Limitations (LICS 2004) More Information...
• Paper: Sanjay Jain Alexei Miasnikov Frank Stephan
  The Complexity of Verbal Languages over Groups (LICS 2012) More Information...

Jonathan Sterling

• Paper: Jonathan Sterling Robert Harper
  Guarded Computational Type Theory (LICS 2018) More Information...
• Paper: Jonathan Sterling Carlo Angiuli
  Normalization for Cubical Type Theory (LICS 2021) More Information...

Colin Stirling

• Paper: Hans Hüttel Colin Stirling
  Actions speak louder than words: proving bisimilarity for context-free processes (LICS 1991) More Information...
• Paper: Henrik R. Andersen Colin Stirling Glynn Winskel
  A compositional proof system for the modal μ-calculus (LICS 1994) More Information...
• Paper: Martin Lange Colin Stirling
  Focus Games for Satisfiability and Completeness of Temporal Logic (LICS 2001) More Information...
• Invited Paper: Colin Stirling
  Higher-Order Matching, Games and Automata (LICS 2007) More Information...

Mariëlle Stoelinga

• Paper: Luca de Alfaro Rupak Majumdar Vishwanath Raman Mariëlle Stoelinga
  Game Relations and Metrics (LICS 2007) More Information...

Alexei P. Stolboushkin

• Paper: Alexei P. Stolboushkin
  Some complexity bounds for dynamic logics (LICS 1989) More Information...
• Paper: Alexei P. Stolboushkin
  Axiomatizable classes of finite models and definability of linear order (LICS 1992) More Information...
• Paper: Damian Niwinski Alexei P. Stolboushkin
  y=2x vs. y=3x (LICS 1993) More Information...
• Paper: Alexei P. Stolboushkin
  Finitely Monotone Properties (LICS 1995) More Information...

Scott D. Stoller

• Paper: Scott D. Stoller
  A Bound on Attacks on Payment Protocols (LICS 2001) More Information...

Viggo Stoltenberg-Hansen

• Paper: Erik Palmgren Viggo Stoltenberg-Hansen
  Logically Presented Domains (LICS 1995) More Information...

Allen Stoughton

• Paper: Allen Stoughton
  Parallel PCF has a unique extensional model (LICS 1991) More Information...

Lutz Straßburger

• Paper: François Lamarche Lutz Straßburger
  Constructing Free Boolean Categories (LICS 2005) More Information...
• Paper: Alessio Guglielmi Tom Gundersen Lutz Straßburger
  Breaking Paths in Atomic Flows for Classical Logic (LICS 2010) More Information...
• Short Presentation: Stefan Hetzl Lutz Straßburger
  Herbrand-Confluence for Cut Elimination in Classical First-Order Logic (LICS 2012) More Information...
• Paper: Nicolas Guenot Lutz Straßburger
  Symmetric normalisation for intuitionistic logic (LICS 2014) More Information...
• Paper: Heijltjes Dominic J. D. Hughes Lutz Straßburger
  Intuitionistic proofs without syntax (LICS 2019) More Information...
• Paper: Matteo Acclavio Ross Horne Lutz Straßburger
  Logic Beyond Formulas: A Proof System on Graphs (LICS 2020) More Information...
• Paper: Dominic J. D. Hughes Lutz Straßburger Jui-Hsuan Wu
  Combinatorial Proofs and Decomposition Theorems for First-order Logic (LICS 2021) More Information...

Howard Straubing

• Paper: Laura Chaubard Jean-Eric Pin Howard Straubing
  First order formulas with modular predicates (LICS 2006) 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: Andreas Krebs Kamal Lodaya Paritosh K. Pandya Howard Straubing
  Two-variable Logic with a Between Relation (LICS 2016) More Information...
• Paper: Michael Hahn Andreas Krebs Howard Straubing
  Wreath Products of Distributive Forest Algebras (LICS 2018) More Information...

Thomas Streicher

• Paper: Yves Lafont Thomas Streicher
  Games semantics for linear logic (LICS 1991) More Information...
• Paper: Martin Hofmann Thomas Streicher
  The groupoid model refutes uniqueness of identity proofs (LICS 1994) More Information...
• Paper: Thorsten Altenkirch Martin Hofmann Thomas Streicher
  Reduction-free normalisation for a polymorphic system (LICS 1996) More Information...
• Paper: Martín H. Escardó Thomas Streicher
  Induction and recursion on the partial real line via biquotients of bifree algebras (LICS 1997) More Information...
• Paper: Martin Hofmann Thomas Streicher
  Continuation models are universal for lambda-mu-calculus (LICS 1997) More Information...
• Paper: Michael Marz Alexander Rohr Thomas Streicher
  Full Abstraction and Universality via Realisability (LICS 1999) More Information...
• Paper: Bernhard Reus Thomas Streicher
  Semantics and Logic of Object Calculi (LICS 2002) More Information...

Pierre-Yves Strub

• Short Presentation: Pierre-Yves Strub Qian Wang
  Coq Modulo Theory (LICS 2010) More Information...
• 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...
• Paper: Gilles Barthe Marco Gaboardi Benjamin Grégoire Justin Hsu Pierre-Yves Strub
  Proving Differential Privacy via Probabilistic Couplings (LICS 2016) More Information...

Peter J. Stuckey

• Paper: Peter J. Stuckey
  Constructive negation for constraint logic programming (LICS 1991) More Information...

Aaron Stump

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

Thomas Sturm

• Paper: Thomas Sturm Marco Voigt Christoph Weidenbach
  Deciding First-Order Satisfiability when Universal and Existential Variables are Separated (LICS 2016) More Information...

Robert F. Stärk

• Paper: Robert F. Stärk
  The declarative semantics of the Prolog selection rule (LICS 1994) More Information...

Kristian Støvring

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

Ramesh Subrahmanyam

• Paper: Daniel J. Dougherty Ramesh Subrahmanyam
  Equality Between Functionals in the Presence of Coproducts (LICS 1995) More Information...

Dan Suciu

• Paper: Noga Alon Tova Milo Frank Neven Dan Suciu Victor Vianu
  Typechecking XML Views of Relational Databases (LICS 2001) More Information...

Kohei Suenaga

• Short Presentation: Kohei Suenaga Ichiro Hasuo
  Programming with Infinitesi- mals: A WHILE-Language for Hybrid System Modeling (LICS 2011) More Information...

Eijiro Sumii

• Paper: Davide Sangiorgi Naoki Kobayashi Eijiro Sumii
  Environmental Bisimulations for Higher-Order Languages (LICS 2007) More Information...
• Paper: Adrien Piérard Eijiro Sumii
  A Higher-Order Distributed Calculus with Name Creation (LICS 2012) More Information...

Mikko Suonio

• Short Presentation: Anuj Dawar Lauri Hella Mikko Suonio
  On Abiteboul-Vianu Theorem for Fixed-Point Logics with Generalized Quantifiers (LICS 2004) More Information...

Dimitri Surinx

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

Grégoire Sutre

• Paper: Jérôme Leroux Vincent Penelle Grégoire Sutre
  On the Context-Freeness Problem for Vector Addition Systems (LICS 2013) More Information...
• Paper: Jérôme Leroux M. Praveen Grégoire Sutre
  Hyper-Ackermannian bounds for pushdown vector addition systems (LICS 2014) More Information...

Alexander Svozil

• Paper: Krishnendu Chatterjee Wolfgang Dvorák Monika Henzinger Alexander Svozil
  Symbolic Time and Space Tradeoffs for Probabilistic Verification (LICS 2021) More Information...

Stefan Szeider

• Paper: Simone Bova Robert Ganian Stefan Szeider
  Model checking existential logic on partially ordered sets (LICS 2014) More Information...

Wieslaw Szwast

• Paper: Leszek Pacholski Wieslaw Szwast
  On the 0-1 law for the class of existential second order minimal Godel sentences with equality (LICS 1991) More Information...
• Paper: Leszek Pacholski Wieslaw Szwast Lidia Tendera
  Complexity of Two-Variable Logic with Counting (LICS 1997) More Information...
• Paper: Wieslaw Szwast Lidia Tendera
  On the Decision Problem for the Guarded Fragment with Transitivity (LICS 2001) More Information...