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:

• Grzegorz Fabianski
• Alessandro Facchini
• Marco Faella
• François Fages
• Claudia Faggian
• Ronald Fagin
• Uli Fahrenberg
• Moreno Falaschi
• Azadeh Farzan
• Leona F. Fass
• Giordano Favro
• Guy Fayolle
• John Fearnley
• Tomás Feder
• Solomon Feferman
• Anita Feferman
• Cristina Feier
• Joan Feigenbaum
• Giovanni de Felice
• Matthias Felleisen
• Thomas Feller
• Edward W. Felten
• Amy Felty
• Xinyu Feng
• Hugo Férée
• Jérôme Feret
• Christian G. Fermüller
• Natasha Fernandes
• David Fernández-Duque
• Maribel Fernández
• Ariel Fernández
• R. Tim P. Fernando
• Francisco Ferreira
• Thomas Ferrère
• Raul Fervari
• Johannes Klaus Fichte
• Diego Figueira
• Santiago Figueira
• Nathanaël Fijalkow
• Emmanuel Filiot
• Gilberto Filé
• Bernd Finkbeiner
• Alain Finkel
• Eric Finster
• Marcelo P. Fiore
• Eldar Fischer
• Jasmin Fisher
• Kathleen Fisher
• Melvin Fitting
• Cormac Flanagan
• Jörg Flum
• Wan Fokkink
• Wan J. Fokkink
• Stephan Foldes
• Enno Folkerts
• Fedor V. Fomin
• Brendan Fong
• Gaëlle Fontaine
• Walter Fontana
• Jonathan Ford
• Chase Ford
• Vojtech Forejt
• Simon Forest
• Cédric Fournet
• Jonathan Fowler
• Robert Fraser
• Matthew Fredrikson
• Matt Fredrikson
• Olle Fredriksson
• Cameron E. Freer
• Fabian Frei
• Adam Freilich
• Teodoro Freund
• Jonas Frey
• Peter J. Freyd
• Marcelo F. Frias
• Laurent Fribourg
• Markus Frick
• Marlin Frickenschmidt
• Dror Fried
• Harvey M. Friedman
• Nir Friedman
• Daniel P. Friedman
• Oliver Friedmann
• Alain Frisch
• Christine Froidevaux
• Dan Frumin
• Thom W. Frühwirth
• Peng Fu
• Carsten Fuhs
• Florian Funke
• Robert Furber
• Carsten Führmann

Grzegorz Fabianski

• Paper: Grzegorz Fabianski Michal Skrzypczak Szymon Torunczyk
  Uniformisations of Regular Relations Over Bi-Infinite Words (LICS 2020) More Information...

Alessandro Facchini

• Paper: Alessandro Facchini Yde Venema Fabio Zanasi
  A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus (LICS 2013) More Information...
• Paper: Alessandro Facchini Filip Murlak Michal Skrzypczak
  Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata (LICS 2013) More Information...
• Paper: Facundo Carreiro Alessandro Facchini Yde Venema Fabio Zanasi
  Weak MSO: automata and expressiveness modulo bisimilarity (LICS 2014) More Information...

Marco Faella

• Paper: Marco Faella Salvatore La Torre Aniello Murano
  Dense Real-time Games (LICS 2002) More Information...

François Fages

• Paper: François Fages Paul Ruet Sylvain Soliman
  Phase Semantics and Verification of Concurrent Constraint Programs (LICS 1998) More Information...

Claudia Faggian

• Short Presentation: Claudia Faggian
  Ludics Dynamics: Designs and Interactive Observability (LICS 2002) More Information...
• Short Presentation: Claudia Faggian Francois Maurel
  Ludics on Graphs. Towards Concurrency (LICS 2004) More Information...
• Paper: Claudia Faggian Francois Maurel
  Ludics Nets, a game Model of Concurrent Interaction (LICS 2005) More Information...
• Short Presentation: Mauro Piccolo Claudia Faggian
  Ludics, Game Semantics and Concurrency (LICS 2007) More Information...
• Paper: Michele Basaldella Claudia Faggian
  Ludics with Repetitions (Exponentials, Interactive Types and Completeness) (LICS 2009) More Information...
• Paper: Ugo Dal Lago Claudia Faggian Ichiro Hasuo Akira Yoshimizu
  The geometry of synchronization (LICS 2014) More Information...
• Paper: Ugo Dal Lago Claudia Faggian Benoît Valiron Akira Yoshimizu
  Parallelism and Synchronization in an Infinitary Context (LICS 2015) More Information...
• Paper: Claudia Faggian Simona Ronchi della Rocca
  Lambda Calculus and Probabilistic Computation (LICS 2019) More Information...
• Paper: Francesco Gavazzo Claudia Faggian
  A Relational Theory of Monadic Rewriting Systems, Part I (LICS 2021) More Information...

Ronald Fagin

• Paper: Ronald Fagin Joseph Y. Halpern
  I'm OK if You're OK: On the Notion of Trusting Communication (LICS 1987) More Information...
• Paper: Ronald Fagin Joseph Y. Halpern Nimrod Megiddo
  A logic for reasoning about probabilities (LICS 1988) More Information...
• Invited Paper: Ronald Fagin
  Logic, Complexity, and Games (LICS 2000) More Information...
• Paper: Ronald Fagin Jonathan Lenchner Kenneth W. Regan Nikhil Vyas
  Multi-Structural Games and Number of Quantifiers (LICS 2021) More Information...

Uli Fahrenberg

• Short Presentation: Uli Fahrenberg Axel Legay
  History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps (LICS 2013) More Information...

Moreno Falaschi

• Paper: Moreno Falaschi Maurizio Gabbrielli Kim Marriott Catuscia Palamidessi
  Compositional analysis for concurrent constraint programming (LICS 1993) More Information...

Azadeh Farzan

• Paper: Azadeh Farzan Zachary Kincaid Andreas Podelski
  Proving Liveness of Parameterized Programs (LICS 2016) More Information...

Leona F. Fass

• Short Presentation: Leona F. Fass
  A Logical Look at Agents' Problem-Solving on the Semantic Web (LICS 2006) More Information...

Giordano Favro

• Paper: Antonino Salibra Giulio Manzonetto Giordano Favro
  Factor Varieties and Symbolic Computation (LICS 2016) More Information...

Guy Fayolle

• Paper: Guy Fayolle Stéphane Grumbach Chritophe Tollu
  Asymptotic probabilities of languages with generalized quantifiers (LICS 1993) More Information...

John Fearnley

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

Tomás Feder

• Paper: Tomás Feder Moshe Y. Vardi
  Homomorphism Closed vs. Existential Positive (LICS 2003) More Information...

Solomon Feferman

• Invited Paper: Solomon Feferman
  Tarski's Influence on Computer Science (LICS 2005) More Information...

Anita Feferman

• Invited Paper: Anita Feferman
  The Saga of Alfred Tarski: From Warszawa to Berkeley (LICS 1997) More Information...

Cristina Feier

• Paper: Pablo Barceló Cristina Feier Carsten Lutz Andreas Pieris
  When is Ontology-Mediated Querying Efficient? 1-13 Willem B (LICS 2019) More Information...

Joan Feigenbaum

• Invited Paper: Joan Feigenbaum
  Privacy, Anonymity, and Accountability in Ad-Supported Services (LICS 2012) More Information...

Giovanni de Felice

• Paper: Elena Di Lavore Giovanni de Felice Mario Román
  Monoidal Streams for Dataflow Programming (LICS 2022) More Information...

Matthias Felleisen

• Paper: Matthias Felleisen Daniel P. Friedman Eugene E. Kohlbecker Bruce F. Duba
  Reasoning with Continuations (LICS 1986) More Information...

Thomas Feller

• Paper: Manuel Bodirsky Thomas Feller Simon Knäuer Sebastian Rudolph
  On Logics and Homomorphism Closure (LICS 2021) More Information...

Edward W. Felten

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

Amy Felty

• Paper: Amy Felty
  Encoding the calculus of constructions in a higher-order logic (LICS 1993) More Information...

Xinyu Feng

• Paper: Hongjin Liang Xinyu Feng Zhong Shao
  Compositional verification of termination-preserving refinement of concurrent programs (LICS 2014) More Information...

Hugo Férée

• Paper: Hugo Férée Mathieu Hoyrup Walid Gomaa
  On the Query Complexity of Real Functionals (LICS 2013) More Information...

Jérôme Feret

• Invited Paper: Vincent Danos Jérôme Feret Walter Fontana Russell Harmer Jean Krivine
  Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction (LICS 2010) More Information...

Christian G. Fermüller

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

Natasha Fernandes

• Paper: Natasha Fernandes Annabelle McIver Carroll Morgan
  The Laplace Mechanism has optimal utility for differential privacy over continuous queries (LICS 2021) More Information...

David Fernández-Duque

• Paper: Alexandru Baltag Nick Bezhanishvili David Fernández-Duque
  The Topological Mu-Calculus: completeness and decidability (LICS 2021) 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...

Maribel Fernández

• Paper: Franco Barbanera Maribel Fernández Herman Geuvers
  Modularity of strong normalization and confluence in the algebraic-λ-cube (LICS 1994) More Information...
• Paper: Maribel Fernández Ian Mackie
  Coinductive Techniques for Operational Equivalence of Interaction Nets (LICS 1998) More Information...

Ariel Fernández

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

R. Tim P. Fernando

• Paper: R. Tim P. Fernando
  On substitutional recursion over non-well-founded sets (LICS 1989) More Information...

Francisco Ferreira

• Paper: Brigitte Pientka David Thibodeau Andreas Abel Francisco Ferreira Rébecca Zucchini
  A Type Theory for Defining Logics and Proofs (LICS 2019) More Information...

Thomas Ferrère

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

Raul Fervari

• Paper: Bartosz Bednarczyk Stéphane Demri Raul Fervari Alessio Mansutti
  Modal Logics with Composition on Finite Forests: Expressivity and Complexity (LICS 2020) More Information...

Johannes Klaus Fichte

• Paper: Johannes Klaus Fichte Markus Hecher Andreas Pfandler
  Lower Bounds for QBFs of Bounded Treewidth (LICS 2020) More Information...

Diego Figueira

• Paper: Diego Figueira Santiago Figueira Sylvain Schmitz Philippe Schnoebelen
  Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma (LICS 2011) More Information...
• Paper: Diego Figueira
  A Decidable Two-Way Logic on Data Words (LICS 2011) More Information...
• Paper: Pablo Barceló Diego Figueira Leonid Libkin
  Graph Logics with Rational Relations and the Generalized Intersection Problem (LICS 2012) More Information...
• Paper: Stéphane Demri Diego Figueira M. Praveen
  Reasoning about Data Repetitions with Counter Systems (LICS 2013) More Information...
• Paper: Diego Figueira Leonid Libkin
  Pattern logics and auxiliary relations (LICS 2014) More Information...
• Paper: Diego Figueira Leonid Libkin
  Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (LICS 2015) More Information...
• Paper: Diego Figueira
  Semantically Acyclic Conjunctive Queries under Functional Dependencies (LICS 2016) More Information...
• Paper: Diego Figueira M. Praveen
  Playing with Repetitions in Data Words Using Energy Games (LICS 2018) More Information...
• Paper: Diego Figueira Anthony Widjaja Lin
  Reasoning on Data Words over Numeric Domains (LICS 2022) More Information...

Santiago Figueira

• Paper: Diego Figueira Santiago Figueira Sylvain Schmitz Philippe Schnoebelen
  Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma (LICS 2011) More Information...

Nathanaël Fijalkow

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

Emmanuel Filiot

• Paper: Rajeev Alur Emmanuel Filiot Ashutosh Trivedi
  Regular Transformations of Infinite Strings (LICS 2012) More Information...
• 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...
• Paper: Luc Dartois Emmanuel Filiot Pierre-Alain Reynier Jean-Marc Talbot
  Two-Way Visibly Pushdown Automata and Transducers (LICS 2016) More Information...
• Paper: Emmanuel Filiot Olivier Gauwin Nathan Lhote
  First-order definability of rational transductions: An algebraic approach (LICS 2016) More Information...
• Paper: Emmanuel Filiot Ismaël Jecker Nathan Lhote Guillermo A. Pérez Jean-François Raskin
  On delay and regret determinization of max-plus automata (LICS 2017) More Information...
• Paper: Luc Dartois Emmanuel Filiot Nathan Lhote
  Logics for Word Transductions with Synthesis (LICS 2018) More Information...
• Paper: Emmanuel Filiot Raffaella Gentilini Jean-François Raskin
  Rational Synthesis Under Imperfect Information (LICS 2018) More Information...

Gilberto Filé

• Paper: Agostino Cortesi Gilberto Filé William H. Winsborough
  Prop revisited: propositional formula as abstract domain for groundness analysis (LICS 1991) More Information...

Bernd Finkbeiner

• Paper: Bernd Finkbeiner Sven Schewe
  Uniform Distributed Synthesis (LICS 2005) More Information...
• Paper: Norine Coenen Bernd Finkbeiner Christopher Hahn Jana Hofmann
  The Hierarchy of Hyperlogics (LICS 2019) More Information...
• Paper: Raven Beutner David Carral Bernd Finkbeiner Jana Hofmann Markus Krötzsch
  Deciding Hyperproperties Combined with Functional Specifications (LICS 2022) More Information...

Alain Finkel

• Paper: Javier Esparza Alain Finkel Richard Mayr
  On the Verification of Broadcast Protocols (LICS 1999) More Information...
• 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...

Eric Finster

• Paper: Daniel R. Licata Eric Finster
  Eilenberg-MacLane spaces in homotopy type theory (LICS 2014) More Information...
• Paper: Kuen-Bang Hou (Favonia) Eric Finster Daniel R. Licata Peter LeFanu Lumsdaine
  A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory (LICS 2016) More Information...
• Paper: Eric Finster Samuel Mimram
  A type-theoretical definition of weak ω-categories (LICS 2017) More Information...
• Paper: Eric Finster Antoine Allioux Matthieu Sozeau
  Types Are Internal ∞-Groupoids (LICS 2021) More Information...
• Paper: Eric Finster David Reutter Jamie Vicary Alex Rice
  A Type Theory for Strictly Unital infinity-Categories (LICS 2022) More Information...

Marcelo P. Fiore

• Paper: Marcelo P. Fiore
  A coinduction principle for recursive data types based on bisimulation (LICS 1993) More Information...
• Paper: Marcelo P. Fiore Gordon D. Plotkin
  An axiomatisation of computationally adequate domain theoretic models of FPC (LICS 1994) 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: Martín Abadi Marcelo P. Fiore
  Syntactic Considerations on Recursive Types (LICS 1996) More Information...
• Paper: Marcelo P. Fiore Gordon D. Plotkin A. John Power
  Complete Cuboidal Sets in Axiomatic Domain Theory (LICS 1997) More Information...
• Paper: Gian Luca Cattani Marcelo P. Fiore Glynn Winskel
  A Theory of Recursive Domains with Applications to Concurrency (LICS 1998) More Information...
• Paper: Marcelo P. Fiore Kohei Honda
  Recursive Types in Games: Axiomatics and Process Representation (LICS 1998) More Information...
• Paper: Marcelo P. Fiore Gian Luca Cattani Glynn Winskel
  Weak Bisimulation and Open Maps (LICS 1999) More Information...
• Paper: Marcelo P. Fiore Gordon D. Plotkin Daniele Turi
  Abstract Syntax and Variable Binding (LICS 1999) More Information...
• Paper: Marcelo P. Fiore Daniele Turi
  Semantics of Name and Value Passing (LICS 2001) More Information...
• 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...
• 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: Marcelo P. Fiore
  Second-Order and Dependently-Sorted Abstract Syntax (LICS 2008) More Information...
• Paper: Marcelo P. Fiore Makoto Hamana
  Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic (LICS 2013) More Information...
• Paper: Marcelo P. Fiore Sam Staton
  Substitution, jumps, and algebraic effects (LICS 2014) More Information...
• Paper: Marcelo P. Fiore Philip Saville
  A type theory for cartesian closed bicategories (Extended Abstract) (LICS 2019) More Information...
• Paper: Nathanael Arkor Marcelo P. Fiore
  Algebraic models of simple type theories: A polynomial approach (LICS 2020) More Information...
• Paper: Marcelo P. Fiore Philip Saville
  Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure (LICS 2020) More Information...

Eldar Fischer

• Paper: Eldar Fischer Frédéric Magniez Michel de Rougemont
  Approximate Satisfiability and Equivalence (LICS 2006) More Information...

Jasmin Fisher

• Invited Paper: Jasmin Fisher
  Understanding biology through logic (LICS 2014) More Information...

Kathleen Fisher

• Paper: John C. Mitchell Furio Honsell Kathleen Fisher
  A lambda calculus of objects and method specialization (LICS 1993) More Information...

Melvin Fitting

• Paper: Melvin Fitting
  Negation as refutation (LICS 1989) More Information...

Cormac Flanagan

• Paper: Tim Disney Cormac Flanagan
  Game Semantics for Type Soundness (LICS 2015) More Information...

Jörg Flum

• Paper: Jörg Flum Martin Grohe
  Model-Checking Problems as a Basis for Parameterized Intractability (LICS 2004) More Information...
• Paper: Yijia Chen Jörg Flum
  A Logic for PTIME and a Parameterized Halting Problem (LICS 2009) More Information...
• Paper: Yijia Chen Jörg Flum
  Listings and Logics (LICS 2011) More Information...
• Paper: Yijia Chen Jörg Flum
  On the Ordered Conjecture (LICS 2012) More Information...
• Paper: Yijia Chen Jörg Flum
  Tree-depth, quantifier elimination, and quantifier rank (LICS 2018) More Information...
• Paper: Yijia Chen Jörg Flum
  Forbidden Induced Subgraphs and the Łoś-Tarski Theorem (LICS 2021) More Information...

Wan Fokkink

• Paper: Bard Bloom Wan Fokkink Rob J. van Glabbeek
  Precongruence Formats for Decorated Trace Preorders (LICS 2000) More Information...
• Paper: Taolue Chen Wan Fokkink
  On the Axiomatizability of Impossible Futures: Preorder versus Equivalence (LICS 2008) More Information...
• Paper: Wan Fokkink Rob J. van Glabbeek
  Divide and Congruence II: Delay and Weak Bisimilarity (LICS 2016) More Information...

Wan J. Fokkink

• Paper: Clemens Grabmayer Wan J. Fokkink
  A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity (LICS 2020) More Information...

Stephan Foldes

• Short Presentation: Miguel Couceiro Stephan Foldes
  On Definability of Function Classes by Relational Constraints and Corresponding Galois Connections (LICS 2004) More Information...

Enno Folkerts

• Paper: Enno Folkerts
  Invertibility in lambda-eta (LICS 1998) More Information...

Fedor V. Fomin

• Paper: Fedor V. Fomin Petr A. Golovach Dimitrios M. Thilikos
  Parameterized Complexity of Elimination Distance to First-Order Logic Properties (LICS 2021) More Information...

Brendan Fong

• Paper: Brendan Fong Pawel Sobocinski Paolo Rapisarda
  A categorical approach to open and interconnected dynamical systems (LICS 2016) More Information...
• Paper: Brendan Fong David I. Spivak Rémy Tuyéras
  Backprop as Functor: A compositional perspective on supervised learning (LICS 2019) More Information...

Gaëlle Fontaine

• Paper: Gaëlle Fontaine
  Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? (LICS 2013) More Information...

Walter Fontana

• Invited Paper: Walter Fontana
  Logic and Systems Biology (LICS 2005) More Information...
• Invited Paper: Vincent Danos Jérôme Feret Walter Fontana Russell Harmer Jean Krivine
  Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction (LICS 2010) More Information...

Jonathan Ford

• Short Presentation: Jonathan Ford Ian A. Mason Natarajan Shankar
  Lessons Learned from Formal Developments in PVS (LICS 2002) More Information...

Chase Ford

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

Vojtech Forejt

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

Simon Forest

• Paper: Simon Forest Samuel Mimram
  Describing free $\omega$ -categories (LICS 2019) More Information...

Cédric Fournet

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

Jonathan Fowler

• Paper: Venanzio Capretta Jonathan Fowler
  The continuity of monadic stream functions (LICS 2017) More Information...

Robert Fraser

• Short Presentation: Guo-Qiang Zhang Xiangnan Zhou Robert Fraser Licong Cui
  Concatenation and Kleene Star on Deterministic Finite Automata (LICS 2011) More Information...

Matthew Fredrikson

• Paper: Matthew Fredrikson Somesh Jha
  Satisfiability modulo counting: a new approach for analyzing privacy properties (LICS 2014) More Information...

Matt Fredrikson

• Paper: Arthur Azevedo de Amorim Matt Fredrikson Limin Jia
  Reconciling noninterference and gradual typing (LICS 2020) More Information...

Olle Fredriksson

• Paper: Olle Fredriksson Dan R. Ghica
  Abstract Machines for Game Semantics, Revisited (LICS 2013) More Information...

Cameron E. Freer

• Paper: Nathanael Leedom Ackerman Cameron E. Freer Daniel M. Roy
  Noncomputable Conditional Distributions (LICS 2011) More Information...
• Short Presentation: Nathanael Leedom Ackerman Cameron E. Freer Daniel M. Roy
  #P-complete conditional distributions (LICS 2011) More Information...
• Paper: Nathanael Leedom Ackerman Cameron E. Freer Robert S. Lubarsky
  Feedback Turing Computability, and Turing Computability as Feedback (LICS 2015) More Information...
• Paper: Nathanael L. Ackerman Jeremy Avigad Cameron E. Freer Daniel M. Roy Jason M. Rute
  Algorithmic barriers to representing conditional independence (LICS 2019) More Information...
• Paper: Nathanael L. Ackerman Julian Asilis Jieqi Di Cameron E. Freer Jean-Baptiste Tristan
  Computable PAC Learning of Continuous Features (LICS 2022) More Information...

Fabian Frei

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

Adam Freilich

• Paper: Rajeev Alur Adam Freilich Mukund Raghothaman
  Regular combinators for string transformations (LICS 2014) More Information...

Teodoro Freund

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

Jonas Frey

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

Peter J. Freyd

• 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: Peter J. Freyd Philip Mulry Giuseppe Rosolini Dana S. Scott
  Extensional PERs (LICS 1990) More Information...
• Paper: Peter J. Freyd
  Recursive types reduced to inductive types (LICS 1990) More Information...
• Paper: Peter J. Freyd Edmund P. Robinson Giuseppe Rosolini
  Functional parametricity (LICS 1992) More Information...

Marcelo F. Frias

• Paper: Marcelo F. Frias Roger D. Maddux
  Completeness of a Relational Calculus for Program Schemes (LICS 1998) More Information...

Laurent Fribourg

• Paper: Laurent Fribourg
  Mixing list recursion and arithmetic (LICS 1992) More Information...

Markus Frick

• Paper: Markus Frick Martin Grohe
  The complexity of first-order and monadic second-order logic revisited (LICS 2002) More Information...
• Paper: Markus Frick Martin Grohe Christoph Koch
  Query Evaluation on Compressed Trees (Extended Abstract) (LICS 2003) More Information...

Marlin Frickenschmidt

• Paper: Michael Elberfeld Marlin Frickenschmidt Martin Grohe
  Order Invariance on Decomposable Structures (LICS 2016) More Information...

Dror Fried

• Paper: Dror Fried Axel Legay Joël Ouaknine Moshe Y. Vardi
  Sequential Relational Decomposition (LICS 2018) More Information...

Harvey M. Friedman

• Invited Paper: Harvey M. Friedman
  Some Decision Problems of Enormous Complexity (LICS 1999) More Information...

Nir Friedman

• Invited Paper: Nir Friedman Joseph Y. Halpern
  Plausibility Measures and Default Reasoning: An Overview (LICS 1999) More Information...

Daniel P. Friedman

• Paper: Matthias Felleisen Daniel P. Friedman Eugene E. Kohlbecker Bruce F. Duba
  Reasoning with Continuations (LICS 1986) More Information...

Oliver Friedmann

• Paper: Oliver Friedmann
  An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it (LICS 2009) More Information...

Alain Frisch

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

Christine Froidevaux

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

Dan Frumin

• Paper: Dan Frumin Robbert Krebbers Lars Birkedal
  ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency (LICS 2018) More Information...

Thom W. Frühwirth

• Paper: Thom W. Frühwirth Ehud Y. Shapiro Moshe Y. Vardi Eyal Yardeni
  Logic programs as types for logic programs (LICS 1991) More Information...

Peng Fu

• Paper: Peng Fu Kohei Kishida Peter Selinger
  Linear Dependent Type Theory for Quantum Programming Languages: Extended Abstract (LICS 2020) More Information...

Carsten Fuhs

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

Florian Funke

• Paper: Corto Mascle Christel Baier Florian Funke Simon Jantsch Stefan Kiefer
  Responsibility and verification: Importance value in temporal logics (LICS 2021) More Information...

Robert Furber

• Paper: Matteo Mio Robert Furber Radu Mardare
  Riesz Modal logic for Markov processes (LICS 2017) More Information...
• Paper: Robert Furber Dexter Kozen Kim G. Larsen Radu Mardare Prakash Panangaden
  Unrestricted stone duality for Markov processes (LICS 2017) More Information...
• Paper: Giorgio Bacci Robert Furber Dexter Kozen Radu Mardare Prakash Panangaden Dana Scott
  Boolean-Valued Semantics for the Stochastic λ-Calculus (LICS 2018) More Information...

Carsten Führmann

• Paper: Carsten Führmann David J. Pym
  On the Geometry of Interaction for Classical Logic (LICS 2004) More Information...