FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

#
#SAT	(LaSh) Solving #SAT by Parameterized Algorithms: Exploiting Small Treewidth (PDF, talk)
#SMT(BV)	(IJCAR) A New Probabilistic Algorithm for Approximate Model Counting (PDF, talk)
#SMT(LA)	(PRUV) VolCE: An Efficient Tool for Solving #SMT(LA) Problems (PDF, talk)
$
$\omega$-categorical	(IJCAR) Complexity of Combinations of Qualitative Constraint Satisfaction Problems (PDF, talk)
(
(Constraint) Logic Programming	(ICLP) Towards Incremental and Modular Context-sensitive Analysis (PDF, talk)
(homeomorphically) embedded E-unifiers	(UNIF) Unification Based on Generalized Embedding (PDF, talk)
2
2-CNF	(SAT) Minimal unsatisfiability and minimal strongly connected digraphs (PDF, talk)
A
A-infinity-(co)algebras	(HDRA) Minimal models for monomial algebras (PDF, talk)
aa	(ADHS) Observability of Linear Hybrid Systems with Unknown Inputs and Discrete Dynamics Modeled by Petri Nets (PDF, talk) (ADHS) Language constrained stabilization of discrete- time switched linear systems: an LMI approach (PDF, talk) (ADHS) Learning and Verification of Feedback Control Systems Using Feedforward Neural Networks (PDF, talk) (ADHS) Control Synthesis and Classification for Unicycle Dynamics Using the Gradient and Value Sampling Particle Filters (PDF, talk)
aaa	(ADHS) Statistical Verification of PCTL Using Stratified Samples (PDF, talk) (ADHS) Switch induced instabilities for stable power system DAE models (PDF, talk) (ADHS) Hierarchical Model Predictive Control for Building Energy Management of Hybrid Systems (PDF, talk) (ADHS) Network-Aware Design of State-Feedback Controllers for Linear Wireless Networked Control Systems (PDF, talk) (ADHS) Space-Time Budget Allocation for Marketing Over Social Networks (PDF, talk) (ADHS) Reachability Analysis for One Dimensional Linear Parabolic Equation (PDF, talk) (ADHS) Safety Control, a Quantitative Approach (PDF, talk) (ADHS) A switched system approach to optimize mixing of fluids (PDF, talk) (ADHS) Razumikhin-type Theorems on Practical Stability of Dynamic Equations on Time Scales (PDF, talk) (ADHS) Higher-Dimensional Timed Automata (PDF, talk) (ADHS) Verifying nonlinear analog and mixed-signal circuits with inputs (PDF, talk) (ADHS) Stability of switched systems on non-uniform time domains with non commuting matrices (PDF, talk) (ADHS) Concentration of Measure for Chance-Constrained Optimization (PDF, talk) (ADHS) Optimal Symbolic Controllers Determinization for BDD storage. (PDF, talk) (ADHS) Occupation Measure Methods for Modelling and Analysis of Biological Hybrid Systems (PDF, talk) (ADHS) On Approximate Predictability of Metric Systems (PDF, talk) (ADHS) Hybrid System Modeling of Multi-Agent Coverage Problems with Energy Depletion and Repletion (PDF, talk) (ADHS) CoasterX: A Case Study in Component-Driven Hybrid Systems Proof Automation (PDF, talk) (ADHS) Tracking Control via Variable-gain Integrator and Lookahead Simulation: Application to Leader-follower Multiagent Networks (PDF, talk) (ADHS) Bounding Errors Due to Switching Delays in Incrementally Stable Switched Systems (PDF, talk) (ADHS) Multi-Energy Scheduling Using a Hybrid Systems Approach (PDF, talk) (ADHS) Generating Dominant Strategies for Continuous Two-Player Zero-Sum Games (PDF, talk) (ADHS) Compositional Synthesis of Finite Abstractions for Continuous-Space Stochastic Control Systems: A Small-Gain Approach (PDF, talk) (ADHS) T-Barrier Certificates: A Continuous Analogy to K-Induction (PDF, talk) (ADHS) Approximate Abstractions of Markov Chains with Interval Decision Processes (PDF, talk) (ADHS) Control Synthesis for Stochastic Switched Systems Using the Tamed Euler Method (PDF, talk) (ADHS) Compositional Abstraction-based Synthesis for Cascade Discrete-Time Control Systems (PDF, talk) (ADHS) Nonuniform abstractions, refinement and controller synthesis with novel BDD encodings (PDF, talk) (ADHS) Benchmarks for Cyber-Physical Systems: A Modular Model Library for Building Automation Systems (PDF, talk) (ADHS) Temporal Logic Control of General Markov Decision Processes by Approximate Policy Refinement (PDF, talk) (ADHS) Compositional Analysis of Hybrid Systems Defined Over Finite Alphabets (PDF, talk) (ADHS) Interacting Particle System-Based Estimation of Reach Probability for a Generalized Stochastic Hybrid System (PDF, talk) (ADHS) A controlled sewer system should be treated as a sampled data system with events (PDF, talk) (ADHS) An Interval-Based Sliding Horizon Motion Planning Method (PDF, talk) (ADHS) Falsification of Temporal Logic Requirements Using Gradient Based Local Search in Space and Time (PDF, talk) (ADHS) Computing Controlled Invariant Sets for Hybrid Systems with Applications to Model-Predictive Control (PDF, talk) (ADHS) Temporal Logic Control of POMDPs Via Label-Based Stochastic Simulation Relations (PDF, talk) (ADHS) Mission Planning for Multiple Vehicles with Temporal Specifications using UxAS (PDF, talk) (ADHS) Input Design for Nonlinear Model Discrimination Via Affine Abstraction (PDF, talk) (ADHS) Sufficient Conditions for Temporal Logic Specifications in Hybrid Dynamical Systems (PDF, talk) (ADHS) Algorithm for Bernstein Polynomial Control Design (PDF, talk) (ADHS) On Generating A Variety of Unsafe Counterexamples for Linear Dynamical Systems (PDF, talk) (ADHS) On invariance and reachability on semialgebraic sets for linear dynamics (PDF, talk) (ADHS) Data-Driven Switched Affine Modeling for Model Predictive Control (PDF, talk) (ADHS) Symbolic Models for Incrementally Stable Switched Systems with Aperiodic Time Sampling (PDF, talk) (ADHS) Optimization-Based Design of Bounded-Error Estimators Robust to Missing Data (PDF, talk)
abductive reasoning	(IJCAR) A Generic Framework for Implicate Generation Modulo Theories (PDF, talk)
Abella	(LFMTP) Functional programming with λ-tree syntax: a progress report (PDF, talk) (LFMTP) Computation-as-deduction in Abella: work in progress (PDF, talk)
Absolute Correctness	(REFINE) Programming Without Refinement (PDF, talk)
Abstract Interpretation	(ICLP) Towards Incremental and Modular Context-sensitive Analysis (PDF, talk) (ICLP) An iterative approach to precondition inference using constrained Horn clauses (PDF, talk) (ICLP) Towards Static Performance Guarantees for Programs with Run-time Checks (PDF, talk) (FM) On Software Safety, Security, and Abstract Interpretation (PDF, talk) (IJCAR) Checking Array Bounds by Abstract Interpretation and Symbolic Expressions (PDF, talk) (CSF) Inductive Invariants for Noninterference in Multi-agent Workflows (PDF, talk) (LICS) Sound up-to techniques and Complete abstract domains (PDF, talk)
abstract recursion theory	(LCC) Computability over locally finite structures from algebra (PDF, talk)
abstract state machine	(DCM) Generic Graph Semantics (PDF, talk)
Abstract State Machines	(F-IDE) AsmetaF: a flattener for the ASMETA framework (PDF, talk)
Abstract syntax	(LFMTP) What Does This Notation Mean Anyway? BNF-Style Notation as it is actually used (PDF, talk) (LICS) Syntax and Semantics for Operations with Scopes (PDF, talk)
abstract winning condition	(SR) Concurrent games and semi-random determinacy (PDF, talk)
Abstraction	(FM) Towards `Verifying' a Water Treatment System (PDF, talk) (WST) Well-founded models in proofs of termination (PDF, talk) (CAV) Reasoning About TSO Programs Using Reduction and Abstraction (PDF, talk)
Abstraction Refinement	(ICLP) An iterative approach to precondition inference using constrained Horn clauses (PDF, talk) (CAV) Space-time Interpolants (PDF, talk)
abstraction-refinement	(IJCAR) An abstraction-refinement framework for reasoning with large theories (PDF, talk)
accumulated weight constraints	(LICS) Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes (PDF, talk)
Ackermann's Lemma	(IJCAR) FAME: An Automated Tool for Semantic Forgetting in Expressive Description Logics (PDF, talk)
action language	(ICLP) A Probabilistic Extension of Action Language BC+ (PDF, talk) (ICLP-DC) Probabilistic Action Language pBC+ (PDF, talk) (ICLP-DC) Explaining Actual Causation via Reasoning about Actions and Change (PDF, talk)
Active Objects	(AVOCS) Detecting Deadlocks in Formal System Models with Condition Synchronization (PDF, talk)
Actor	(FM) Deadlock Detection for Actor-based Coroutines (PDF, talk)
actors	(FM) SDN-Actors: Modeling and Verification of SDN Programs (PDF, talk)
Actual Cause	(ICLP-DC) Explaining Actual Causation via Reasoning about Actions and Change (PDF, talk)
ACUI	(UNIF) ACUI Unification Modulo Ground Theories (PDF, talk)
Ada programming	(WPTE) Verification of Ada Programs with AdaHorn (PDF, talk)
adaptive	(VaVAS) Adaptive Neighborhood Resizing for Stochastic Reachability in Multi-Agent Systems (PDF, talk)
additive monad	(LICS) Dialectica models of type theory (PDF, talk)
adequate numeral system	(ITRS) On sets of terms with a given intersection type (PDF, )
adjoint logic	(Linearity/TLLA) On the Lambek Calculus with an Exchange Modality (PDF, talk)
adjoint model	(Linearity/TLLA) On the Lambek Calculus with an Exchange Modality (PDF, talk)
Adjunctions	(HDRA) Termination in linear (2,2)-categories with braidings and duals (PDF, talk)
admissibility	(SR) Beyond admissibility: Dominance between chains of strategies (PDF, talk)
admissible rules	(CL&C) Admissible tools in the kitchen of intuitionistic logic (PDF, talk)
affine term	(Linearity/TLLA) How to count linear and affine closed lambda terms? (PDF, talk)
Agda	(ITP) Verified Timing Transformations in Synchronous Circuits with LambdaPi-Ware (PDF, talk) (ITP) An Agda Formalization of Üresin & Dubois' Asynchronous Fixed-Point Theory (PDF, talk) (REFINE) Ordering strict partial orders to model behavioural refinement (PDF, talk)
agent programming	(VaVAS) Formalisation of the Rules of the Road for embedding into an Autonomous Vehicle Agent (PDF, talk)
agents	(VaVAS) Social Consequence Engines (Abstract) (PDF, talk)
Aggregates	(ICLP) Declarative Algorithms in Datalog with Aggregates: user-friendly formal semantics conducive to performance and scalability (PDF, talk) (ICLP) Functional ASP with Intensional Sets; Application to Gelfond-Zhang Agreggates (PDF, talk)
aggregations in logic programming	(ICLP) Shared aggregate sets in answer set programming (PDF, talk)
AI Safety	(CAV) Safety-Aware Apprenticeship Learning (PDF, talk)
air traffic surveillance systems	(FM) A Formally Verified Floating-Point Implementation of the Compact Position Reporting Algorithm (PDF, talk)
Algebra	(LaSh) Declarative Dynamic Programming with Inverse Coupled Rewrite Systems (PDF, talk)
algebra in type theory	(LICS) Degrees of Relatedness - A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory (PDF, talk)
algebraic confluence	(IWC) Coherence of monoids by insertions (PDF, talk)
Algebraic crossover operators	(RCRA) Algebraic Crossover Operators for Permutations (PDF, talk)
algebraic effects	(FM) Modular Verification of Programs with Effects and Effect Handlers in Coq (PDF, talk) (LICS) Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances (PDF, talk) (LICS) Syntax and Semantics for Operations with Scopes (PDF, talk)
Algebraic evolutionary computation	(RCRA) Algebraic Crossover Operators for Permutations (PDF, talk)
algebraic extensions	(SCSC) New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square (PDF, talk)
Algebraic Geometry	(Linearity/TLLA) Entropy and Complexity Lower Bounds (PDF, talk) (LICS) Polynomial Invariants for Affine Programs (PDF, talk)
algebraic proof systems	(SCSC) Refutation of Products of Linear Polynomials (PDF, talk)
algebraic structures	(LICS) Free Higher Groups in Homotopy Type Theory (PDF, talk)
algorithm	(CAV) Attracting Tangles to Solve Parity Games (PDF, talk)
Algorithm selection	(QBF) Portfolio-Based Algorithm Selection for Circuit QBFs (PDF, talk)
algorithm substitution attacks	(CSF) Self-Guarding Cryptographic Protocols against Algorithm Substitution Attacks (PDF, talk)
algorithmic complexity	(LICS) A modal mu perspective on solving parity games in quasipolynomial time. (PDF, talk)
algorithms	(SCSC) Unknot Recognition Through Quantifier Elimination (PDF, talk)
all maximal clique partitions in a graph	(UNIF) Proximity-Based Generalization (PDF, talk)
allegories	(LICS) Allegories: decidability and graph homomorphisms (PDF, talk)
Alloy	(F-IDE) Improving the Visualization of Alloy Instances (PDF, talk) (FM) CompoSAT: Specification-Guided Coverage for Model Finding (PDF, talk)
Almost Full relations	(IJCAR) Constructive Decision via Redundancy-free Proof-Search (PDF, talk)
Almost-sure winning	(CAV) Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives (PDF, talk)
alpha-equivalence	(FSCD) Fixed-Point Constraints for Nominal Equational Unification (PDF, talk)
Alternating Automata	(LICS) The State Complexity of Alternating Automata (PDF, talk)
Alternating time	(IJCAR) Focussing, MALL and the polynomial hierarchy (PDF, talk)
Alternating-time Temporal Logic	(SR) Verification of Multi-agent Systems with Imperfect Information and Public Actions (PDF, talk)
AMBA AHB	(CAV) Strix: Explicit Reactive Synthesis Strikes Back! (PDF, talk)
anaphora	(NLCS) Paychecks, Presupposition, and Dependent Types (PDF, talk)
Android Applications	(AVOCS) Rule-Based Synthesis of Chains of Security Functions for Software-Defined Networks (PDF, talk)
Android back stack	(CAV) Android Stack Machine (PDF, talk)
Android stack systems	(CAV) Android Stack Machine (PDF, talk)
Animation	(Overture) ViennaVM: a Virtual Machine for VDM-SL development (PDF, talk) (ICLP) CHRvis: Syntax and Semantics (PDF, talk)
annotation	(VEMDP) Executable Biochemical Space for Specification and Analysis of Biochemical Systems (PDF, talk)
answer set computation	(ICLP) MASP-Reduce: a proposal for distributed computation of stable models (PDF, talk)
Answer Set Programming	(ICLP) Epistemic Logic Programs with World View Constraints (PDF, talk) (ICLP) Specifying and Verbalising Answer Set Programs in Controlled Natural Language (PDF, talk) (ICLP) Temporal Answer Set Programming on Finite Traces (PDF, talk) (ICLP) Experimenting with robotic intra-logistics domains (PDF, talk) (ICLP) Learning Commonsense Knowledge through Interactive Dialogue (PDF, talk) (ICLP) Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples (PDF, talk) (ICLP) Introspecting Preferences In Answer Set Programming (PDF, talk) (ICLP) Shared aggregate sets in answer set programming (PDF, talk) (ICLP) Cautious Reasoning in ASP via Minimal models and Unsatisfiable Cores (PDF, talk) (ICLP) Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning (PDF, talk) (ICLP) A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming (PDF, talk) (ICLP) Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP (PDF, talk) (ICLP) MASP-Reduce: a proposal for distributed computation of stable models (PDF, talk) (ICLP) Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming (PDF, talk) (ICLP) First-order answer set programming as constructive proof search (PDF, talk) (ICLP) Functional ASP with Intensional Sets; Application to Gelfond-Zhang Agreggates (PDF, talk) (ICLP) SMT-based Answer Set Solver CMODELS(DIFF) (System Description) (PDF, talk) (ICLP-DC) Speeding Up Lazy-Grounding Answer Set Solving (PDF, talk) (ICLP-DC) Model Revision of Logical Regulatory Networks using Logic-based Tools (PDF, talk) (ICLP-DC) Explaining Actual Causation via Reasoning about Actions and Change (PDF, talk) (ICLP-DC) Translating P-log, LP^{MLN}, LPOD, and CR-Prolog2 into Standard Answer Set Programs (PDF, talk) (ICLP-DC) Scalable Robotic Intra-Logistics with Answer Set Programming (PDF, talk) (LPOP) Role-Based Access Control via JASP (PDF, talk) (LPOP) On the Development of Industrial Applications with ASP (PDF, talk) (LPOP) How to upgrade ASP for true dynamic modelling and solving? (PDF, talk) (RCRA) Externally Supported Models for Efficient Computation of Paracoherent Answer Sets (PDF, talk) (RCRA) Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper) (PDF, talk)
Anti-unification	(FSCD) Term-Graph Anti-Unification (PDF, talk) (FSCD) Higher-Order Equational Pattern Anti-Unification (PDF, talk) (NLCS) Anti-Unification and Natural Language Processing (PDF, talk) (UNIF) Towards Generalization Methods for Purely Idempotent Equational Theories (PDF, talk) (UNIF) Proximity-Based Generalization (PDF, talk)
Apache Spark	(ICLP) MASP-Reduce: a proposal for distributed computation of stable models (PDF, talk)
Application	(ICLP) Application of Logic-Based Methods to Machine Component Design (PDF, talk)
applicative bisimulation distance	(LICS) Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances (PDF, talk)
applicative first-order logic	(IJCAR) Superposition for Lambda-Free Higher-Order Logic (PDF, talk)
applicative simulation distance	(LICS) Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances (PDF, talk)
applied lambda-calculus	(LICS) Type-two polynomial-time and restricted lookahead. (PDF, talk)
Apprenticeship Learning	(CAV) Safety-Aware Apprenticeship Learning (PDF, talk)
approximate circuits	(CAV) ADAC: Automated Design of Approximate Circuits (PDF, talk)
approximate counting	(LCC) Feasibly constructive proofs of succinct weak circuit lower bounds (PDF, talk)
approximate equivalence checking	(CAV) ADAC: Automated Design of Approximate Circuits (PDF, talk)
Approximate inference	(ICLP) Constraint-Based Inference in Probabilistic Logic Programs (PDF, talk)
approximate partial order reduction	(FM) Approximate Partial Order Reduction (PDF, talk)
Approximate synthesis	(CAV) What’s hard about Boolean Functional Synthesis? (PDF, talk)
Approximation	(IJCAR) Exploring Approximations for Floating-Point Arithmetic using UppSAT (PDF, talk) (SMT) The next 10^4 UppSAT Approximations (PDF, talk)
Approximation Fixpoint Theory	(ICLP) Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs (PDF, talk)
approximation theorem	(HOR) Refining Properties of Filter Models: Sensibility, Approximability and Reducibility (PDF, talk)
architecture	(FM) IPL: An Integration Property Language for Multi-Model Cyber-Physical Systems (PDF, talk)
arithmetic circuits	(LICS) Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth (PDF, talk)
Armstrong relation	(IJCAR) Automated Reasoning about Key Sets (PDF, talk)
Arrays	(IJCAR) Checking Array Bounds by Abstract Interpretation and Symbolic Expressions (PDF, talk)
artificial intelligence	(SAT) QBF as an Alternative to Courcelle's Theorem (PDF, talk)
ASMETA	(F-IDE) AsmetaF: a flattener for the ASMETA framework (PDF, talk)
ASN.1	(CAV) Formal Verification of a Vehicle-to-Vehicle (V2V) Messaging System (PDF, talk)
ASP	(ICLP) Translating LPOD and CR-Prolog2 into Standard Answer Set Programs (PDF, talk)
ASP systems	(LPOP) On the Development of Industrial Applications with ASP (PDF, talk)
ASPIDE	(LPOP) On the Development of Industrial Applications with ASP (PDF, talk)
Assertions	(ICLP) Towards Static Performance Guarantees for Programs with Run-time Checks (PDF, talk)
Associative operad	(HDRA) Generalizations of the associative operad and convergent rewrite systems (PDF, talk)
assumptions refinement	(FM) A Weakness Measure for GR(1) Formulae (PDF, talk) (DS-FM) Heuristic-Based GR(1) Assumptions Refinement (PDF, talk)
Asynchronous	(ITP) An Agda Formalization of Üresin & Dubois' Asynchronous Fixed-Point Theory (PDF, talk) (CAV) Synthesis Of Asynchronous Reactive Programs From Temporal Specifications (PDF, talk)
Asynchronous Games	(LICS) An Asynchronous Soundness Theorem for Concurrent Separation Logic (PDF, talk)
Atom tracing	(VEMDP) Rule-Based Gillespie Simulation of Chemical Systems (PDF, talk)
atom variables	(UNIF) Rewriting with Generalized Nominal Unification (PDF, talk)
Atomic flows	(TYDI) Proof complexity of deep inference: a survey (PDF, talk)
Atomic Formula	(LaSh) Lazy Automata Techniques for WS1S (PDF, talk)
ATP	(Linearity/TLLA) Benchmarking Linear Logic Translations (PDF, talk)
Attack Trees	(CSF) Guided design of attack trees: a system-based approach (PDF, talk)
attacker knowledge	(CSF) Assuming you know: epistemic semantics of relational annotations for expressive flow policies (PDF, talk)
Attempto Controlled English	(ICLP) Natural Language Generation From Ontologies: Application Paper (PDF, talk)
attribute-based access control	(FCS) An Expressive, Flexible and Uniform Logical Formalism for Attribute-based Access Control (PDF, talk)
Authentication	(CSF) An extensive formal analysis of multi-factor authentication protocols (PDF, talk)
auto-generated code	(FM) Verifying Auto-Generated C Code from Simulink (PDF, talk)
autocorrelation	(SCSC) Hard Combinatorial Problems: A Challenge for Satisfiability (PDF, talk)
automata	(CAV) The Learnability of Symbolic Automata (PDF, talk)
automata learning	(CAV) The Learnability of Symbolic Automata (PDF, talk)
Automata over infinite words	(LICS) One Theorem to Rule Them All: A Unified Translation of LTL into $\omega$-Automata (PDF, talk)
Automata Theory	(LICS) The State Complexity of Alternating Automata (PDF, talk)
Automata with counters	(SR) Quantifying Bounds in Strategy Logic (PDF, talk)
Automated Algebraic Reasonings	(Coq) ComplCoq: Rewrite Hint Construction with Completion Procedures (PDF, talk)
automated complexity analysis	(LICS) Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS (PDF, talk)
Automated configuration	(RCRA) On the Configuration of SAT Formulae (PDF, talk)
automated guided vehicle routing	(ICLP) Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming (PDF, talk)
automated reasoning	(WiL) On the Combination of Resolution and SAT Procedures for Modal Theorem-Proving (PDF, talk) (ITP) Understanding Parameters of Deductive Verification: An Empirical Investigation of KeY (PDF, talk) (IJCAR) Automated Reasoning about Key Sets (PDF, talk) (IJCAR) ATPboost: Learning Premise Selection in Binary Setting with ATP Feedback (PDF, talk) (CAV) Understanding and Extending Incremental Determinization for 2QBF (PDF, talk) (CAV) Model Generation for Quantified Formulas: A Taint-Based Approach (PDF, talk) (CSF) Alethea: A Provably Secure Random Sample Voting Protocol (PDF, talk)
automated reasonning	(SMT) Centralizing Equality Reasoning in MCSAT (PDF, talk)
automated theorem proving	(F-IDE) Lightweight Interactive Proving inside an Automatic Program Verifier (PDF, talk) (ThEdu) Towards intuitive reasoning in axiomatic geometry (PDF, talk) (IJCAR) The Higher-Order Prover Leo-III (PDF, talk) (IJCAR) Efficient encodings of first-order Horn formulas in equational logic (PDF, talk) (IJCAR) A FOOLish Encoding of the Next State Relations of Imperative Programs (PDF, talk) (IJCAR) ATPboost: Learning Premise Selection in Binary Setting with ATP Feedback (PDF, talk) (PAAR) TFX: The TPTP Extended Typed First-order Form (PDF, talk) (ARQNL) System Demonstration: The Higher-Order Prover Leo-III (PDF, talk)
automated trading systems	(Linearity/TLLA) Formalization of Automated Trading Systems in a Concurrent Linear Framework (PDF, talk)
Automated verification	(CAV) Constraint-Based Synthesis of Coupling Proofs (PDF, talk) (CAV) Formal Verification of a Vehicle-to-Vehicle (V2V) Messaging System (PDF, talk) (CSF) An extensive formal analysis of multi-factor authentication protocols (PDF, talk) (CSF) Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR (PDF, talk)
automatic algorithm configuration	(POS) CryptoMiniSat Parameter-Optimization for Solving Cryptographic Instances (PDF, talk)
Automatic Proof checking	(SCSC) A Practical Polynomial Calculus for Arithmetic Circuit Verification (PDF, talk)
Automatic Verification	(WiL) Embedding Intuitionistic Modal Logics in Higher-Order Logic. An Easy Task? (PDF, talk) (FM) Compositional Reasoning for Shared-variable Concurrent Programs (PDF, talk) (CAV) The DEEPSEC prover (PDF, talk)
automation	(FSCD) Completion for Logically Constrained Rewriting (PDF, talk)
Automaton State	(LaSh) Lazy Automata Techniques for WS1S (PDF, talk)
automotive	(FM) Verifying Auto-Generated C Code from Simulink (PDF, talk)
Automotive case study	(FM) Formal Verification of Automotive Simulink Controller Models: Empirical Technical Challenges, Evaluation and Recommendations (PDF, talk)
Autonomous	(VaVAS) Towards validation and verification of an autonomous railway inspection and repair system (PDF, )
Autonomous automotive	(FM) Resource-aware Design for Reliable Autonomous Applications with Multiple Periods (PDF, talk)
Autonomous Driving	(SCSC) Constraint Systems from Traffic Scenarios for the Validation of Autonomous Driving (PDF, talk)
Autonomous system	(VaVAS) Towards a verifiable decision making framework for self-driving vehicles (PDF, talk)
Autonomous vehicle	(VaVAS) Probabilistic Model Checking for Autonomous Agent Strategy Synthesis - Extended Abstract (PDF, talk)
autonomous vehicles	(VaVAS) Formalisation of the Rules of the Road for embedding into an Autonomous Vehicle Agent (PDF, talk)
avionics systems	(FM) Model-Based Testing for Avionics Systems (PDF, talk)
Axiom Pinpointing	(IJCAR) Enumerating Justifications using Resolution (PDF, talk)
axiomatization	(IJCAR) Automated Reasoning about Key Sets (PDF, talk) (LICS) Riesz Modal Logic with Threshold Operators (PDF, talk) (LICS) Allegories: decidability and graph homomorphisms (PDF, talk)
axioms	(IJCAR) Uniform Substitution for Differential Game Logic (PDF, talk)
B
B combinator	(FSCD) On repetitive right application of B-terms (PDF, talk)
backdoor	(SAT) ALIAS: A Modular Tool for Finding Backdoors for SAT (PDF, talk)
backdoors	(CSF) Backdoored Hash Functions: Immunizing HMAC and HKDF (PDF, talk)
backtracking	(SAT) Chronological Backtracking (PDF, talk) (ARQNL) Pseudo-Propositional Logic (PDF, talk)
Backus FP	(HDRA) Minimal Bacus FP is Turing Complete (PDF, talk)
Backward exploration ·	(AVOCS) Backward reachability analysis for timed automata with data variables (PDF, talk)
backwards analysis	(ICLP) An iterative approach to precondition inference using constrained Horn clauses (PDF, talk)
Bar inductive predicates	(ITP) Proof Pearl: Constructive Extraction of Cycle Finding Algorithms (PDF, talk)
Barendregt's Variable Convention	(LFMTP) Formalisation of Barendregt's Variable Convention for Generic Structures with Binders (PDF, talk)
Barrier Certificates	(FM) Vector Barrier Certificates and Comparison Systems (PDF, talk) (CAV) Reachable Set Over-approximation for Nonlinear Systems Using Piecewise Barrier Tubes (PDF, talk)
Basis Reduction	(ITP) A Formalization of the LLL Basis Reduction Algorithm (PDF, talk)
BayesianInference	(VEMDP) Bayesian Verification of Chemical Reaction Networks (PDF, talk)
bb	(ADHS) Observability of Linear Hybrid Systems with Unknown Inputs and Discrete Dynamics Modeled by Petri Nets (PDF, talk) (ADHS) Language constrained stabilization of discrete- time switched linear systems: an LMI approach (PDF, talk) (ADHS) Learning and Verification of Feedback Control Systems Using Feedforward Neural Networks (PDF, talk) (ADHS) Control Synthesis and Classification for Unicycle Dynamics Using the Gradient and Value Sampling Particle Filters (PDF, talk)
bbb	(ADHS) Statistical Verification of PCTL Using Stratified Samples (PDF, talk) (ADHS) Switch induced instabilities for stable power system DAE models (PDF, talk) (ADHS) Hierarchical Model Predictive Control for Building Energy Management of Hybrid Systems (PDF, talk) (ADHS) Network-Aware Design of State-Feedback Controllers for Linear Wireless Networked Control Systems (PDF, talk) (ADHS) Space-Time Budget Allocation for Marketing Over Social Networks (PDF, talk) (ADHS) Reachability Analysis for One Dimensional Linear Parabolic Equation (PDF, talk) (ADHS) Safety Control, a Quantitative Approach (PDF, talk) (ADHS) A switched system approach to optimize mixing of fluids (PDF, talk) (ADHS) Razumikhin-type Theorems on Practical Stability of Dynamic Equations on Time Scales (PDF, talk) (ADHS) Higher-Dimensional Timed Automata (PDF, talk) (ADHS) Verifying nonlinear analog and mixed-signal circuits with inputs (PDF, talk) (ADHS) Stability of switched systems on non-uniform time domains with non commuting matrices (PDF, talk) (ADHS) Concentration of Measure for Chance-Constrained Optimization (PDF, talk) (ADHS) Optimal Symbolic Controllers Determinization for BDD storage. (PDF, talk) (ADHS) Occupation Measure Methods for Modelling and Analysis of Biological Hybrid Systems (PDF, talk) (ADHS) On Approximate Predictability of Metric Systems (PDF, talk) (ADHS) Hybrid System Modeling of Multi-Agent Coverage Problems with Energy Depletion and Repletion (PDF, talk) (ADHS) CoasterX: A Case Study in Component-Driven Hybrid Systems Proof Automation (PDF, talk) (ADHS) Tracking Control via Variable-gain Integrator and Lookahead Simulation: Application to Leader-follower Multiagent Networks (PDF, talk) (ADHS) Bounding Errors Due to Switching Delays in Incrementally Stable Switched Systems (PDF, talk) (ADHS) Multi-Energy Scheduling Using a Hybrid Systems Approach (PDF, talk) (ADHS) Generating Dominant Strategies for Continuous Two-Player Zero-Sum Games (PDF, talk) (ADHS) Compositional Synthesis of Finite Abstractions for Continuous-Space Stochastic Control Systems: A Small-Gain Approach (PDF, talk) (ADHS) T-Barrier Certificates: A Continuous Analogy to K-Induction (PDF, talk) (ADHS) Approximate Abstractions of Markov Chains with Interval Decision Processes (PDF, talk) (ADHS) Control Synthesis for Stochastic Switched Systems Using the Tamed Euler Method (PDF, talk) (ADHS) Compositional Abstraction-based Synthesis for Cascade Discrete-Time Control Systems (PDF, talk) (ADHS) Nonuniform abstractions, refinement and controller synthesis with novel BDD encodings (PDF, talk) (ADHS) Benchmarks for Cyber-Physical Systems: A Modular Model Library for Building Automation Systems (PDF, talk) (ADHS) Temporal Logic Control of General Markov Decision Processes by Approximate Policy Refinement (PDF, talk) (ADHS) Compositional Analysis of Hybrid Systems Defined Over Finite Alphabets (PDF, talk) (ADHS) Interacting Particle System-Based Estimation of Reach Probability for a Generalized Stochastic Hybrid System (PDF, talk) (ADHS) A controlled sewer system should be treated as a sampled data system with events (PDF, talk) (ADHS) An Interval-Based Sliding Horizon Motion Planning Method (PDF, talk) (ADHS) Falsification of Temporal Logic Requirements Using Gradient Based Local Search in Space and Time (PDF, talk) (ADHS) Computing Controlled Invariant Sets for Hybrid Systems with Applications to Model-Predictive Control (PDF, talk) (ADHS) Temporal Logic Control of POMDPs Via Label-Based Stochastic Simulation Relations (PDF, talk) (ADHS) Mission Planning for Multiple Vehicles with Temporal Specifications using UxAS (PDF, talk) (ADHS) Input Design for Nonlinear Model Discrimination Via Affine Abstraction (PDF, talk) (ADHS) Sufficient Conditions for Temporal Logic Specifications in Hybrid Dynamical Systems (PDF, talk) (ADHS) Algorithm for Bernstein Polynomial Control Design (PDF, talk) (ADHS) On Generating A Variety of Unsafe Counterexamples for Linear Dynamical Systems (PDF, talk) (ADHS) On invariance and reachability on semialgebraic sets for linear dynamics (PDF, talk) (ADHS) Data-Driven Switched Affine Modeling for Model Predictive Control (PDF, talk) (ADHS) Symbolic Models for Incrementally Stable Switched Systems with Aperiodic Time Sampling (PDF, talk) (ADHS) Optimization-Based Design of Bounded-Error Estimators Robust to Missing Data (PDF, talk)
BDD	(RCRA) Encoding PB Constraints into SAT via Binary Adders and BDDs -- Revisited (PDF, talk)
Behavioural equivalence	(CAV) The DEEPSEC prover (PDF, talk)
Behavioural metrics	(LICS) A van Benthem Theorem for Fuzzy Modal Logic (PDF, talk)
Belenios	(CSF) Machine-checked proofs for electronic voting: privacy and verifiability for Belenios (PDF, talk)
Belief Function Theory	(PRUV) Evidential Group Decision Making Model with Belief-Based Preferences (PDF, talk)
belief merging	(PRUV) Measuring Disagreement among Knowledge Bases (PDF, talk)
benchmark	(Linearity/TLLA) Benchmarking Linear Logic Translations (PDF, talk)
Benchmarking	(ICLP) Experimenting with robotic intra-logistics domains (PDF, talk) (LICS) A Simple and Optimal Complementation Algorithm for Büchi Automata (PDF, talk)
beta reduction	(NLCS) Do different syntactic trees yield different logical readings? Some remarks on head variables in typed lambda calculus. (PDF, talk)
Beth models	(LICS) Computability Beyond Church-Turing via Choice Sequences (PDF, talk)
Betweenness Centrality	(SAT) Centrality-Based Improvements to CDCL Heuristics (PDF, talk)
Bi-directional Grammars	(ICLP) Specifying and Verbalising Answer Set Programs in Controlled Natural Language (PDF, talk)
bi-intuitionistic logic	(CL&C) (Short Paper) Towards a Dualized Sequent Calculus with Canonicity (PDF, talk)
bicategories	(HDRA) Merge-bicategories: towards semi-strictification of higher categories (PDF, talk)
Bidding games	(SR) Infinite-Duration Richman Bidding Games (PDF, talk)
Biform theories	(ITP) HOL Light QE (PDF, talk)
Bimonad	(FSCD) Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories (PDF, talk)
binarized neural network	(SAT) Constrained Image Generation Using Binarized Neural Networks with Decision Procedures (PDF, talk)
Binary Analysis	(SAT) Effective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition (PDF, talk)
Binary Encoding	(PC) Resolution and the binary encoding of combinatorial principles (PDF, talk)
binary search tree	(ITP) Verified Analysis of Random Binary Tree Structures (PDF, talk)
binder mobility	(LFMTP) Functional programming with λ-tree syntax: a progress report (PDF, talk)
Binders	(LFMTP) Abstract Representation of Binders in OCaml using the Bindlib Library (PDF, talk)
Binding operations	(UNIF) Efficiency of a Good but not Linear Nominal Unification Algorithm (PDF, talk)
Bioinformatics	(ICLP) Phylotastic: An Experiment in Creating, Manipulating, and Evolving Phylogenetic Biology Workflows Using Logic Programming (PDF, talk)
bisimulation	(VEMDP) Using Transitivity and Modularity in Chemical Reaction Network Bisimulation (PDF, talk) (LICS) Quasi-Open Bisimilarity with Mismatch is Intuitionistic (PDF, talk)
Bit-vectors	(CAV) BTOR2, BtorMC and Boolector 3.0 (PDF, talk)
Bitvectors	(WST) Complexity Analysis for Bitvector Programs (PDF, talk)
black-box optimization	(SAT) ALIAS: A Modular Tool for Finding Backdoors for SAT (PDF, talk)
Blockchain	(SMT) SMT-based Compile-time Verification of Safety Properties for Smart Contracts (PDF, talk)
blocked clauses	(IJCAR) Extended Resolution Simulates DRAT (PDF, talk)
boolean algebra	(LICS) Classical realizability as a classifier for nondeterminism (PDF, talk)
Boolean Functional synthesis	(CAV) What’s hard about Boolean Functional Synthesis? (PDF, talk)
Boolean games	(SR) Local Equilibria in Logic-Based Multi-Player Games (PDF, talk)
Boolean polynomials	(SCSC) Refutation of Products of Linear Polynomials (PDF, talk)
Boolean satisfiability	(ICLP-DC) Model Revision of Logical Regulatory Networks using Logic-based Tools (PDF, talk) (IJCAR) A SAT-Based Approach to Learn Explainable Decision Sets (PDF, talk)
Boolean-valued models	(LICS) Boolean-Valued Semantics for Stochastic Lambda-Calculus (PDF, talk)
Boot code	(CAV) Model Checking Boot Code from AWS Data Centers (PDF, talk)
bottom-up	(ICLP) Top-down and Bottom-up Evaluation Reconciled (PDF, talk)
Bounded	(UNIF) Bounded ACh Unification (PDF, talk)
bounded arithmetic	(TYDI) Proof complexity of deep inference: a survey (PDF, talk) (LCC) Feasibly constructive proofs of succinct weak circuit lower bounds (PDF, talk) (PC) Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk) (PC) Bounded induction without parameters (PDF, ) (PC) Complexity of expander-based reasoning and the power of monotone proofs (PDF, talk)
Bounded expansion	(LICS) Parameterized circuit complexity of model-checking on sparse structures (PDF, talk)
bounded model checking	(CAV) JBMC: A Bounded Model Checking Tool for Verifying Java Bytecode (PDF, talk) (CAV) Lazy Self-Composition for Security Verification (PDF, talk)
bounded model-checking	(VSTTE) Lattice-Based Refinement in Bounded Model Checking (PDF, talk)
bounded synthesis	(CAV) Synthesizing Reactive Systems from Hyperproperties (PDF, talk)
bounds on leakage	(CSF) Symbolic Side-Channel Analysis for Probabilistic Programs (PDF, talk)
Braidings	(HDRA) Termination in linear (2,2)-categories with braidings and duals (PDF, talk)
branching programs	(PC) Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk)
broadcast communication	(CSF) A Cryptographic Look at Multi-Party Channels (PDF, talk)
Brzozowski derivatives	(LaSh) A Derivative-Based Decision Procedure for WS1S (PDF, talk)
Buchberger algorithm	(HDRA) Generalizations of the associative operad and convergent rewrite systems (PDF, talk)
Buchi Automaton	(MoRe) Logically-Constrained Reinforcement Learning (PDF, talk)
Bug Finding	(CAV) Partial Order Aware Concurrency Sampling (PDF, talk)
bug finding tool	(CAV) SimpleCAR: An Efficient Bug-Finding Tool Based On Approximate Reachability (PDF, talk)
Böhm trees	(FSCD) Strict Ideal Completions of the Lambda Calculus (PDF, talk) (LICS) Probabilistic Böhm Trees and Probabilistic Separation (PDF, talk)
Büchi Automaton	(LICS) A Simple and Optimal Complementation Algorithm for Büchi Automata (PDF, talk)
C
C code	(FM) Verifying Auto-Generated C Code from Simulink (PDF, talk)
C Programming Language	(WST) Complexity Analysis for Bitvector Programs (PDF, talk)
cache coherence protocols	(CAV) Eager Abstraction for Symbolic Model Checking (PDF, talk)
Cached Address Translation	(ITP) Program Verification in the Presence of Cached Address Translation (PDF, talk)
calculational method	(ITP) Towards Verified Handwritten Calculational Proofs (short paper) (PDF, talk)
Calculational proof	(ITP) CalcCheck: A Proof Checker for Teaching the “Logical Approach to Discrete Math” (PDF, talk)
calculus of structures	(TYDI) Truely Concurrent Processes in the Calculus of Structures (PDF, talk)
call by push value	(ITP) A Formal Equational Theory for Call-By-Push-Value (PDF, talk)
call by value	(LICS) Eager Functions as Processes (PDF, talk)
call-by-name	(Linearity/TLLA) The Bang Calculus and the Two Girard's Translations (PDF, talk)
call-by-need evaluation	(WPTE) Optimizing Space of Parallel Processes (PDF, talk)
call-by-push value	(Linearity/TLLA) The Bang Calculus and the Two Girard's Translations (PDF, talk)
call-by-value	(Linearity/TLLA) The Bang Calculus and the Two Girard's Translations (PDF, talk) (ITRS) Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (PDF, talk)
CAMUS	(SAT) Finding all Minimal Safe Inductive Sets (PDF, talk)
car assembly operations	(ICLP) Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming (PDF, talk)
Cardinality Constraint	(SAT) Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT (PDF, talk)
cardinality encodings	(SAT) PySAT: A Python Toolkit for Prototyping with SAT Oracles (PDF, talk)
Cartesian cubes	(HoTT/UF) Cubical Computational Type Theory (PDF, talk)
Cartesian Genetic Programming	(CAV) ADAC: Automated Design of Approximate Circuits (PDF, talk)
Cartesian Monoids	(HDRA) Minimal Bacus FP is Turing Complete (PDF, talk)
case study	(FM) Verifying Auto-Generated C Code from Simulink (PDF, talk) (RCRA) Optimal Fault-Tolerant Placement of Relay Nodes in a Mission Critical Wireless Network (PDF, talk)
Catalan numbers	(HOR) Combinatorics of explicit substitutions (extended abstract) (PDF, talk)
categorial grammar	(NLCS) Do different syntactic trees yield different logical readings? Some remarks on head variables in typed lambda calculus. (PDF, talk)
Categorical Logic	(TYDI) Some incoherent musings on deep inference and combinatorial proofs (PDF, talk) (LICS) The Syntax and Semantics of Quantitative Type Theory (PDF, talk) (LICS) LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic (PDF, talk) (PARIS) LMSO: A Curry-Howard Approach to Church’s Synthesis via Linear Logic (PDF, talk)
Categorical model	(LICS) Syntax and Semantics for Operations with Scopes (PDF, talk)
Categorical models	(HoTT/UF) Dependent Right Adjoint Types (PDF, talk) (Linearity/TLLA) On the Lambek Calculus with an Exchange Modality (PDF, talk) (LICS) Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types (PDF, talk)
Categorical Quantum Mechanics	(FSCD) A diagrammatic axiomatisation of fermionic quantum circuits (PDF, talk) (LICS) Two complete axiomatisations of pure-state qubit quantum computing (PDF, talk) (LICS) A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics (PDF, talk) (LICS) Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics (PDF, talk)
Categorical semantics	(HoTT/UF) Algebraic models of dependent type theory (PDF, talk) (Linearity/TLLA) Towards a Functional Language for Species of Structures (PDF, talk) (LICS) A Logical Account for Linear Partial Differential Equations (PDF, talk) (LICS) Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams (PDF, talk) (LICS) A General Framework for Relational Parametricity (PDF, talk)
categories with families	(HoTT/UF) Towards the syntax and semantics of higher dimensional type theory (PDF, talk)
Categorification	(HDRA) Termination in linear (2,2)-categories with braidings and duals (PDF, talk)
category theory	(FSCD) Call-by-name Gradual Type Theory (PDF, talk) (SR) Compositional Game Theory (PDF, talk) (LICS) What's in a game? A theory of game models (PDF, talk) (LICS) A Generalized Modality for Recursion (PDF, talk) (LICS) Dialectica models of type theory (PDF, talk)
Causal Dependency	(LICS) Causal Computational Complexity of Distributed Processes (PDF, talk)
causality preservation	(CSF) A Cryptographic Look at Multi-Party Channels (PDF, talk)
Cautious Reasoning	(ICLP) Cautious Reasoning in ASP via Minimal models and Unsatisfiable Cores (PDF, talk)
cc	(ADHS) Observability of Linear Hybrid Systems with Unknown Inputs and Discrete Dynamics Modeled by Petri Nets (PDF, talk) (ADHS) Language constrained stabilization of discrete- time switched linear systems: an LMI approach (PDF, talk) (ADHS) Learning and Verification of Feedback Control Systems Using Feedforward Neural Networks (PDF, talk) (ADHS) Control Synthesis and Classification for Unicycle Dynamics Using the Gradient and Value Sampling Particle Filters (PDF, talk)
ccc	(ADHS) Statistical Verification of PCTL Using Stratified Samples (PDF, talk) (ADHS) Switch induced instabilities for stable power system DAE models (PDF, talk) (ADHS) Hierarchical Model Predictive Control for Building Energy Management of Hybrid Systems (PDF, talk) (ADHS) Network-Aware Design of State-Feedback Controllers for Linear Wireless Networked Control Systems (PDF, talk) (ADHS) Space-Time Budget Allocation for Marketing Over Social Networks (PDF, talk) (ADHS) Reachability Analysis for One Dimensional Linear Parabolic Equation (PDF, talk) (ADHS) Safety Control, a Quantitative Approach (PDF, talk) (ADHS) A switched system approach to optimize mixing of fluids (PDF, talk) (ADHS) Razumikhin-type Theorems on Practical Stability of Dynamic Equations on Time Scales (PDF, talk) (ADHS) Higher-Dimensional Timed Automata (PDF, talk) (ADHS) Verifying nonlinear analog and mixed-signal circuits with inputs (PDF, talk) (ADHS) Stability of switched systems on non-uniform time domains with non commuting matrices (PDF, talk) (ADHS) Concentration of Measure for Chance-Constrained Optimization (PDF, talk) (ADHS) Optimal Symbolic Controllers Determinization for BDD storage. (PDF, talk) (ADHS) Occupation Measure Methods for Modelling and Analysis of Biological Hybrid Systems (PDF, talk) (ADHS) On Approximate Predictability of Metric Systems (PDF, talk) (ADHS) Hybrid System Modeling of Multi-Agent Coverage Problems with Energy Depletion and Repletion (PDF, talk) (ADHS) CoasterX: A Case Study in Component-Driven Hybrid Systems Proof Automation (PDF, talk) (ADHS) Tracking Control via Variable-gain Integrator and Lookahead Simulation: Application to Leader-follower Multiagent Networks (PDF, talk) (ADHS) Bounding Errors Due to Switching Delays in Incrementally Stable Switched Systems (PDF, talk) (ADHS) Multi-Energy Scheduling Using a Hybrid Systems Approach (PDF, talk) (ADHS) Generating Dominant Strategies for Continuous Two-Player Zero-Sum Games (PDF, talk) (ADHS) Compositional Synthesis of Finite Abstractions for Continuous-Space Stochastic Control Systems: A Small-Gain Approach (PDF, talk) (ADHS) T-Barrier Certificates: A Continuous Analogy to K-Induction (PDF, talk) (ADHS) Approximate Abstractions of Markov Chains with Interval Decision Processes (PDF, talk) (ADHS) Control Synthesis for Stochastic Switched Systems Using the Tamed Euler Method (PDF, talk) (ADHS) Compositional Abstraction-based Synthesis for Cascade Discrete-Time Control Systems (PDF, talk) (ADHS) Nonuniform abstractions, refinement and controller synthesis with novel BDD encodings (PDF, talk) (ADHS) Benchmarks for Cyber-Physical Systems: A Modular Model Library for Building Automation Systems (PDF, talk) (ADHS) Temporal Logic Control of General Markov Decision Processes by Approximate Policy Refinement (PDF, talk) (ADHS) Compositional Analysis of Hybrid Systems Defined Over Finite Alphabets (PDF, talk) (ADHS) Interacting Particle System-Based Estimation of Reach Probability for a Generalized Stochastic Hybrid System (PDF, talk) (ADHS) A controlled sewer system should be treated as a sampled data system with events (PDF, talk) (ADHS) An Interval-Based Sliding Horizon Motion Planning Method (PDF, talk) (ADHS) Falsification of Temporal Logic Requirements Using Gradient Based Local Search in Space and Time (PDF, talk) (ADHS) Computing Controlled Invariant Sets for Hybrid Systems with Applications to Model-Predictive Control (PDF, talk) (ADHS) Temporal Logic Control of POMDPs Via Label-Based Stochastic Simulation Relations (PDF, talk) (ADHS) Mission Planning for Multiple Vehicles with Temporal Specifications using UxAS (PDF, talk) (ADHS) Input Design for Nonlinear Model Discrimination Via Affine Abstraction (PDF, talk) (ADHS) Sufficient Conditions for Temporal Logic Specifications in Hybrid Dynamical Systems (PDF, talk) (ADHS) Algorithm for Bernstein Polynomial Control Design (PDF, talk) (ADHS) On Generating A Variety of Unsafe Counterexamples for Linear Dynamical Systems (PDF, talk) (ADHS) On invariance and reachability on semialgebraic sets for linear dynamics (PDF, talk) (ADHS) Data-Driven Switched Affine Modeling for Model Predictive Control (PDF, talk) (ADHS) Symbolic Models for Incrementally Stable Switched Systems with Aperiodic Time Sampling (PDF, talk) (ADHS) Optimization-Based Design of Bounded-Error Estimators Robust to Missing Data (PDF, talk)
ccg	(NLCS) Automated Reasoning from Polarized Parse Trees (PDF, talk)
CCSL	(REFINE) Ordering strict partial orders to model behavioural refinement (PDF, talk)
CDCL	(SAT) Machine Learning-based Restart Policy for CDCL SAT Solvers (PDF, talk) (SAT) Chronological Backtracking (PDF, talk) (SAT) Centrality-Based Improvements to CDCL Heuristics (PDF, talk) (Isabelle) A Verified SAT Solver with Watched Literals Using Imperative HOL (Extended Abstract) (PDF, talk)
cdcl-cuttingplanes	(SAT) Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers (PDF, talk)
Cedille	(ITP) Efficient Mendler-Style Lambda-Encodings in Cedille (PDF, talk)
CEGIS	(CAV) Counterexample Guided Inductive Synthesis Modulo Theories (PDF, talk)
Cellular automata	(DCM) A Category Theoretic Interpretation of Gandy’s Principles for Mechanisms (PDF, talk)
cellular cohomology	(LICS) Cellular Cohomology in Homotopy Type Theory (PDF, talk)
Centrality	(SAT) Centrality-Based Improvements to CDCL Heuristics (PDF, talk)
certificate checking	(ITP) Tactics and certificates in Meta Dedukti (PDF, talk)
certificates	(SAT) Polynomial-Time Validation of QCDCL Certificates (PDF, talk)
certification	(IWC) Certified Ordered Completion (PDF, talk)
certified code	(ITP) A Formally Verified Solver for Homogeneous Linear Diophantine Equations (PDF, talk)
Certified execution engine	(ITP) A Coq formalisation of SQL’s execution engines (PDF, talk)
certified software	(ITP) Towards Certified Meta-Programming with Typed Template-Coq (PDF, talk)
channel composition	(FM) An Algebraic Approach for Reasoning About Information Flow (PDF, talk)
chat bot	(UITP) Automated Theorem Proving in a Chat Environment (PDF, talk)
chemical computation	(VEMDP) Computing Properties of Stable Configurations of Thermodynamic Binding Networks (PDF, talk)
Chemical reaction networks	(VEMDP) Noise Control for Molecular Computing (PDF, talk) (VEMDP) Using Transitivity and Modularity in Chemical Reaction Network Bisimulation (PDF, talk)
Chinese monoids	(HDRA) String data structures for Chinese monoids (PDF, talk)
Choice Logic	(PRUV) A new logic for jointly representing hard and soft constraints (PDF, talk)
Choice sequences	(LICS) Computability Beyond Church-Turing via Choice Sequences (PDF, talk)
choiceless polynomial time	(LICS) On computability and tractability for infinite sets (PDF, talk)
Chronological Backtracking	(SAT) Chronological Backtracking (PDF, talk)
Church's type theory	(ITP) HOL Light QE (PDF, talk)
Church-Turing thesis	(WST) Objective and Subjective Specifications (PDF, talk)
circuit	(SAT) Circuit-based Search Space Pruning in QBF (PDF, talk)
Circuit complexity	(LICS) Parameterized circuit complexity of model-checking on sparse structures (PDF, talk)
circuit lower bounds	(LCC) Feasibly constructive proofs of succinct weak circuit lower bounds (PDF, talk)
circuit satisfiability	(LICS) Satisfiability in multi-valued circuits (PDF, talk)
circular proofs	(PARIS) Local validity for circular proofs in linear logic with fixed points (PDF, talk)
classical arithmetic	(LICS) A sequent calculus with dependent types for classical arithmetic (PDF, talk)
classical B	(AVOCS) Writing a Model Checker in 80 Days: Reusable Libraries and Custom Implementation (PDF, talk)
classical higher-order logic	(ARQNL) System Demonstration: The Higher-Order Prover Leo-III (PDF, talk)
classical linear logic	(WiL) A New Linear Logic for Deadlock-Free Session-Typed Processes (Talk Abstract) (PDF, talk)
classical logic	(TYDI) An introduction to deep inference (PDF, talk) (TYDI) Some incoherent musings on deep inference and combinatorial proofs (PDF, talk) (CL&C) Some ideas on cut-elimination for cyclic arithmetic proofs (PDF, talk)
classical realizability	(ITP) Formalizing Implicative Algebras in Coq (PDF, talk) (LICS) Classical realizability as a classifier for nondeterminism (PDF, talk) (LICS) A sequent calculus with dependent types for classical arithmetic (PDF, talk)
Classical sequent calculus	(CL&C) Herbrand's Theorem as Higher-Order Recursion (PDF, talk)
Clause Learning	(ITP) A Coq Tactic for Equality Learning in Linear Arithmetic (PDF, talk)
CLF	(Linearity/TLLA) Formalization of Automated Trading Systems in a Concurrent Linear Framework (PDF, talk)
clocks	(LICS) Guarded Computational Type Theory (PDF, talk)
cluster algebra	(IWC) Complete Axiom System of Cluster Algebra (PDF, talk)
CNF	(POS) The Effect of Scrambling CNFs (PDF, talk)
CNF configuration	(RCRA) On the Configuration of SAT Formulae (PDF, talk)
Co-Simulation	(Overture) Overture FMU: Export VDM-RT Models as Tool-Wrapper FMUs (PDF, talk) (Overture) Multi-modelling of Cooperative Swarms (PDF, talk)
Coalgebra Modality	(FSCD) Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories (PDF, talk)
Coarse computability	(LICS) An answer to the Gamma question (PDF, talk)
Coarse-grained modeling	(VEMDP) Computational Approaches for the Programmed Assembly of Nanocellulose Meshes (PDF, talk)
CoCoA and MathSAT	(SCSC) New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square (PDF, talk)
codatatypes	(IJCAR) Superposition with Datatypes and Codatatypes (PDF, talk)
code generation	(F-IDE) A Notebook Format for the Holistic Design of Embedded Systems (PDF, talk) (ITP) Software Verification with ITPs Should Use Binary Code Extraction to Reduce the TCB (short paper) (PDF, talk) (ITP) Fast machine words in Isabelle/HOL (PDF, talk) (ITP) A Formally Verified Solver for Homogeneous Linear Diophantine Equations (PDF, talk) (ICLP) Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP (PDF, talk) (Isabelle) Lazy Algebraic Types in Isabelle/HOL (PDF, talk)
Code Generators	(Overture) ViennaVM: a Virtual Machine for VDM-SL development (PDF, talk)
code review	(FM) Evidential and Continuous Integration of Software Verification Tools (PDF, talk)
code-generation	(Overture) Enhancing Testing of VDM-SL models (PDF, talk)
coends	(Linearity/TLLA) Proof nets, coends and the Yoneda isomorphism (PDF, talk)
Cognitive Modeling	(LPOP) Confluence Analysis of Cognitive Models with Constraint Handling Rules (PDF, talk)
cographs	(Linearity/TLLA) Coherent interaction graphs: a nondeterministic geometry of interaction for MLL (PDF, talk)
coherence	(FSCD) Coherence of Gray categories via rewriting (PDF, talk) (HoTT/UF) Towards the syntax and semantics of higher dimensional type theory (PDF, talk) (IWC) Coherence of monoids by insertions (PDF, talk) (IWC) Coherence modulo relations (PDF, talk) (HDRA) Merge-bicategories: towards semi-strictification of higher categories (PDF, talk)
coherence theorems	(LICS) Ribbon tensorial logic (PDF, talk)
coherent presentations	(HDRA) String data structures for Chinese monoids (PDF, talk)
coinduction	(FSCD) Term rewriting characterisation of LOGSPACE for finite and infinite data (PDF, talk) (HCVS) Towards Coinductive Theory Exploration in Horn Clause Logic: Extended Abstract (PDF, talk) (IJCAR) A Coinductive Approach to Proving Reachability in Logically Constrained Term Rewriting Systems (PDF, talk) (LICS) Every λ-Term is Meaningful for the Infinitary Relational Model (PDF, talk) (PARIS) Coinductive Uniform Proofs: An Extended Abstract (PDF, talk) (PARIS) Local validity for circular proofs in linear logic with fixed points (PDF, talk)
coinduction up-to	(LICS) Sound up-to techniques and Complete abstract domains (PDF, talk)
Coinductive Invariants	(HCVS) Towards Coinductive Theory Exploration in Horn Clause Logic: Extended Abstract (PDF, talk)
coinductive types	(ITP) The Coinductive Formulation of Common Knowledge (PDF, talk)
Combination	(IJCAR) Complexity of Combinations of Qualitative Constraint Satisfaction Problems (PDF, talk)
Combinatorial benchmarks	(SAT) Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers (PDF, talk)
combinatorial proofs	(TYDI) Some incoherent musings on deep inference and combinatorial proofs (PDF, talk) (IJCAR) From Syntactic Proofs to Combinatorial Proofs (PDF, talk)
combinatorial search algorithms	(RCRA) Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic (PDF, talk)
combinatoric	(Linearity/TLLA) How to count linear and affine closed lambda terms? (PDF, talk)
combinatorics	(FSCD) Counting Environments and Closures (PDF, talk) (Linearity/TLLA) Towards a Functional Language for Species of Structures (PDF, talk) (HOR) Combinatorics of explicit substitutions (extended abstract) (PDF, talk) (HDRA) Generalizations of the associative operad and convergent rewrite systems (PDF, talk)
combinators	(LICS) Regular Transducer Expressions for Regular Transformations over infinite words (PDF, talk)
combinatory logic	(FSCD) On repetitive right application of B-terms (PDF, talk)
common knowledge	(ITP) The Coinductive Formulation of Common Knowledge (PDF, talk)
Common Language for Geometric Problems	(ThEdu) Rating of Geometric Automated Theorem Provers (PDF, talk)
Commonsense Reasoning	(ICLP) Learning Commonsense Knowledge through Interactive Dialogue (PDF, talk)
Comonads	(NLCS) Propositional Attitude Operators in Homotopy Type Theory (PDF, talk)
Comparator	(CAV) Automata vs Linear-Programming Discounted-Sum Inclusion (PDF, talk)
comparator network	(POS) Competitive Sorter-based Encoding of PB-Constraints into SAT (PDF, talk)
comparison systems	(FM) Vector Barrier Certificates and Comparison Systems (PDF, talk)
CompCert	(FCS) A Study on the Preservation on Cryptographic Constant-Time Security in the CompCert Compiler (PDF, talk)
Competition	(POS) The Effect of Scrambling CNFs (PDF, talk)
compiler	(VEMDP) Equivalence of Chemical Reaction Networks in a CRN-to-DNA Compiler Framework (PDF, talk)
Compilers	(SAT) Effective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition (PDF, talk)
complementary approximate reachability	(CAV) SimpleCAR: An Efficient Bug-Finding Tool Based On Approximate Reachability (PDF, talk)
Complementation	(LICS) A Simple and Optimal Complementation Algorithm for Büchi Automata (PDF, talk)
complete abstract domains	(LICS) Sound up-to techniques and Complete abstract domains (PDF, talk)
complete lattices	(ITP) Formalizing Implicative Algebras in Coq (PDF, talk)
Complete Segal Spaces	(HoTT/UF) (Truncated) Simplicial Models of Type Theory (PDF, talk)
completeness	(FSCD) Completeness of Tree Automata Completion (PDF, talk) (ADSL) A Complete Proof System for Basic Symbolic Heaps with Permissions (PDF, talk) (IJCAR) Formalizing Bachmair and Ganzinger's Ordered Resolution Prover (PDF, talk)
completion	(FSCD) Completion for Logically Constrained Rewriting (PDF, talk) (Coq) ComplCoq: Rewrite Hint Construction with Completion Procedures (PDF, talk) (IJCAR) MaedMax: A Maximal Ordered Completion Tool (PDF, talk)
Complexity	(FSCD) Counting Environments and Closures (PDF, talk) (FM) Timed Vacuity (PDF, talk) (ADSL) The Complexity of Prenex Separation Logic with One Selector (PDF, talk) (ADSL) On the Complexity of Pointer Arithmetic in Separation Logic (PDF, talk) (IJCAR) Complexity of Combinations of Qualitative Constraint Satisfaction Problems (PDF, talk) (Isabelle) Formal Verification of Bounds for the LLL Basis Reduction Algorithm (PDF, talk)
Complexity Analysis	(LCC) A General Equational Framework for Static Profiling of Parametric Resource Usage (PDF, talk) (WST) Complexity Analysis for Bitvector Programs (PDF, talk)
complexity classes	(FSCD) Unique perfect matchings and proof nets (PDF, talk)
complexity dichotomy	(LICS) A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP (PDF, talk)
Complexity measures	(SAT) Cops-Robber games and the resolution of Tseitin formulas (PDF, talk)
Complexity Proving	(WST) A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving (PDF, talk)
complexity results	(MoRe) Constraint Problem for Weak Subgame Perfect Equilibria with omega-regular Boolean Objectives (PDF, talk)
Complexity Theory	(Linearity/TLLA) Entropy and Complexity Lower Bounds (PDF, talk)
composition	(FM) Modular Verification of Programs with Effects and Effect Handlers in Coq (PDF, talk) (CSF) Composition Theorems for CryptoVerif and Application to TLS 1.3 (PDF, talk)
compositional analysis of software systems	(AVOCS) Using SMT engine to generate Symbolic Automata (PDF, talk)
compositional model checking	(FM) To Compose, Or Not to Compose, That is the Question: An Analysis of Compositional State Space Generation (PDF, talk)
compositional reasoning	(FM) Compositional Reasoning for Shared-variable Concurrent Programs (PDF, talk)
Compositional verification	(AVOCS) A Framework for the Formal Verification of Networks of Railway Interlockings - Application to the Belgian Railways (PDF, talk)
compositionality	(SR) Compositional Game Theory (PDF, talk) (LICS) Compositional game theory (PDF, talk)
Computability	(WiL) On Expanding Standard Notions of Constructivity (PDF, talk) (WST) Improving Static Dependency Pairs for Higher-Order Rewriting (PDF, talk) (CAV) Program Analysis is Harder than Verification: A Computability Perspective (PDF, talk) (LICS) An answer to the Gamma question (PDF, talk)
computation and deduction	(LFMTP) Computation-as-deduction in Abella: work in progress (PDF, talk)
Computation Complexity	(LICS) Causal Computational Complexity of Distributed Processes (PDF, talk)
Computation Tree Logic	(LICS) Automaton-Based Criteria for Membership in CTL (PDF, talk)
computational complexity	(VEMDP) Using Transitivity and Modularity in Chemical Reaction Network Bisimulation (PDF, talk) (LCC) Computability over locally finite structures from algebra (PDF, talk) (LCC) Completeness in the Second Level of the Polynomial Time Hierarchy through Syntactic Properties (PDF, talk) (LICS) A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games (PDF, talk)
Computational Hardness	(CAV) What’s hard about Boolean Functional Synthesis? (PDF, talk)
computational model	(CSF) Composition Theorems for CryptoVerif and Application to TLS 1.3 (PDF, talk)
Computational modeling	(VEMDP) Computational Approaches for the Programmed Assembly of Nanocellulose Meshes (PDF, talk)
computational monads	(LICS) An algebraic theory of Markov processes (PDF, talk)
Computational Reductions	(ITP) Verification of PCP-Related Computational Reductions in Coq (PDF, talk)
computational soundness	(CSF) Symbolic security of garbled circuits (PDF, talk)
Computational thinking	(LICS) Sequential Relational Decomposition (PDF, talk)
computational type theory	(HoTT/UF) Cubical Computational Type Theory (PDF, talk) (LFMTP) The RedPRL Proof Assistant (PDF)
computer aided security proofs	(CSF) Computer-aided proofs for multiparty computation with active security (PDF, talk)
Computer Algebra	(SCSC) A Practical Polynomial Calculus for Arithmetic Circuit Verification (PDF, talk)
computer-aided cryptography	(CSF) Machine-checked proofs for electronic voting: privacy and verifiability for Belenios (PDF, talk)
concurrency	(FM) Operational Semantics of a Weak Memory Model with Channel Synchronization (PDF, talk) (LICS) ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency (PDF, talk) (REFINE) Challenges of specifying concurrent program components (PDF, talk)
concurrency and distributed computation	(LICS) Work Analysis with Resource-Aware Session Types (PDF, talk)
Concurrency Testing	(CAV) Partial Order Aware Concurrency Sampling (PDF, talk)
Concurrent datatypes	(FM) View abstraction for systems with component identities (PDF, talk)
Concurrent games	(LICS) The concurrent game semantics of Probabilistic PCF (PDF, talk)
Concurrent objects	(REFINE) Correctness of Concurrent Objects under Weak Memory Models (PDF, talk) (REFINE) Refining Santa: An Excercise in Efficient Synchronization (PDF, talk)
Concurrent operation specification	(REFINE) Challenges of specifying concurrent program components (PDF, talk)
Concurrent Process Calculi	(LICS) Causal Computational Complexity of Distributed Processes (PDF, talk)
concurrent program algebra	(FM) Encoding fairness in a synchronous concurrent program algebra (PDF, talk)
Concurrent Separation Logic	(LICS) An Asynchronous Soundness Theorem for Concurrent Separation Logic (PDF, talk)
Concurrent strategies	(LICS) What's in a game? A theory of game models (PDF, talk)
Condition Synchronization	(AVOCS) Detecting Deadlocks in Formal System Models with Condition Synchronization (PDF, talk)
Conditional Independence	(CAV) Constrained Dynamic Partial Order Reduction (PDF, talk)
conditional rewriting	(IWC) Convergence of Simultaneously and Sequentially Unraveled TRSs for Normal Conditional TRSs (PDF, talk)
conditional term rewriting	(FSCD) Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (PDF, talk)
conditional value at risk	(LICS) Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes (PDF, talk)
Confidentiality	(CSF) A Cryptographic Look at Multi-Party Channels (PDF, talk) (CSF) The Complexity of Monitoring Hyperproperties (PDF, talk)
Conflict-Driven Clause Learning	(CAV) The Proof Complexity of SMT Solvers (PDF, talk)
Conflict-driven search	(SAT) In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving (PDF, talk)
confluence	(FSCD) Confluence of Prefix-Constrained Rewrite Systems (PDF, talk) (FSCD) Strict Ideal Completions of the Lambda Calculus (PDF, talk) (FSCD) Decreasing diagrams with two labels are complete for confluence of countable systems (PDF, talk) (IWC) Towards a Verified Decision Procedure for Confluence of Ground Term Rewrite Systems in Isabelle/HOL (PDF, talk) (IWC) Convergence of Simultaneously and Sequentially Unraveled TRSs for Normal Conditional TRSs (PDF, talk)
Confluence Analysis	(LPOP) Confluence Analysis of Cognitive Models with Constraint Handling Rules (PDF, talk)
Confluence and Standardization	(HDRA) Minimal Bacus FP is Turing Complete (PDF, talk)
confluence competition	(IJCAR) Cops and CoCoWeb: Infrastructure for Confluence Tools (PDF, talk)
Confluence modulo	(IWC) Coherence modulo relations (PDF, talk)
confluence tool	(IJCAR) Cops and CoCoWeb: Infrastructure for Confluence Tools (PDF, talk)
Confusion	(LICS) Concurrency and Probability: Removing Confusion, Compositionally (PDF, talk)
Connection-based proof-search	(ARQNL) Labelled Connection-based Proof Search for Multiplicative Intuitionistic Linear Logic (PDF, talk)
cons-free computation	(LCC) Computability over locally finite structures from algebra (PDF, talk)
Conservative approximation	(VEMDP) Conservative Approximations of Polymers (PDF, talk)
Conservativity	(LICS) Around Classical and Intuitionistic Linear Logics (PDF, talk)
consistency	(CAV) Monitoring Weak Consistency (PDF, talk)
Consistency Analysis	(AVOCS) Analyzing Consistency of Formal Requirements (PDF, talk)
Consistency Checking	(DS-FM) Consistency Checking of Functional Requirements (PDF, talk)
Consistency proofs	(CL&C) Some ideas on cut-elimination for cyclic arithmetic proofs (PDF, talk)
constant-time security	(FCS) A Study on the Preservation on Cryptographic Constant-Time Security in the CompCert Compiler (PDF, talk)
Constrained Horn Clauses	(ICLP) Solving Horn Clauses on Inductive Data Types Without Induction (PDF, talk) (WPTE) Verification of Ada Programs with AdaHorn (PDF, talk) (SMT) Discovering Universally Quantified Solutions for Constrained Horn Clauses (PDF, talk)
Constrained Optimization	(RCRA) Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper) (PDF, talk)
constrained rewriting	(FSCD) Completion for Logically Constrained Rewriting (PDF, talk) (WPTE) On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems (PDF, talk)
Constraint Handling Rules	(ICLP) A New Proof-theoretical Linear Semantics for CHR (PDF, talk) (ICLP) Shape Neutral Analysis of Graph-based Data-structures (PDF, talk) (ICLP) CHRvis: Syntax and Semantics (PDF, talk) (LPOP) Confluence Analysis of Cognitive Models with Constraint Handling Rules (PDF, talk)
Constraint Handling Rules (CHR)	(LPOP) Security Policies in Constraint Handling Rules (PDF, talk)
Constraint Language	(LaSh) Automated Constraint Modelling with Conjure (PDF, talk) (LaSh) ESSENCE, A Language for Specifying Combinatorial Problems: What, Why and So What? (PDF, talk)
Constraint Logic Programming	(HCVS) Metaprogramming and symbolic execution for detecting runtime errors in Erlang programs (PDF, talk)
Constraint Logic Programming on Finite Domains	(RCRA) Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper) (PDF, talk)
Constraint Modelling	(LaSh) Automated Constraint Modelling with Conjure (PDF, talk) (LaSh) ESSENCE, A Language for Specifying Combinatorial Problems: What, Why and So What? (PDF, talk)
constraint problem	(MoRe) Constraint Problem for Weak Subgame Perfect Equilibria with omega-regular Boolean Objectives (PDF, talk)
Constraint programming	(RCRA) Encoding PB Constraints into SAT via Binary Adders and BDDs -- Revisited (PDF, talk)
constraint satisfaction	(RCRA) Partial (Neighbourhood) Singleton Arc Consistency for Constraint Satisfaction Problems (PDF, talk) (RCRA) Replaceability for constraint satisfaction problems: Algorithms, Inferences, and Complexity Patterns (PDF, talk)
Constraint Satisfaction Problem	(IJCAR) Complexity of Combinations of Qualitative Constraint Satisfaction Problems (PDF, talk) (LICS) Satisfiability in multi-valued circuits (PDF, talk)
constraint satisfaction problems	(LICS) A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP (PDF, talk)
Constraint satisfaction processing	(ICLP) SMT-based Answer Set Solver CMODELS(DIFF) (System Description) (PDF, talk)
Constraint Solving	(SCSC) Constraint Systems from Traffic Scenarios for the Validation of Autonomous Driving (PDF, talk) (HCVS) Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions (PDF, talk) (ICLP) Application of Logic-Based Methods to Machine Component Design (PDF, talk) (LaSh) Automated Constraint Modelling with Conjure (PDF, talk) (IJCAR) A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems (PDF, talk)
Constraint Systems	(SCSC) Constraint Systems from Traffic Scenarios for the Validation of Autonomous Driving (PDF, talk)
Constraint-based synthesis	(CAV) Constraint-Based Synthesis of Coupling Proofs (PDF, talk)
Constraint-based verification	(CAV) Constraint-Based Synthesis of Coupling Proofs (PDF, talk)
constraints	(WiL) Towards a Logical Framework for Latent Variable Modelling (PDF, talk) (ICLP) Epistemic Logic Programs with World View Constraints (PDF, talk) (ICLP) Constraint Answer Set Programming without Grounding (PDF, talk) (ICLP) Constraint-Based Inference in Probabilistic Logic Programs (PDF, talk) (PRUV) Evidential Group Decision Making Model with Belief-Based Preferences (PDF, talk) (LPOP) Easier Rules and Constraints for Programming (PDF, talk)
constraints solver	(POS) Competitive Sorter-based Encoding of PB-Constraints into SAT (PDF, talk)
Constructive Decidability	(IJCAR) Constructive Decision via Redundancy-free Proof-Search (PDF, talk)
constructive mathematics	(LICS) Computable decision-making on the reals and other spaces via partiality and nondeterminism (PDF, talk)
Constructive Type Theory	(LFMTP) Formalization in Constructive Type Theory of the Standardization Theorem (PDF, talk)
constructivism	(WiL) Towards a Logical Framework for Latent Variable Modelling (PDF, talk)
contact logics	(UNIF) About the Unification Type of Topological Logics over Euclidean Spaces (PDF, talk)
context-free	(TERMGRAPH) A Framework for Rewriting Families of String Diagrams (PDF, talk)
Context-free Grammars	(ITP) Verification of PCP-Related Computational Reductions in Coq (PDF, talk)
contextual equivalence	(ITP) A Formal Equational Theory for Call-By-Push-Value (PDF, talk) (WPTE) Automating the Diagram Method to Prove Correctness of Program Transformations (PDF, talk)
contextual fibrancy	(HoTT/UF) Robust Notions of Contextual Fibrancy (PDF, talk)
contextuality	(LICS) Logical paradoxes in quantum computation (PDF, talk)
Continuous computation	(CL&C) Some ideas on cut-elimination for cyclic arithmetic proofs (PDF, talk)
Continuous delivery	(Overture) Integrating VDM-SL into the continuous delivery pipelines of cloud-based software (PDF, talk)
continuous systems	(FM) Vector Barrier Certificates and Comparison Systems (PDF, talk)
continuous validation	(Overture) Enhancing Testing of VDM-SL models (PDF, talk)
Continuous-time Markov chain	(CAV) Monitoring CTMCs By Multi-Clock Timed Automata (PDF, talk)
contract-based verification	(AVOCS) Climbing the Software Assurance Ladder - Practical Formal Verification for Reliable Software (PDF, talk)
contractibility	(FSCD) Proof nets for bi-intuitionistic linear logic (PDF, talk)
Contraction	(TYDI) Proof complexity of deep inference: a survey (PDF, talk)
control	(VaVAS) Adaptive Neighborhood Resizing for Stochastic Reachability in Multi-Agent Systems (PDF, talk)
control improvisation	(CAV) Reactive Control Improvisation (PDF, talk)
Control parameters	(ITP) Understanding Parameters of Deductive Verification: An Empirical Investigation of KeY (PDF, talk)
Control Theory	(VaVAS) Formal Synthesis of Control Strategies for Dynamical Systems (PDF)
Control-Flow Refinment	(WST) Control-Flow Refinement via Partial Evaluation (PDF, talk)
Controlled Natural Language	(ICLP) Natural Language Generation From Ontologies: Application Paper (PDF, talk) (ICLP-DC) Knowledge Authoring and Question Answering via Controlled Natural Language (PDF, talk) (UITP) Text-Orientated Formal Mathematics (PDF, talk)
Controlled Natural Languages	(ICLP) Specifying and Verbalising Answer Set Programs in Controlled Natural Language (PDF, talk)
controller synthesis	(FM) Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty (PDF, talk) (CAV) Controller Synthesis Made Real: Reach-avoid Specifications and Linear Dynamics (PDF, talk) (DS-FM) Heuristic-Based GR(1) Assumptions Refinement (PDF, talk)
conversion algorithm	(CAV) A Direct Encoding for NNC Polyhedra (PDF, talk)
convex polyhedra	(CAV) A Direct Encoding for NNC Polyhedra (PDF, talk)
Cooperative Scheduling	(FM) Deadlock Detection for Actor-based Coroutines (PDF, talk)
Coq	(ITP) Towards Certified Meta-Programming with Typed Template-Coq (PDF, talk) (ITP) A Coq formalisation of SQL’s execution engines (PDF, talk) (ITP) A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs (PDF, talk) (ITP) Reification by Parametricity (PDF, talk) (ITP) Formalizing Implicative Algebras in Coq (PDF, talk) (FSCD) Cumulative Inductive Types in Coq (PDF, talk) (FM) Modular Verification of Programs with Effects and Effect Handlers in Coq (PDF, talk) (Coq) Teaching Your Rooster to Crow in C (PDF, talk) (Coq) Procrastination, A proof engineering technique (PDF, talk) (Coq) Classical Analysis with Coq (PDF, talk) (Coq) Towards a formalization of the guard condition (PDF, talk) (LFMTP) Sharing a library between proof assistants: reaching out to the HOL family (PDF, talk) (AVOCS) Proof-Oriented Design of a Separation Kernel with Minimal Trusted Computing Base (PDF, talk)
Coq library	(Coq) Preliminary Report on the Yalla Library (PDF, talk)
Coq proof assistant	(FCS) A Study on the Preservation on Cryptographic Constant-Time Security in the CompCert Compiler (PDF, talk)
Core SAT	(SAT) Chronological Backtracking (PDF, talk)
Corecursion	(HCVS) Towards Coinductive Theory Exploration in Horn Clause Logic: Extended Abstract (PDF, talk)
correctness	(WPTE) Automating the Diagram Method to Prove Correctness of Program Transformations (PDF, talk) (REFINE) Correctness of Concurrent Objects under Weak Memory Models (PDF, talk)
Correctness by extraction	(ITP) Proof Pearl: Constructive Extraction of Cycle Finding Algorithms (PDF, talk)
correctness criteria	(FSCD) Unique perfect matchings and proof nets (PDF, talk) (Linearity/TLLA) Coherent interaction graphs: a nondeterministic geometry of interaction for MLL (PDF, talk)
Correctness Enhancement	(REFINE) Programming Without Refinement (PDF, talk)
Correctness proof	(HCVS) A simple functional presentation and an inductive correctness proof of the Horn algorithm (PDF, talk)
Correspondence theory	(LICS) A van Benthem Theorem for Fuzzy Modal Logic (PDF, talk)
Cost Analysis	(WST) Control-Flow Refinement via Partial Evaluation (PDF, talk) (WST) Inference of Linear Upper-Bounds on the Expected Cost by Solving Cost Relations (PDF, talk)
Cost bounded reachability	(MoRe) Multiple Objectives and Cost Bounds in MDP (PDF, talk)
Cost relations	(WST) Inference of Linear Upper-Bounds on the Expected Cost by Solving Cost Relations (PDF, talk)
counter-example	(FM) Producing Explanations for Rich Logics (PDF, talk)
Counterexample-guided Algorithms	(SAT) Effective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition (PDF, talk)
Counterexample-Guided Inductive Synthesis	(CAV) Safety-Aware Apprenticeship Learning (PDF, talk)
counterexamples	(ARQNL) Evidence Extraction from Parameterised Boolean Equation Systems (PDF, talk)
counting classes	(LICS) Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth (PDF, talk)
Courcelle's Theorem	(LaSh) Courcelle’s Theorem – A Game-Theoretic Approach (PDF, talk)
Covering Theory	(HoTT/UF) Cohesive Covering Theory (PDF, talk)
CPS translation	(Linearity/TLLA) From Linear Logic to Cyclic Sharing (PDF, talk)
CR-Prolog	(ICLP-DC) Translating P-log, LP^{MLN}, LPOD, and CR-Prolog2 into Standard Answer Set Programs (PDF, talk)
CR-Prolog2	(ICLP) Translating LPOD and CR-Prolog2 into Standard Answer Set Programs (PDF, talk)
Crafted benchmarks	(SAT) Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers (PDF, talk)
Craig Interpolation	(IJCAR) Efficient Interpolation for the Theory of Arrays (PDF, talk)
critical complexity region	(RCRA) Replaceability for constraint satisfaction problems: Algorithms, Inferences, and Complexity Patterns (PDF, talk)
critical pair	(FSCD) Confluence of Prefix-Constrained Rewrite Systems (PDF, talk)
critical software assurance	(AVOCS) Climbing the Software Assurance Ladder - Practical Formal Verification for Reliable Software (PDF, talk)
Critical Systems	(AVOCS) Formal Verification of Synchronisation, Gossip and Environmental Effects for Critical IoT Systems (PDF, talk)
CRN	(VEMDP) Bayesian Verification of Chemical Reaction Networks (PDF, talk)
CRN equivalence	(VEMDP) Equivalence of Chemical Reaction Networks in a CRN-to-DNA Compiler Framework (PDF, talk)
cross-fertilization	(LICS) Sound up-to techniques and Complete abstract domains (PDF, talk)
cross-section property	(HDRA) String data structures for Chinese monoids (PDF, talk)
crowds	(FM) An Algebraic Approach for Reasoning About Information Flow (PDF, talk)
cryptographic CNF instances	(POS) CryptoMiniSat Parameter-Optimization for Solving Cryptographic Instances (PDF, talk)
cryptographic constant-time	(CSF) Secure compilation of side-channel countermeasures: the case of cryptographic “constant-time” (PDF, talk)
Cryptographic protocol	(CAV) The DEEPSEC prover (PDF, talk)
Cryptographic protocols	(FCS) Homomorphisms and Minimality for Enrich-by-Need Security Analysis (PDF, talk)
cryptographic schemes	(CSF) Self-Guarding Cryptographic Protocols against Algorithm Substitution Attacks (PDF, talk)
Cryptographic software	(CAV) SCInfer: Refinement-based Verification of Software Countermeasures against Side-Channel Attacks (PDF, talk)
Cryptography	(CAV) Continuous formal verification of Amazon s2n (PDF, talk)
CSP	(IJCAR) Complexity of Combinations of Qualitative Constraint Satisfaction Problems (PDF, talk)
CSP Solver	(LPOP) A Picat-based XCSP Solver - from Parsing, Modeling, to SAT Encoding (PDF, talk)
cubical sets	(FSCD) Internal Universes in Models of Homotopy Type Theory (PDF, talk) (HoTT/UF) Ordered Cubes (PDF, talk) (HoTT/UF) Towards a geometric model theory of type theory (PDF) (HoTT/UF) The definitional symmetric cubical structure of types in type theory with equality defined by abstraction over an interval (PDF, talk)
cubical type theory	(HoTT/UF) Dependent Right Adjoint Types (PDF, talk) (HoTT/UF) Cubical Assemblies and the Independence of the Propositional Resizing Axiom (PDF, talk) (HoTT/UF) Cubical Computational Type Theory (PDF, talk) (HoTT/UF) The definitional symmetric cubical structure of types in type theory with equality defined by abstraction over an interval (PDF, talk) (LFMTP) The RedPRL Proof Assistant (PDF) (LICS) On Higher Inductive Types in Cubical Type Theory (PDF, talk) (LICS) Degrees of Relatedness - A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory (PDF, talk)
Curry-Howard	(CL&C) On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains (PDF, talk) (LICS) Classical realizability as a classifier for nondeterminism (PDF, talk)
Curry-Howard correspondence	(WiL) A New Linear Logic for Deadlock-Free Session-Typed Processes (Talk Abstract) (PDF, talk) (SAT) Local Soundness for QBF Calculi (PDF, talk)
Curry-Howard isomorphism	(RCRA) Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic (PDF, talk)
cut elimination	(LICS) Unification nets: canonical proof net quantifiers (PDF, talk) (ITRS) Intersection Subtyping with Constructors (PDF, talk)
Cut-elimination	(CL&C) Fast cut-elimination using proof terms: an empirical study (PDF, talk) (CL&C) Some ideas on cut-elimination for cyclic arithmetic proofs (PDF, talk)
Cutting and Packing	(RCRA) An Enhanced Genetic Algorithm with the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem (PDF, talk)
Cutting planes	(SAT) Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers (PDF, talk) (SAT) In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving (PDF, talk) (PC) Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk)
Cyber Security	(PRUV) Leveraging Probabilistic Existential Rules for Adversarial Deduplication (PDF, talk)
Cyber-Physical system	(FM) Towards `Verifying' a Water Treatment System (PDF, talk) (FM) IPL: An Integration Property Language for Multi-Model Cyber-Physical Systems (PDF, talk)
cyber-physical systems	(FM) Falsification of Cyber-Physical Systems Using Deep Reinforcement Learning (PDF, talk) (LICS) A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow (PDF, talk)
Cycle finding	(ITP) Proof Pearl: Constructive Extraction of Cycle Finding Algorithms (PDF, talk)
Cyclic graphs	(TERMGRAPH) Drags: an algebraic framework for graph rewriting (PDF, talk)
cyclic induction	(CL&C) Validating Back-links of FOL$_{\mbox{\normalsize ID}}$ Cyclic Pre-proofs (PDF, talk)
cyclic lambda calculus	(Linearity/TLLA) From Linear Logic to Cyclic Sharing (PDF, talk)
cyclic proof	(ADSL) Cyclic Theorem Prover for Separation Logic by Magic Wand (PDF, talk)
Cyclic proofs	(CL&C) Some ideas on cut-elimination for cyclic arithmetic proofs (PDF, talk) (ADSL) Labelled Cyclic Proofs for Separation Logic (PDF, talk) (AVOCS) An Entailment Checker for Separation Logic with Inductive Definitions (PDF, talk) (PARIS) On the logical complexity of cyclic arithmetic (PDF, talk) (PARIS) Transitive Closure Logic: Infinitary and Cyclic Proof Systems (PDF, talk)
cyclic sharing	(Linearity/TLLA) From Linear Logic to Cyclic Sharing (PDF, talk)
Cyclic term-graps	(FSCD) Term-Graph Anti-Unification (PDF, talk)
cylindrical algebraic decomposition	(SCSC) Towards Incremental Cylindrical Algebraic Decomposition in Maple (PDF, talk) (SCSC) Evaluation of Equational Constraints for CAD in SMT Solving (PDF, talk)
D
D-optimaldesigns	(SCSC) Hard Combinatorial Problems: A Challenge for Satisfiability (PDF, talk)
data compression	(IWC) Complete Axiom System of Cluster Algebra (PDF, talk)
Data Driven modelling	(VEMDP) Bayesian Verification of Chemical Reaction Networks (PDF, talk)
Data Races	(LICS) An Asynchronous Soundness Theorem for Concurrent Separation Logic (PDF, talk)
data words	(LICS) Logics for Word Transductions with Synthesis (PDF, talk) (LICS) Playing with Repetitions in Data Words Using Energy Games (PDF, talk)
Data-structures	(ICLP) Shape Neutral Analysis of Graph-based Data-structures (PDF, talk)
database theory	(LICS) Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable. (PDF, talk)
Databases	(ITP) A Coq formalisation of SQL’s execution engines (PDF, talk) (LPOP) The RBAC challenge in LogiQL: Solutions and Limitations (PDF)
Datalog	(ICLP) Declarative Algorithms in Datalog with Aggregates: user-friendly formal semantics conducive to performance and scalability (PDF, talk) (LPOP) Security Policies in Constraint Handling Rules (PDF, talk) (IJCAR) Efficient Model Construction for Horn Logic with VLog: System Description (PDF, talk)
datatypes	(ITP) Relational parametricity and quotient preservation for modular (co)datatypes (PDF, talk) (ITP) Boosting the Reuse of Formal Specifications (PDF, talk) (IJCAR) Superposition with Datatypes and Codatatypes (PDF, talk) (IJCAR) Datatypes with Shared Selectors (PDF, talk)
Deadlock	(FM) A lightweight deadlock analysis for programs with threads and reentrant locks (PDF, talk)
Deadlock Analysis	(AVOCS) Detecting Deadlocks in Formal System Models with Condition Synchronization (PDF, talk)
Deadlock Detection	(FM) Deadlock Detection for Actor-based Coroutines (PDF, talk) (FM) Dynamic Symbolic Verification of MPI Programs (PDF, talk)
deadlock-freedom	(WiL) A New Linear Logic for Deadlock-Free Session-Typed Processes (Talk Abstract) (PDF, talk)
Decentralized planning	(FM) Multi-Robot LTL Planning Under Uncertainty (PDF, talk)
Decidability	(FM) The Compound Interest in Relaxing Punctuality (PDF, talk) (ADSL) The Complexity of Prenex Separation Logic with One Selector (PDF, talk) (LICS) Allegories: decidability and graph homomorphisms (PDF, talk)
decision	(IJCAR) FORT 2.0 (PDF, talk)
Decision making	(VaVAS) Towards a verifiable decision making framework for self-driving vehicles (PDF, talk)
Decision Model and Notation (DMN)	(LPOP) Logic-based Methods for Software Engineers and Business People (PDF, talk)
Decision Modeling	(LPOP) Logic-based Methods for Software Engineers and Business People (PDF, talk)
Decision Modelling	(ICLP) Application of Logic-Based Methods to Machine Component Design (PDF, talk)
decision procedure	(LaSh) Lazy Automata Techniques for WS1S (PDF, talk) (LaSh) A Derivative-Based Decision Procedure for WS1S (PDF, talk) (ADSL) Sloth: Separation Logic and Theories via Small Models (PDF, talk) (IJCAR) Probably Half True: Probabilistic Satisfiability over Lukasiewicz Infinitely-valued Logic (PDF, talk) (IJCAR) Deciding the First-Order Theory of an Algebra of Feature Trees with Updates (PDF, talk) (IJCAR) A Separation Logic with Data: Small Models and Automation (PDF, talk) (CAV) Android Stack Machine (PDF, talk)
Decision Procedures	(SCSC) Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT (PDF, talk) (LaSh) Decidable Linear Tree Constraints (PDF, talk) (IJCAR) A Why3 framework for reflection proofs and its application to GMP's algorithms (PDF, talk) (IJCAR) Datatypes with Shared Selectors (PDF, talk)
decisiveness	(MoRe) Stochastic o-minimal hybrid systems (PDF, talk)
Declarative Algorithms	(ICLP) Declarative Algorithms in Datalog with Aggregates: user-friendly formal semantics conducive to performance and scalability (PDF, talk) (RCRA) Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic (PDF, talk)
declarative knowledge representation	(LPOP) The RBAC challenge in the KB-paradigm (PDF)
declarative programming	(PRUV) A Model-Theoretic View on Preferences in Declarative Specifications of Search Problems (PDF, talk) (LPOP) A software system should be declarative except where it interacts with the real world (PDF, talk) (FM) Variant analysis with QL (PDF, talk)
Declarative Prover	(ThEdu) Students' Proof Assistant (SPA) (PDF, talk)
declassification	(CSF) Assuming you know: epistemic semantics of relational annotations for expressive flow policies (PDF, talk)
decoupled approach	(CAV) Controller Synthesis Made Real: Reach-avoid Specifications and Linear Dynamics (PDF, talk)
decreasing diagrams	(FSCD) Decreasing diagrams with two labels are complete for confluence of countable systems (PDF, talk)
deduction	(WPTE) Automating the Diagram Method to Prove Correctness of Program Transformations (PDF, talk)
Deductive interactive program verification	(UITP) Adding Text-Based Interaction to a Direct-Manipulation Interface for Program Verification -- Lessons Learned (PDF, talk)
Deductive program verification	(IJCAR) A Why3 framework for reflection proofs and its application to GMP's algorithms (PDF, talk)
Deductive programs verification	(SMT) Alt-Ergo 2.2 (PDF, talk)
deductive verification	(F-IDE) Lightweight Interactive Proving inside an Automatic Program Verifier (PDF, talk) (F-IDE) Experience Report on Formally Verifying Parts of OpenJDK's API with KeY (PDF, talk) (ITP) Understanding Parameters of Deductive Verification: An Empirical Investigation of KeY (PDF, talk) (CAV) Eager Abstraction for Symbolic Model Checking (PDF, talk)
Dedukti	(ITP) Tactics and certificates in Meta Dedukti (PDF, talk) (LFMTP) Sharing a library between proof assistants: reaching out to the HOL family (PDF, talk)
Deduplication	(PRUV) Leveraging Probabilistic Existential Rules for Adversarial Deduplication (PDF, talk)
deep embedding	(Coq) Preliminary Report on the Yalla Library (PDF, talk)
deep inference	(TYDI) An introduction to deep inference (PDF, talk) (TYDI) Some incoherent musings on deep inference and combinatorial proofs (PDF, talk) (TYDI) Proof complexity of deep inference: a survey (PDF, talk) (TYDI) Truely Concurrent Processes in the Calculus of Structures (PDF, talk) (TYDI) Deep-Inference Intersection Types (PDF, talk) (TYDI) Deep Inference, Herbrand's Theorem and Expansion Proofs (PDF, talk)
Deficiency	(SAT) Minimal unsatisfiability and minimal strongly connected digraphs (PDF, talk)
definability	(LICS) Definable decompositions for graphs of bounded linear cliquewidth (PDF, talk)
definable while programs	(LICS) On computability and tractability for infinite sets (PDF, talk)
delay differential equations	(CAV) Inner and Outer Approximating Flowpipes for Delay Differential Equations (PDF, talk)
Delta-completeness	(CAV) Delta-Decision Procedures for Exists-Forall Problems over the Reals (PDF, talk)
denotation	(LICS) Every λ-Term is Meaningful for the Infinitary Relational Model (PDF, talk)
denotational model	(Linearity/TLLA) A semantic conjecture on second-order MLL and its complexity consequences (work in progress) (PDF, talk)
denotational semantics	(FSCD) The clocks they are adjunctions. Denotational semantics for Clocked Type Theory (PDF, talk) (FSCD) Call-by-name Gradual Type Theory (PDF, talk) (Linearity/TLLA) The Bang Calculus and the Two Girard's Translations (PDF, talk) (LICS) Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types (PDF, talk) (LICS) Probabilistic stable functions on discrete cones are power series. (PDF, talk) (LICS) Boolean-Valued Semantics for Stochastic Lambda-Calculus (PDF, talk) (PARIS) What makes guarded types tick? (PDF, talk) (Isabelle) Using Isabelle/UTP for the Verification of Sorting Algorithms: A Case Study (PDF, talk) (HOR) Refining Properties of Filter Models: Sensibility, Approximability and Reducibility (PDF, talk) (HOR) The next 700 (type-theoretical) denotational models ? (PDF, talk)
deontic logis	(ARQNL) System Demonstration: The Higher-Order Prover Leo-III (PDF, talk)
Dependant Types	(WST) Termination of Lambda-Pi modulo rewriting using the size-change principle (PDF, talk)
dependence maps	(SR) Dependences in Strategy Logic (PDF, talk)
Dependency	(AVOCS) Detecting Deadlocks in Formal System Models with Condition Synchronization (PDF, talk)
dependent choice	(LICS) A sequent calculus with dependent types for classical arithmetic (PDF, talk)
dependent product types	(LICS) Dialectica models of type theory (PDF, talk)
Dependent Refinement Types	(CAV) Propositional Dynamic Logic for Higher-Order Functional Programs (PDF, talk) (LICS) Dependent Temporal Effects and Fixpoint Logic for Verification (PDF, talk)
dependent temporal effects	(LICS) Dependent Temporal Effects and Fixpoint Logic for Verification (PDF, talk)
dependent type theory	(FSCD) Internal Universes in Models of Homotopy Type Theory (PDF, talk) (NLCS) Paychecks, Presupposition, and Dependent Types (PDF, talk) (HoTT/UF) Algebraic models of dependent type theory (PDF, talk) (LICS) Dialectica models of type theory (PDF, talk)
dependent types	(ITP) Tactics and certificates in Meta Dedukti (PDF, talk) (ITP) Verified Timing Transformations in Synchronous Circuits with LambdaPi-Ware (PDF, talk) (ICLP) Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis (PDF, talk) (ICLP-DC) Proof-relevant resolution for elaboration of programming languages (PDF, talk) (Linearity/TLLA) Substructural Calculi with Dependent Types (PDF, talk) (LICS) Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types (PDF, talk) (LICS) A sequent calculus with dependent types for classical arithmetic (PDF, talk) (LICS) Guarded Computational Type Theory (PDF, talk)
dependently typed programming	(ITP) Verified Timing Transformations in Synchronous Circuits with LambdaPi-Ware (PDF, talk)
derivational complexity	(WST) Embracing Infinity - Termination of String Rewriting by Almost Linear Weight Functions (PDF, talk)
Deriving Reliable Programs	(REFINE) Programming Without Refinement (PDF, talk)
Description Logic	(IJCAR) Enumerating Justifications using Resolution (PDF, talk) (LICS) A van Benthem Theorem for Fuzzy Modal Logic (PDF, talk)
description logics	(PRUV) Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure (PDF, talk) (IJCAR) FAME: An Automated Tool for Semantic Forgetting in Expressive Description Logics (PDF, talk) (FCS) An Expressive, Flexible and Uniform Logical Formalism for Attribute-based Access Control (PDF, talk)
descriptive complexity	(LCC) Completeness in the Second Level of the Polynomial Time Hierarchy through Syntactic Properties (PDF, talk) (LICS) Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth (PDF, talk) (LICS) A modal mu perspective on solving parity games in quasipolynomial time. (PDF, talk)
design automation	(CAV) ADAC: Automated Design of Approximate Circuits (PDF, talk)
Design by contract	(F-IDE) Experience Report on Formally Verifying Parts of OpenJDK's API with KeY (PDF, talk) (ITP) Understanding Parameters of Deductive Verification: An Empirical Investigation of KeY (PDF, talk)
Design Space Exploration	(Overture) Design Space Exploration for Secure Building Control (PDF, talk)
determinacy	(LICS) Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable. (PDF, talk)
Deterministic Automata	(CAV) Rabinizer 4: From LTL to Your Favourite Deterministic Automaton (PDF, talk) (LICS) One Theorem to Rule Them All: A Unified Translation of LTL into $\omega$-Automata (PDF, talk)
Deterministic Parity Automaton	(CAV) Strix: Explicit Reactive Synthesis Strikes Back! (PDF, talk)
DFA	(WiL) First-Order vs. Second-Order Encodings for LTLf-to-Automata: An Extended Abstract (PDF, talk)
Diagrammatic Reasoning	(LICS) A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics (PDF, talk) (LICS) Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics (PDF, talk)
dialectica category	(Linearity/TLLA) On the Lambek Calculus with an Exchange Modality (PDF, talk)
Dialectica interpretation	(LICS) Dialectica models of type theory (PDF, talk)
diamond lemma	(IWC) The diamond lemma for free modules (PDF, talk)
differential dynamic logic	(LICS) Differential Equation Axiomatization: The Impressive Power of Differential Ghosts (PDF, talk)
differential equation axiomatization	(LICS) Differential Equation Axiomatization: The Impressive Power of Differential Ghosts (PDF, talk)
Differential Equations	(VEMDP) Conservative Approximations of Polymers (PDF, talk) (LICS) A Logical Account for Linear Partial Differential Equations (PDF, talk)
differential game logic	(IJCAR) Uniform Substitution for Differential Game Logic (PDF, talk)
differential ghosts	(LICS) Differential Equation Axiomatization: The Impressive Power of Differential Ghosts (PDF, talk)
Differential Linear Logic	(Linearity/TLLA) Towards a Functional Language for Species of Structures (PDF, talk) (Linearity/TLLA) Models of Linear Logic based on the Schwartz epsilon product (PDF, talk) (LICS) A Logical Account for Linear Partial Differential Equations (PDF, talk)
Digital libraries	(LICS) Computability Beyond Church-Turing via Choice Sequences (PDF, talk)
Diller-Nahm variant	(LICS) Dialectica models of type theory (PDF, talk)
Diophantine equations	(Isabelle) Hilbert Meets Isabelle: Formalisation of the DPRM Theorem in Isabelle (PDF, talk)
direct-manipulation interaction	(UITP) Adding Text-Based Interaction to a Direct-Manipulation Interface for Program Verification -- Lessons Learned (PDF, talk)
Discounted-sum determinization	(CAV) Automata vs Linear-Programming Discounted-Sum Inclusion (PDF, talk)
Discounted-sum inclusion	(CAV) Automata vs Linear-Programming Discounted-Sum Inclusion (PDF, talk)
discrete polymorphism	(ITRS) Gradual Intersection Types (PDF, talk)
Discrete-Event	(Overture) Overture FMU: Export VDM-RT Models as Tool-Wrapper FMUs (PDF, talk)
discrete-time linear system	(CAV) Controller Synthesis Made Real: Reach-avoid Specifications and Linear Dynamics (PDF, talk)
display map category	(LICS) Dialectica models of type theory (PDF, talk)
distance bounding protocols	(FCS) Proving physical proximity using symbolic models (PDF, talk)
Distance fraud	(FCS) Statistical Model Checking of Guessing and Timing Attacks on Distance-bounding Protocols (PDF, talk)
Distance-bounding protocols	(FCS) Statistical Model Checking of Guessing and Timing Attacks on Distance-bounding Protocols (PDF, talk)
distribute consensus protocols	(CAV) Eager Abstraction for Symbolic Model Checking (PDF, talk)
distributed autonomous systems	(VaVAS) Towards a Hierarchical-Control Architecture for Distributed Autonomous Systems (Extended Abstract - Paper) (PDF, talk)
distributed computing	(CAV) Peregrine: A Tool for the Analysis of Population Protocols (PDF, talk)
distributed concurrent systems	(FM) SDN-Actors: Modeling and Verification of SDN Programs (PDF, talk)
Distributed Protocols	(HCVS) Declarative Parameterized Verification of Topology-sensitive Distributed Protocols (PDF, talk)
distributed systems	(ICLP) MASP-Reduce: a proposal for distributed computation of stable models (PDF, talk) (FM) Stepwise Development and Model Checking of a Distributed Interlocking System - using RAISE (PDF, talk)
Distribution based objectives	(LICS) Distribution-based objectives for Markov Decision Processes (PDF, talk)
DLVSYSTEM srl	(LPOP) On the Development of Industrial Applications with ASP (PDF, talk)
DMN	(ICLP) Application of Logic-Based Methods to Machine Component Design (PDF, talk)
DNA algorithmic self-assembly	(VEMDP) Computational Approaches for the Programmed Assembly of Nanocellulose Meshes (PDF, talk)
Dolev-Yao Attacker	(CAV) Model checking indistinguishability of randomized security protocols (PDF, talk)
domain specific languages	(ITP) Verified Timing Transformations in Synchronous Circuits with LambdaPi-Ware (PDF, talk)
domain-level strand displacement	(VEMDP) Equivalence of Chemical Reaction Networks in a CRN-to-DNA Compiler Framework (PDF, talk)
domain-specific formal languages	(F-IDE) Isabelle/jEdit as IDE for domain-specific formal languages and informal text documents (PDF, talk)
Domain-specific languages	(CSF) Enforcing ideal-world leakage bounds in real-world secret sharing MPC frameworks (PDF, talk)
dominance	(SR) Beyond admissibility: Dominance between chains of strategies (PDF, talk)
Double Description method	(CAV) A Direct Encoding for NNC Polyhedra (PDF, talk)
Double negation	(LICS) Around Classical and Intuitionistic Linear Logics (PDF, talk)
Double-pushout graph transformation	(TERMGRAPH) Semantics-Preserving DPO-Based Term Graph Rewriting (PDF, talk)
Double-pushout rewriting	(LICS) Rewriting with Frobenius (PDF, talk)
downward closures	(LICS) PTL-separability and closures for WQOs on words (PDF, talk)
DPRM Theorem	(Isabelle) Hilbert Meets Isabelle: Formalisation of the DPRM Theorem in Isabelle (PDF, talk)
drat	(IJCAR) Extended Resolution Simulates DRAT (PDF, talk)
DRAT proofs	(POS) Two flavors of DRAT (PDF, talk)
Drawing trees	(Isabelle) Drawing Trees (PDF)
DSL	(Coq) Teaching Your Rooster to Crow in C (PDF, talk)
dual-rail encoding	(PC) On Dual-Rail Based MaxSAT Solving (PDF, talk)
duality	(LICS) Riesz Modal Logic with Threshold Operators (PDF, talk)
dualized proof system	(CL&C) (Short Paper) Towards a Dualized Sequent Calculus with Canonicity (PDF, talk)
Dynamic analysis	(CAV) Quasi-Optimal Partial Order Reduction (PDF, talk)
Dynamic applications	(ICLP) Experimenting with robotic intra-logistics domains (PDF, talk)
Dynamic data structures	(CAV) Let this Graph be your Witness! An Attestor for Verifying Java Pointer Programs (PDF, talk)
Dynamic domains	(LPOP) How to upgrade ASP for true dynamic modelling and solving? (PDF, talk)
dynamic epistemic logic	(ITP) Software tool support for modular reasoning in modal logics of actions (PDF, talk)
Dynamic language	(CAV) Nagini: A Static Verifier for Python (PDF, talk)
Dynamic Languages	(CAV) MaxSMT-Based Type Inference for Python 3 (PDF, talk)
dynamic logic	(FM) The Compound Interest in Relaxing Punctuality (PDF, talk) (LICS) A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow (PDF, talk)
Dynamic nets	(LICS) Concurrency and Probability: Removing Confusion, Compositionally (PDF, talk)
Dynamic Partial Order Reduction	(CAV) Constrained Dynamic Partial Order Reduction (PDF, talk)
Dynamic Programming	(ITP) Verified Memoization and Dynamic Programming (PDF, talk) (LaSh) Solving #SAT by Parameterized Algorithms: Exploiting Small Treewidth (PDF, talk) (LaSh) Declarative Dynamic Programming with Inverse Coupled Rewrite Systems (PDF, talk)
Dynamic Verification	(FM) Dynamic Symbolic Verification of MPI Programs (PDF, talk)
Dynamical Systems	(Linearity/TLLA) Entropy and Complexity Lower Bounds (PDF, talk) (VaVAS) Formal Synthesis of Control Strategies for Dynamical Systems (PDF)
E
e-voting	(CSF) Alethea: A Provably Secure Random Sample Voting Protocol (PDF, talk)
EasyCrypt	(CSF) Formal Security Proof of CMAC and its Variants (PDF, talk) (CSF) Computer-aided proofs for multiparty computation with active security (PDF, talk) (CSF) Machine-checked proofs for electronic voting: privacy and verifiability for Belenios (PDF, talk)
Eckmann-Hilton morphism	(HDRA) Towards a fully formalized definition of syllepsis in weak higher categories (PDF, talk)
Economic Reasoning	(SCSC) Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics (PDF, talk)
Economics	(ITP) Towards Formal Foundations for Game Theory (short paper) (PDF, talk)
effectful bisimilarity	(LICS) Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances (PDF, talk)
Efficiency	(UNIF) Efficiency of a Good but not Linear Nominal Unification Algorithm (PDF, talk)
efficient computation	(ICLP) Shared aggregate sets in answer set programming (PDF, talk)
Egraph	(SMT) Centralizing Equality Reasoning in MCSAT (PDF, talk)
Eilenberg-Moore Category	(FSCD) Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories (PDF, talk)
elaboration	(ICLP-DC) Proof-relevant resolution for elaboration of programming languages (PDF, talk)
Eldarica	(WPTE) Verification of Ada Programs with AdaHorn (PDF, talk)
Electronic Voting	(CAV) Model checking indistinguishability of randomized security protocols (PDF, talk)
elementary linear logic	(Linearity/TLLA) A semantic conjecture on second-order MLL and its complexity consequences (work in progress) (PDF, talk)
elementary semantics	(SR) Dependences in Strategy Logic (PDF, talk)
ellipsoid method	(LICS) Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem (PDF, talk)
Embedded systems	(FM) Resource-aware Design for Reliable Autonomous Applications with Multiple Periods (PDF, talk)
Empirical evaluation	(CAV) Automata vs Linear-Programming Discounted-Sum Inclusion (PDF, talk)
EMVCo	(Overture) VDM at large: analysing the EMV Next Generation Kernel (PDF, talk)
energy games	(LICS) Playing with Repetitions in Data Words Using Energy Games (PDF, talk)
energy-efficient computing	(CAV) ADAC: Automated Design of Approximate Circuits (PDF, talk)
engineering mathematics	(ThEdu) Lucas Interpretation from Programmers’ Perspective (PDF, talk)
enriched category theory	(LICS) Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams (PDF, talk)
entailment check	(ADSL) Cyclic Theorem Prover for Separation Logic by Magic Wand (PDF, talk)
Entitity Resolution	(PRUV) Leveraging Probabilistic Existential Rules for Adversarial Deduplication (PDF, talk)
epistemic logic	(ITP) The Coinductive Formulation of Common Knowledge (PDF, talk) (FM) Timed Epistemic Knowledge Bases for Social Networks (PDF, talk)
Epistemic Logic Programs	(ICLP) Epistemic Logic Programs with World View Constraints (PDF, talk)
epistemic specification	(ICLP) Introspecting Preferences In Answer Set Programming (PDF, talk)
Epistemic Specifications	(ICLP) Epistemic Logic Programs with World View Constraints (PDF, talk)
equality by abstraction over an interval	(HoTT/UF) The definitional symmetric cubical structure of types in type theory with equality defined by abstraction over an interval (PDF, talk)
equational constraints	(SCSC) Evaluation of Equational Constraints for CAD in SMT Solving (PDF, talk)
equational logic	(IJCAR) Efficient encodings of first-order Horn formulas in equational logic (PDF, talk) (LICS) An algebraic theory of Markov processes (PDF, talk)
equational rewriting	(UNIF) Knowledge Problems in Equational Extensions of Subterm Convergent Theories (PDF, talk)
equational theories	(FSCD) Fixed-Point Constraints for Nominal Equational Unification (PDF, talk) (FSCD) Higher-Order Equational Pattern Anti-Unification (PDF, talk) (UNIF) Towards Generalization Methods for Purely Idempotent Equational Theories (PDF, talk) (PC) Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk)
equational theory	(ITP) A Formal Equational Theory for Call-By-Push-Value (PDF, talk) (UNIF) Unification Based on Generalized Embedding (PDF, talk)
Equilibrium Logic	(ICLP) Functional ASP with Intensional Sets; Application to Gelfond-Zhang Agreggates (PDF, talk)
Equivalence	(FCS) A Homotopical Approach to Cryptography (PDF, talk)
equivalence relations	(LICS) Unary negation fragment with equivalence relations has the finite model property (PDF, talk)
erasure	(LICS) Degrees of Relatedness - A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory (PDF, talk)
Erlang	(HCVS) Metaprogramming and symbolic execution for detecting runtime errors in Erlang programs (PDF, talk)
essential unification	(UNIF) Unification Based on Generalized Embedding (PDF, talk)
Ethereum	(CSF) KEVM: A Complete Formal Semantics of the Ethereum Virtual Machine (PDF, talk) (SMT) SMT-based Compile-time Verification of Safety Properties for Smart Contracts (PDF, talk)
Evaluable Functions	(ICLP) Functional ASP with Intensional Sets; Application to Gelfond-Zhang Agreggates (PDF, talk)
Evaluation	(POS) The Effect of Scrambling CNFs (PDF, talk) (VaVAS) Reproducibility in Robotics - The Big 5 Issues (PDF)
Event Calculus	(ICLP) Learning Commonsense Knowledge through Interactive Dialogue (PDF, talk)
Event structures	(LICS) Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types (PDF, talk) (LICS) The concurrent game semantics of Probabilistic PCF (PDF, talk)
evidential verification	(FM) Evidential and Continuous Integration of Software Verification Tools (PDF, talk)
Evolution systems	(VEMDP) Conservative Approximations of Polymers (PDF, talk)
exchange	(Linearity/TLLA) On the Lambek Calculus with an Exchange Modality (PDF, talk)
exchange rule	(Coq) Preliminary Report on the Yalla Library (PDF, talk)
Executable Specifications	(ICLP) Specifying and Verbalising Answer Set Programs in Controlled Natural Language (PDF, talk)
execution time	(ITRS) Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (PDF, talk)
exhaustive and randomized data generation	(LFMTP) Property-Based Testing of Abstract Machines: an Experience Report (PDF, talk)
existential rules	(PRUV) Leveraging Probabilistic Existential Rules for Adversarial Deduplication (PDF, talk) (IJCAR) Efficient Model Construction for Horn Logic with VLog: System Description (PDF, talk)
expander graphs	(PC) Complexity of expander-based reasoning and the power of monotone proofs (PDF, talk)
expansion proofs	(TYDI) Deep Inference, Herbrand's Theorem and Expansion Proofs (PDF, talk) (CL&C) Fast cut-elimination using proof terms: an empirical study (PDF, talk)
expected shortfall	(LICS) Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes (PDF, talk)
Expected Utility	(ITP) Towards Formal Foundations for Game Theory (short paper) (PDF, talk)
experimental analysis	(SAT) Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization (PDF, talk)
experiments	(ICLP) Improving Candidate Quality of Probabilistic Logic Models (PDF, talk) (POS) A Problem Meta-Data Library for Research in SAT (PDF, talk)
Expert Systems	(ICLP) Application of Logic-Based Methods to Machine Component Design (PDF, talk)
explainable decision set	(IJCAR) A SAT-Based Approach to Learn Explainable Decision Sets (PDF, talk)
explanation	(ICLP-DC) Explaining Actual Causation via Reasoning about Actions and Change (PDF, talk) (FM) Producing Explanations for Rich Logics (PDF, talk)
explanatory analysis	(FM) To Compose, Or Not to Compose, That is the Question: An Analysis of Compositional State Space Generation (PDF, talk)
explicit induction reasoning	(PARIS) Useless Explicit Induction Reasoning (PDF, talk)
explicit substitution	(HOR) Combinatorics of explicit substitutions (extended abstract) (PDF, talk)
Exposed Datapath Architectures	(ICLP) Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP (PDF, talk)
expressiveness	(LICS) A Theory of Register Monitors (PDF, talk)
extended resolution	(IJCAR) Extended Resolution Simulates DRAT (PDF, talk)
Extension	(NLCS) Propositional Attitude Operators in Homotopy Type Theory (PDF, talk)
extensive category	(LICS) Dialectica models of type theory (PDF, talk)
extraction	(ITP) Software Verification with ITPs Should Use Binary Code Extraction to Reduce the TCB (short paper) (PDF, talk) (Coq) What is the Foreign Function Interface of the Coq Programming Language? (PDF, talk)
F
factorization	(SCSC) New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square (PDF, talk)
fairness	(FM) Encoding fairness in a synchronous concurrent program algebra (PDF, talk)
Fairness objectives	(CAV) Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives (PDF, talk)
Fault tolerance	(FM) Resource-aware Design for Reliable Autonomous Applications with Multiple Periods (PDF, talk)
feasibility of functionals	(LICS) Type-two polynomial-time and restricted lookahead. (PDF, talk)
feature tree constraints	(IJCAR) Deciding the First-Order Theory of an Algebra of Feature Trees with Updates (PDF, talk)
fermionic quantum computing	(FSCD) A diagrammatic axiomatisation of fermionic quantum circuits (PDF, talk)
fibrancy of the function type	(HoTT/UF) Robust Notions of Contextual Fibrancy (PDF, talk)
fibrant replacement	(HoTT/UF) Robust Notions of Contextual Fibrancy (PDF, talk)
field theory	(LCC) Computability over locally finite structures from algebra (PDF, talk)
Filter	(SAT) XORSAT Set Membership Filters (PDF, talk)
filter models	(HOR) Refining Properties of Filter Models: Sensibility, Approximability and Reducibility (PDF, talk)
Finite Automaton	(LaSh) Lazy Automata Techniques for WS1S (PDF, talk)
Finite model generator	(IJCAR) Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing (PDF, talk)
finite model property	(LICS) Unary negation fragment with equivalence relations has the finite model property (PDF, talk)
finite model theory	(LICS) A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP (PDF, talk) (LICS) Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth (PDF, talk)
finite multisets	(Coq) Preliminary Report on the Yalla Library (PDF, talk)
Finite Semantics	(ICLP) Certified Graph View Maintenance with Regular Datalog (PDF, talk)
finite sum types	(LICS) Dialectica models of type theory (PDF, talk)
finitization	(PARIS) Local validity for circular proofs in linear logic with fixed points (PDF, talk)
Firmware	(CAV) Model Checking Boot Code from AWS Data Centers (PDF, talk)
first order logic	(LPOP) The RBAC challenge in the KB-paradigm (PDF)
First order transduction	(LICS) Regular and First Order List Functions (PDF, talk)
first-order combinatorial proofs	(TYDI) Some incoherent musings on deep inference and combinatorial proofs (PDF, talk)
First-order list function	(LICS) Regular and First Order List Functions (PDF, talk)
first-order logic	(TYDI) Deep Inference, Herbrand's Theorem and Expansion Proofs (PDF, talk) (HoTT/UF) First-order homotopical logic and Grothendieck fibrations (PDF, talk) (UITP) Partial Regularization of First-Order Resolution Proofs (PDF, talk) (FM) Formal Specification and Verification of Dynamic Parametrized Architectures (PDF, talk) (LCC) Traversal-invariant definability and Logarithmic-space computation (PDF, talk) (IJCAR) A Tableaux Calculus for Reducing Proof Size (PDF, talk) (IJCAR) Formalizing Bachmair and Ganzinger's Ordered Resolution Prover (PDF, talk) (IJCAR) Superposition with Datatypes and Codatatypes (PDF, talk) (IJCAR) Efficient encodings of first-order Horn formulas in equational logic (PDF, talk) (CAV) Model Generation for Quantified Formulas: A Taint-Based Approach (PDF, talk) (FCS) An Expressive, Flexible and Uniform Logical Formalism for Attribute-based Access Control (PDF, talk) (PAAR) Set of Support for Higher-Order Reasoning (PDF, talk) (PAAR) Dynamic Strategy Priority: Empower the strong and abandon the weak (PDF, talk) (PAAR) TFX: The TPTP Extended Typed First-order Form (PDF, talk) (PAAR) A Verified Simple Prover for First-Order Logic (PDF, talk) (LICS) PTL-separability and closures for WQOs on words (PDF, talk) (Isabelle) Substitutionless First-Order Logic: A Formal Soundness Proof (PDF, talk) (SMT) What is the Point of an SMT-LIB Problem? (PDF, talk)
first-order logic with inductive definitions	(CL&C) Validating Back-links of FOL$_{\mbox{\normalsize ID}}$ Cyclic Pre-proofs (PDF, talk)
first-order logic with inductive predicates	(PARIS) Useless Explicit Induction Reasoning (PDF, talk)
First-order multiplicative linear logic	(LICS) Unification nets: canonical proof net quantifiers (PDF, talk)
First-Order Syntactic Unification	(UNIF) Formalization of First-Order Syntactic Unification (PDF, talk)
First-order Theory	(IJCAR) Complexity of Combinations of Qualitative Constraint Satisfaction Problems (PDF, talk)
first-order theory of rewriting	(IJCAR) FORT 2.0 (PDF, talk)
First-order types	(LICS) On the number of types in sparse graphs (PDF, talk)
Fix-points	(HCVS) A simple functional presentation and an inductive correctness proof of the Horn algorithm (PDF, talk)
fixed parameter complexity	(MoRe) Parameterized complexity of games with monotonically ordered omega-regular objectives (PDF, talk)
fixed parameter tractable	(QBF) Tractability results for structured quantified CNF-formulas via knowledge compilation (PDF, talk)
Fixed Point Arithmetic	(SMT) The next 10^4 UppSAT Approximations (PDF, talk)
fixed point equations	(FSCD) Fixed-Point Constraints for Nominal Equational Unification (PDF, talk)
fixed points	(PARIS) Local validity for circular proofs in linear logic with fixed points (PDF, talk)
fixed-point logic	(LICS) Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem (PDF, talk)
Fixpoint Algorithms	(ICLP) Towards Incremental and Modular Context-sensitive Analysis (PDF, talk)
fixpoint alternation	(PARIS) Collapses of Fixpoint Alternation Hierarchies in Low Type-Levels of Higher-Order Fixpoint Logic (PDF, talk)
fixpoint logic	(LICS) Dependent Temporal Effects and Fixpoint Logic for Verification (PDF, talk) (ARQNL) Evidence Extraction from Parameterised Boolean Equation Systems (PDF, talk)
flattener	(F-IDE) AsmetaF: a flattener for the ASMETA framework (PDF, talk)
Floating Point Arithmetic	(IJCAR) Exploring Approximations for Floating-Point Arithmetic using UppSAT (PDF, talk) (SMT) The next 10^4 UppSAT Approximations (PDF, talk)
floating-point analysis	(FM) Combining Tools for Optimization and Analysis of Floating-Point Computations (PDF, talk)
floating-point optimization	(FM) Combining Tools for Optimization and Analysis of Floating-Point Computations (PDF, talk)
floating-point round-off errors	(FM) A Formally Verified Floating-Point Implementation of the Compact Position Reporting Algorithm (PDF, talk)
flocking	(VaVAS) Adaptive Neighborhood Resizing for Stochastic Reachability in Multi-Agent Systems (PDF, talk)
Flow Analysis	(LICS) Causal Computational Complexity of Distributed Processes (PDF, talk)
flows and nowhere-zero flows	(LICS) A theory of linear typings as flows on 3-valent graphs (PDF, talk)
Fly-Automata	(LaSh) Monadic Second-Order Model Checking with Fly-Automata (PDF, talk)
FMI	(Overture) Multi-modelling of Cooperative Swarms (PDF, talk)
Focused Proof Systems	(IJCAR) A Logical Framework with Commutative and Non-Commutative Subexponentials (PDF, talk)
focused sequent calculus	(UITP) Implementing a Proof Assistant using Focusing and Logic Programming (PDF, talk) (ARQNL) A Simple Semi-automated Proof Assistant for First-order Modal Logics (PDF, talk)
focused sequent calculus for first-order modal logic	(ARQNL) A Simple Semi-automated Proof Assistant for First-order Modal Logics (PDF, talk)
focusing	(LICS) Strong Sums in Focused Logic (PDF, talk) (LICS) Around Classical and Intuitionistic Linear Logics (PDF, talk)
Focussing	(IJCAR) Focussing, MALL and the polynomial hierarchy (PDF, talk)
FOIL algorithm	(ICLP) Cumulative Scoring-based Induction of Default Theories (PDF, talk)
FOL	(WiL) First-Order vs. Second-Order Encodings for LTLf-to-Automata: An Extended Abstract (PDF, talk)
Forest Algebra	(LICS) MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras (PDF, talk)
Forest Algebras	(LICS) Wreath Products of Distributive Forest Algebras (PDF, talk)
Formal Analysis	(CSF) An extensive formal analysis of multi-factor authentication protocols (PDF, talk)
formal aspects of program analysis	(LICS) Work Analysis with Resource-Aware Session Types (PDF, talk)
Formal Definition	(LFMTP) What Does This Notation Mean Anyway? BNF-Style Notation as it is actually used (PDF, talk)
formal languages and automata theory	(CAV) Reactive Control Improvisation (PDF, talk)
Formal Library	(Coq) Classical Analysis with Coq (PDF, talk)
Formal Metatheory	(LFMTP) Formalization in Constructive Type Theory of the Standardization Theorem (PDF, talk) (LFMTP) Formalisation of Barendregt's Variable Convention for Generic Structures with Binders (PDF, talk)
Formal Methods	(F-IDE) Experience Report on Formally Verifying Parts of OpenJDK's API with KeY (PDF, talk) (F-IDE) Improving the Visualization of Alloy Instances (PDF, talk) (F-IDE) The CLEAR Way To Transparent Formal Methods (PDF, talk) (F-IDE) Integrating user design and formal models within PVSio-Web (PDF, talk) (ITP) Understanding Parameters of Deductive Verification: An Empirical Investigation of KeY (PDF, talk) (FM) The Compound Interest in Relaxing Punctuality (PDF, talk) (FM) CompoSAT: Specification-Guided Coverage for Model Finding (PDF, talk) (FM) From Formal Requirements to Highly Assured Software for Unmanned Aircraft Systems (PDF, talk) (FM) Z3 and SMT in Industrial R&D (PDF, talk) (FM) Disruptive Innovations for the Development and the Deployment of Fault-Free Software (PDF, talk) (SR) Verification of Multi-agent Systems with Imperfect Information and Public Actions (PDF, talk) (CAV) JBMC: A Bounded Model Checking Tool for Verifying Java Bytecode (PDF, talk) (CAV) The DEEPSEC prover (PDF, talk) (FCS) Homomorphisms and Minimality for Enrich-by-Need Security Analysis (PDF, talk) (CSF) Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR (PDF, talk) (AVOCS) Analyzing Consistency of Formal Requirements (PDF, talk) (AVOCS) Climbing the Software Assurance Ladder - Practical Formal Verification for Reliable Software (PDF, talk) (VaVAS) Policing Functions for Machine Learning Systems (PDF, talk)
formal methods for security	(CSF) Symbolic security of garbled circuits (PDF, talk)
formal methods in practice	(FM) A Formally Verified Floating-Point Implementation of the Compact Position Reporting Algorithm (PDF, talk)
Formal Model	(FCS) LISA: Predicting the Impact of DoS Attacks on Real-World Low Power IoT Systems (PDF, talk)
formal proof	(CSF) Formal Security Proof of CMAC and its Variants (PDF, talk) (AVOCS) Proof-Oriented Design of a Separation Kernel with Minimal Trusted Computing Base (PDF, talk)
formal proofs	(ITP) Formalizing Ring Theory in PVS (short paper) (PDF, talk) (ITP) A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs (PDF, talk) (Coq) Procrastination, A proof engineering technique (PDF, talk) (CSF) Secure compilation of side-channel countermeasures: the case of cryptographic “constant-time” (PDF, talk)
Formal Semantics	(NLCS) Propositional Forms of Judgemental Interpretations (PDF, talk)
formal specification	(VEMDP) Executable Biochemical Space for Specification and Analysis of Biochemical Systems (PDF, talk) (FM) Formal Specification and Verification of Dynamic Parametrized Architectures (PDF, talk)
formal topology	(LICS) Computable decision-making on the reals and other spaces via partiality and nondeterminism (PDF, talk)
formal verification	(ITP) Verifying the LTL to Büchi Automata Translation via Very Weak Alternating Automata (PDF, talk) (ITP) Verified Tail Bounds for Randomized Programs (PDF, talk) (VEMDP) Formal Verification of Network-Based Biocomputation Circuits (PDF, talk) (VEMDP) Using Transitivity and Modularity in Chemical Reaction Network Bisimulation (PDF, talk) (FM) Verifying Auto-Generated C Code from Simulink (PDF, talk) (FM) Formal Verification of Automotive Simulink Controller Models: Empirical Technical Challenges, Evaluation and Recommendations (PDF, talk) (FM) Formal Specification and Verification of Dynamic Parametrized Architectures (PDF, talk) (FM) Interlocking Design Automation using Prover Trident (PDF, talk) (FCS) Proving physical proximity using symbolic models (PDF, talk) (FCS) A Study on the Preservation on Cryptographic Constant-Time Security in the CompCert Compiler (PDF, talk) (CSF) Composition Theorems for CryptoVerif and Application to TLS 1.3 (PDF, talk) (CSF) Computer-aided proofs for multiparty computation with active security (PDF, talk) (CSF) Alethea: A Provably Secure Random Sample Voting Protocol (PDF, talk) (AVOCS) Formal Verification of Synchronisation, Gossip and Environmental Effects for Critical IoT Systems (PDF, talk) (LICS) A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow (PDF, talk) (VaVAS) Formalisation of the Rules of the Road for embedding into an Autonomous Vehicle Agent (PDF, talk) (Isabelle) Drawing Trees (PDF) (DS-FM) Formal verification of neural networks (PDF, talk) (SMT) SMT-based Compile-time Verification of Safety Properties for Smart Contracts (PDF, talk)
formal verification at runtime	(VaVAS) Towards a Hierarchical-Control Architecture for Distributed Autonomous Systems (Extended Abstract - Paper) (PDF, talk)
Formalisation	(ITP) An Agda Formalization of Üresin & Dubois' Asynchronous Fixed-Point Theory (PDF, talk)
formalization	(UNIF) Formalization of First-Order Syntactic Unification (PDF, talk) (IWC) Certified Ordered Completion (PDF, talk) (IWC) Towards a Verified Decision Procedure for Confluence of Ground Term Rewrite Systems in Isabelle/HOL (PDF, talk) (Isabelle) Substitutionless First-Order Logic: A Formal Soundness Proof (PDF, talk) (HDRA) Towards a fully formalized definition of syllepsis in weak higher categories (PDF, talk)
FormalVerification	(VEMDP) Bayesian Verification of Chemical Reaction Networks (PDF, talk)
Frama-C	(FM) A Formally Verified Floating-Point Implementation of the Compact Position Reporting Algorithm (PDF, talk)
Free choice sequences	(WiL) On Expanding Standard Notions of Constructivity (PDF, talk)
free modules	(IWC) The diamond lemma for free modules (PDF, talk)
free monad	(FM) Modular Verification of Programs with Effects and Effect Handlers in Coq (PDF, talk)
Free Variable	(LaSh) Lazy Automata Techniques for WS1S (PDF, talk)
Frege systems	(PC) Complexity of expander-based reasoning and the power of monotone proofs (PDF, talk)
Freyd categories	(Linearity/TLLA) From Linear Logic to Cyclic Sharing (PDF, talk)
Frobenius algebra	(LICS) Rewriting with Frobenius (PDF, talk)
FSM	(FM) FSM Inference from Long Traces (PDF, talk)
full abstraction	(LICS) Eager Functions as Processes (PDF, talk)
Function algebras	(LCC) A recursion-theoretic characterisation of the positive polynomial-time functions (PDF, talk)
Function classes	(LCC) A recursion-theoretic characterisation of the positive polynomial-time functions (PDF, talk)
function package	(ThEdu) Lucas Interpretation from Programmers’ Perspective (PDF, talk)
function summaries	(VSTTE) Lattice-Based Refinement in Bounded Model Checking (PDF, talk)
Functional Analysis	(Linearity/TLLA) Models of Linear Logic based on the Schwartz epsilon product (PDF, talk) (LICS) A Logical Account for Linear Partial Differential Equations (PDF, talk)
functional and relational specifications	(LFMTP) Computation-as-deduction in Abella: work in progress (PDF, talk)
functional dependency	(TERMGRAPH) Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting (PDF, talk)
functional interpretation	(LICS) Dialectica models of type theory (PDF, talk) (LICS) A functional interpretation with state (PDF, talk)
Functional Mock-up Interface	(Overture) Overture FMU: Export VDM-RT Models as Tool-Wrapper FMUs (PDF, talk)
functional programming	(ITP) Verified Timing Transformations in Synchronous Circuits with LambdaPi-Ware (PDF, talk) (ITP) Formalization of a Polymorphic Subtyping Algorithm (PDF, talk) (FSCD) Counting Environments and Closures (PDF, talk) (FSCD) Nominal Unification with Atom and Context Variables (PDF, talk) (LPOP) A software system should be declarative except where it interacts with the real world (PDF, talk) (WPTE) Optimizing Space of Parallel Processes (PDF, talk) (LFMTP) Functional programming with λ-tree syntax: a progress report (PDF, talk) (LICS) A Generalized Modality for Recursion (PDF, talk)
functor	(ITP) Relational parametricity and quotient preservation for modular (co)datatypes (PDF, talk) (FCS) A Homotopical Approach to Cryptography (PDF, talk)
fuzz	(LICS) Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances (PDF, talk)
fuzzer	(CAV) StringFuzz: A Fuzzer for String Solvers (PDF, talk)
fuzzy generalization	(UNIF) Proximity-Based Generalization (PDF, talk)
Fuzzy logic	(LICS) A van Benthem Theorem for Fuzzy Modal Logic (PDF, talk)
G
g-leakage	(FM) An Algebraic Approach for Reasoning About Information Flow (PDF, talk)
Game semantics	(LICS) Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types (PDF, talk) (LICS) The concurrent game semantics of Probabilistic PCF (PDF, talk) (LICS) What's in a game? A theory of game models (PDF, talk) (LICS) LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic (PDF, talk) (PARIS) LMSO: A Curry-Howard Approach to Church’s Synthesis via Linear Logic (PDF, talk)
Game Theory	(ITP) Towards Formal Foundations for Game Theory (short paper) (PDF, talk) (LICS) Compositional game theory (PDF, talk)
Games	(SAT) Cops-Robber games and the resolution of Tseitin formulas (PDF, talk)
games and logic	(LICS) Distribution-based objectives for Markov Decision Processes (PDF, talk)
games played on finite graphs	(SR) Beyond admissibility: Dominance between chains of strategies (PDF, talk)
Gandy	(DCM) A Category Theoretic Interpretation of Gandy’s Principles for Mechanisms (PDF, talk)
Gappa	(FM) A Formally Verified Floating-Point Implementation of the Compact Position Reporting Algorithm (PDF, talk)
garbled circuit	(CSF) Symbolic security of garbled circuits (PDF, talk)
generalised species	(LICS) Species, Profunctors and Taylor Expansion Weighted by SMCC--A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs-- (PDF, talk)
Generalization of syntactic parse trees	(NLCS) Anti-Unification and Natural Language Processing (PDF, talk)
generalized reactivity	(FM) A Weakness Measure for GR(1) Formulae (PDF, talk) (DS-FM) Heuristic-Based GR(1) Assumptions Refinement (PDF, talk)
Generic Binding Structures	(LFMTP) Formalisation of Barendregt's Variable Convention for Generic Structures with Binders (PDF, talk)
generic proof assistant	(UITP) Implementing a Proof Assistant using Focusing and Logic Programming (PDF, talk)
Genetic algorithms	(RCRA) An Enhanced Genetic Algorithm with the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem (PDF, talk)
Geometric Automated Theorem Provers	(ThEdu) Rating of Geometric Automated Theorem Provers (PDF, talk)
geometric logic	(HoTT/UF) Towards a geometric model theory of type theory (PDF)
geometric realization	(HoTT/UF) Geometric realization of truncated semi-simplicial sets meta-constructed within HoTT (PDF, talk)
Geometry	(WiL) On Expanding Standard Notions of Constructivity (PDF, talk)
geometry of interaction	(DCM) Models of Computation that Conserve Data (PDF, talk) (Linearity/TLLA) Coherent interaction graphs: a nondeterministic geometry of interaction for MLL (PDF, talk) (LICS) The Geometry of Computation-Graph Abstraction (PDF, talk)
Gillespie algorithm	(VEMDP) Rule-Based Gillespie Simulation of Chemical Systems (PDF, talk)
Girard's translations	(Linearity/TLLA) The Bang Calculus and the Two Girard's Translations (PDF, talk)
global states	(CSF) A little more conversation, a little less action, a lot more satisfaction: Global states in ProVerif. (PDF, talk)
gluing	(LICS) Dialectica models of type theory (PDF, talk)
GNATProve	(WPTE) Verification of Ada Programs with AdaHorn (PDF, talk)
goal-directed evaluation	(ICLP) Constraint Answer Set Programming without Grounding (PDF, talk)
gradual typing	(FSCD) Call-by-name Gradual Type Theory (PDF, talk) (ITRS) Gradual Intersection Types (PDF, talk)
Grammar testing	(NLCS) Automatic test suite generation for PMCFG grammars (PDF, talk)
Grammatical Framework	(NLCS) Automatic test suite generation for PMCFG grammars (PDF, talk) (ICLP) Natural Language Generation From Ontologies: Application Paper (PDF, talk) (ICLP-DC) Natural Language Generation From Ontologies (PDF, talk)
graph	(SR) Concurrent games and semi-random determinacy (PDF, talk)
graph algorithms	(FSCD) Unique perfect matchings and proof nets (PDF, talk)
Graph Analysis	(LPOP) A Rule-Based Tool for Analysis and Generation of Graphs Applied to Mason's Marks (PDF, talk)
Graph Drawing	(LPOP) A Rule-Based Tool for Analysis and Generation of Graphs Applied to Mason's Marks (PDF, talk)
graph encoding	(TERMGRAPH) SLD-Resolution Reduction of Second-Order Horn Fragments - Extended Abstract (PDF, talk)
Graph Generation	(LPOP) A Rule-Based Tool for Analysis and Generation of Graphs Applied to Mason's Marks (PDF, talk)
graph grammars	(TERMGRAPH) A Framework for Rewriting Families of String Diagrams (PDF, talk) (CAV) Let this Graph be your Witness! An Attestor for Verifying Java Pointer Programs (PDF, talk)
graph isomorphism	(LICS) Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem (PDF, talk)
graph minor theorem	(ITP) A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs (PDF, talk)
Graph Queries	(ICLP) Certified Graph View Maintenance with Regular Datalog (PDF, talk)
Graph Recognition	(LPOP) A Rule-Based Tool for Analysis and Generation of Graphs Applied to Mason's Marks (PDF, talk)
Graph Representation	(LPOP) A Rule-Based Tool for Analysis and Generation of Graphs Applied to Mason's Marks (PDF, talk)
graph rewriting	(TERMGRAPH) Drags: an algebraic framework for graph rewriting (PDF, talk) (WST) GPO: A Path Ordering for Graphs (PDF, talk)
graph rewriting systems	(TERMGRAPH) A Port-graph Model for Finance (PDF, talk)
graph theory	(ITP) A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs (PDF, talk) (LCC) Completeness in the Second Level of the Polynomial Time Hierarchy through Syntactic Properties (PDF, talk) (LICS) Allegories: decidability and graph homomorphisms (PDF, talk) (LICS) A theory of linear typings as flows on 3-valent graphs (PDF, talk)
Graph transformation	(VEMDP) Rule-Based Gillespie Simulation of Chemical Systems (PDF, talk)
Graph Views	(ICLP) Certified Graph View Maintenance with Regular Datalog (PDF, talk)
graph-based characterization	(ICLP) MASP-Reduce: a proposal for distributed computation of stable models (PDF, talk)
Graphical reasoning	(LICS) Rewriting with Frobenius (PDF, talk)
Gray categories	(IWC) Critical pairs for Gray categories (PDF, talk)
Gray category	(FSCD) Coherence of Gray categories via rewriting (PDF, talk)
greatest fixed point	(CSF) Symbolic security of garbled circuits (PDF, talk)
Greedy Heuristics	(RCRA) Greedy Randomized Search for Scalable Compilation of Quantum Circuits (PDF, talk)
Groebner bases	(SCSC) New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square (PDF, talk)
Grothendieck fibrations	(HoTT/UF) First-order homotopical logic and Grothendieck fibrations (PDF, talk)
ground systems	(IWC) Towards a Verified Decision Procedure for Confluence of Ground Term Rewrite Systems in Isabelle/HOL (PDF, talk)
ground theories	(UNIF) ACUI Unification Modulo Ground Theories (PDF, talk)
Grounding	(QBF) A Grounder From Second-Order Logic To QBF (PDF, talk)
Group decision	(PRUV) Evidential Group Decision Making Model with Belief-Based Preferences (PDF, talk)
Groupoid	(FCS) A Homotopical Approach to Cryptography (PDF, talk)
Gröbner Basis	(SCSC) A Practical Polynomial Calculus for Arithmetic Circuit Verification (PDF, talk)
Guard Condition	(Coq) Towards a formalization of the guard condition (PDF, talk)
Guarded Recursion	(FSCD) The clocks they are adjunctions. Denotational semantics for Clocked Type Theory (PDF, talk) (LICS) A Generalized Modality for Recursion (PDF, talk) (LICS) Guarded Computational Type Theory (PDF, talk) (PARIS) What makes guarded types tick? (PDF, talk)
Guillotine Constraint	(RCRA) An Enhanced Genetic Algorithm with the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem (PDF, talk)
H
Hadamard matrices	(SCSC) Hard Combinatorial Problems: A Challenge for Satisfiability (PDF, talk)
halting problem	(WST) Objective and Subjective Specifications (PDF, talk) (LICS) A parameterized halting problem, the linear time hierarchy, and the MRDP theorem (PDF, talk)
hammers	(ITP) ProofWatch: Watchlist Guidance for Large Theories in E (PDF, talk)
Handlers	(LICS) Syntax and Semantics for Operations with Scopes (PDF, talk)
handwriting	(ITP) Towards Verified Handwritten Calculational Proofs (short paper) (PDF, talk)
Handwritten Digit Recognition	(ICLP) Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples (PDF, talk)
handwritten mathematics	(ITP) Towards Verified Handwritten Calculational Proofs (short paper) (PDF, talk)
hardness of approximation	(VEMDP) Computing Properties of Stable Configurations of Thermodynamic Binding Networks (PDF, talk)
Hardware model	(ITP) Physical addressing on real hardware in Isabelle/HOL (PDF, talk)
hardware verification	(ITP) Verified Timing Transformations in Synchronous Circuits with LambdaPi-Ware (PDF, talk) (FM) Modular Verification of Programs with Effects and Effect Handlers in Coq (PDF, talk)
hardware-in-the-loop	(FM) Model-Based Testing for Avionics Systems (PDF, talk)
Hardware/software interfaces	(CAV) Model Checking Boot Code from AWS Data Centers (PDF, talk)
hash functions	(CSF) Backdoored Hash Functions: Immunizing HMAC and HKDF (PDF, talk)
Hashing-based Algorithm	(PRUV) A New Probabilistic Algorithm for Approximate Model Counting (PDF, talk)
HCI	(F-IDE) Improving the Visualization of Alloy Instances (PDF, talk)
head variable	(NLCS) Do different syntactic trees yield different logical readings? Some remarks on head variables in typed lambda calculus. (PDF, talk)
Herbrand's theorem	(TYDI) Deep Inference, Herbrand's Theorem and Expansion Proofs (PDF, talk) (CL&C) Fast cut-elimination using proof terms: an empirical study (PDF, talk) (CL&C) Herbrand's Theorem as Higher-Order Recursion (PDF, talk)
hereditarily definable sets	(LICS) On computability and tractability for infinite sets (PDF, talk)
heuristic search	(DS-FM) Heuristic-Based GR(1) Assumptions Refinement (PDF, talk)
heuristics	(ICLP-DC) Speeding Up Lazy-Grounding Answer Set Solving (PDF, talk) (RCRA) An Enhanced Genetic Algorithm with the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem (PDF, talk)
Hierarchical information	(SR) Strategy Logic with Imperfect Information (PDF, talk)
Hierarchical state machines	(F-IDE) A Notebook Format for the Holistic Design of Embedded Systems (PDF, talk)
Hierarchy Theorem	(LICS) The State Complexity of Alternating Automata (PDF, talk)
higher categories	(HoTT/UF) Towards the syntax and semantics of higher dimensional type theory (PDF, talk) (IWC) Critical pairs for Gray categories (PDF, talk)
Higher dimensional linear rewriting	(HDRA) Termination in linear (2,2)-categories with braidings and duals (PDF, talk)
higher groups	(LICS) Higher Groups in Homotopy Type Theory (PDF, talk)
higher inductive type	(HoTT/UF) Geometric realization of truncated semi-simplicial sets meta-constructed within HoTT (PDF, talk) (FCS) A Homotopical Approach to Cryptography (PDF, talk)
higher inductive types	(FSCD) A Syntax for Higher Inductive-Inductive Types (PDF, talk) (LICS) Impredicative Encodings of (Higher) Inductive Types (PDF, talk) (LICS) On Higher Inductive Types in Cubical Type Theory (PDF, talk)
Higher order recursion schemes	(CL&C) Herbrand's Theorem as Higher-Order Recursion (PDF, talk)
Higher-order abstract syntax (HOAS)	(LFMTP) Abstract Representation of Binders in OCaml using the Bindlib Library (PDF, talk)
higher-order computability	(LICS) Type-two polynomial-time and restricted lookahead. (PDF, talk)
higher-order logic	(WiL) Embedding Intuitionistic Modal Logics in Higher-Order Logic. An Easy Task? (PDF, talk) (IJCAR) Superposition for Lambda-Free Higher-Order Logic (PDF, talk) (IJCAR) The Higher-Order Prover Leo-III (PDF, talk) (PAAR) Set of Support for Higher-Order Reasoning (PDF, talk) (SMT) Higher-Order SMT Solving (PDF, talk)
higher-order logic programming	(ICLP) Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs (PDF, talk) (UITP) Implementing a Proof Assistant using Focusing and Logic Programming (PDF, talk) (ARQNL) A Simple Semi-automated Proof Assistant for First-order Modal Logics (PDF, talk)
higher-order modal logic	(IJCAR) The Higher-Order Prover Leo-III (PDF, talk)
higher-order operads	(HOR) The next 700 (type-theoretical) denotational models ? (PDF, talk)
higher-order programs	(CAV) Propositional Dynamic Logic for Higher-Order Functional Programs (PDF, talk) (LICS) Dependent Temporal Effects and Fixpoint Logic for Verification (PDF, talk)
higher-order reasoning	(IJCAR) The Higher-Order Prover Leo-III (PDF, talk)
higher-order recursion schemes	(FSCD) Homogeneity without Loss of Generality (PDF, talk)
Higher-Order Rewriting	(WST) Termination of Lambda-Pi modulo rewriting using the size-change principle (PDF, talk) (HOR) Orthogonality and sequentiality in substructural Linear HRSs (PDF, talk)
higher-order term rewriting	(WST) Improving Static Dependency Pairs for Higher-Order Rewriting (PDF, talk)
higher-order unification	(FSCD) Nominal Unification with Atom and Context Variables (PDF, talk)
Higher-Ranked Polymorphism	(ITP) Formalization of a Polymorphic Subtyping Algorithm (PDF, talk)
Highly Assured Software	(FM) From Formal Requirements to Highly Assured Software for Unmanned Aircraft Systems (PDF, talk)
Hilbert's tenth problem	(Isabelle) Hilbert Meets Isabelle: Formalisation of the DPRM Theorem in Isabelle (PDF, talk)
HKDF	(CSF) Backdoored Hash Functions: Immunizing HMAC and HKDF (PDF, talk)
HMAC	(CSF) Backdoored Hash Functions: Immunizing HMAC and HKDF (PDF, talk)
HOL	(ITP) Verifying the LTL to Büchi Automata Translation via Very Weak Alternating Automata (PDF, talk) (IJCAR) The Higher-Order Prover Leo-III (PDF, talk) (LFMTP) Sharing a library between proof assistants: reaching out to the HOL family (PDF, talk) (Isabelle) Using Isabelle/UTP for the Verification of Sorting Algorithms: A Case Study (PDF, talk)
HOL Light	(ITP) HOL Light QE (PDF, talk)
homogeneous	(IJCAR) Complexity of Combinations of Qualitative Constraint Satisfaction Problems (PDF, talk)
homogeneous linear diophantine equations	(ITP) A Formally Verified Solver for Homogeneous Linear Diophantine Equations (PDF, talk)
homogeneous types	(FSCD) Homogeneity without Loss of Generality (PDF, talk)
Homological algebra	(HDRA) Minimal models for monomial algebras (PDF, talk)
Homomorphism	(UNIF) Bounded ACh Unification (PDF, talk)
Homotopical algebra	(HDRA) Minimal models for monomial algebras (PDF, talk)
Homotopy	(FCS) A Homotopical Approach to Cryptography (PDF, talk)
homotopy type theory	(FSCD) A Syntax for Higher Inductive-Inductive Types (PDF, talk) (FSCD) Internal Universes in Models of Homotopy Type Theory (PDF, talk) (NLCS) Propositional Attitude Operators in Homotopy Type Theory (PDF, talk) (HoTT/UF) Dependent Right Adjoint Types (PDF, talk) (HoTT/UF) Cubical Computational Type Theory (PDF, talk) (LICS) Impredicative Encodings of (Higher) Inductive Types (PDF, talk) (LICS) Higher Groups in Homotopy Type Theory (PDF, talk) (LICS) On Higher Inductive Types in Cubical Type Theory (PDF, talk) (LICS) Cellular Cohomology in Homotopy Type Theory (PDF, talk) (LICS) Free Higher Groups in Homotopy Type Theory (PDF, talk)
Hopf Monad	(FSCD) Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories (PDF, talk)
Horn clause	(PARIS) Coinductive Uniform Proofs: An Extended Abstract (PDF, talk)
Horn Clause Transformation	(ICLP) Solving Horn Clauses on Inductive Data Types Without Induction (PDF, talk)
Horn clauses	(HCVS) Towards Coinductive Theory Exploration in Horn Clause Logic: Extended Abstract (PDF, talk) (ICLP) Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis (PDF, talk) (TERMGRAPH) SLD-Resolution Reduction of Second-Order Horn Fragments - Extended Abstract (PDF, talk) (CAV) Constraint-Based Synthesis of Coupling Proofs (PDF, talk)
Horn propositional satisfiability algorithm	(HCVS) A simple functional presentation and an inductive correctness proof of the Horn algorithm (PDF, talk)
howe's method	(LICS) Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances (PDF, talk)
Human-Robot Interactions	(VaVAS) Trust me - I am autonomous (PDF)
Human-Robotic Interaction	(VaVAS) Reproducibility in Robotics - The Big 5 Issues (PDF)
HW-SW interface	(ITP) Physical addressing on real hardware in Isabelle/HOL (PDF, talk)
hybrid logic	(LICS) A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow (PDF, talk)
Hybrid System	(CAV) Space-time Interpolants (PDF, talk)
hybrid system simulators	(RCRA) Computing Personalised Treatments through In Silico Clinical Trials. A Case Study on Downregulation in Assisted Reproduction. (PDF, talk)
hybrid systems	(LICS) A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow (PDF, talk)
hydraulic oil pump	(FM) Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty (PDF, talk)
Hyper sequents	(PARIS) Towards the Automatic Construction of Schematic Proofs (PDF, talk)
hypercube optimization	(PC) Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
Hyperintensional Logic	(NLCS) Propositional Attitude Operators in Homotopy Type Theory (PDF, talk)
Hyperproperties	(CAV) Model Checking Quantitative Hyperproperties (PDF, talk) (CAV) Synthesizing Reactive Systems from Hyperproperties (PDF, talk)
Hyperproperty Verification	(CAV) Exploiting Synchrony and Symmetry in Relational Verification (PDF, talk)
hypersequents	(Linearity/TLLA) Taking Linear Logic Apart (PDF, talk)
I
ic3	(SAT) Finding all Minimal Safe Inductive Sets (PDF, talk) (AVOCS) A Framework for the Formal Verification of Networks of Railway Interlockings - Application to the Belgian Railways (PDF, talk) (SMT) Discovering Universally Quantified Solutions for Constrained Horn Clauses (PDF, talk)
IDE	(ITP) Towards Verified Handwritten Calculational Proofs (short paper) (PDF, talk)
Idempontent	(UNIF) Towards Generalization Methods for Purely Idempotent Equational Theories (PDF, talk)
Idempotent quasigroups	(IJCAR) Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing (PDF, talk)
Identity type	(FCS) A Homotopical Approach to Cryptography (PDF, talk)
ILP	(TERMGRAPH) SLD-Resolution Reduction of Second-Order Horn Fragments - Extended Abstract (PDF, talk)
immunization	(CSF) Backdoored Hash Functions: Immunizing HMAC and HKDF (PDF, talk)
imperative	(REFINE) A Theory of Lazy Imperative Timing (PDF, talk)
imperative calculi	(DCM) A syntactic model of mutation and aliasing (PDF, talk)
Imperative languages	(TERMGRAPH) Programming by Term Rewriting (PDF, talk)
imperative programming	(LPOP) A software system should be declarative except where it interacts with the real world (PDF, talk)
imperative programs	(WPTE) On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems (PDF, talk)
Imperfect information	(SR) Strategy Logic with Imperfect Information (PDF, talk)
Implementation and benchmarks for parity games	(SR) Solving Parity Games: Explicit vs Symbolic (PDF, talk)
implicate generation	(IJCAR) A Generic Framework for Implicate Generation Modulo Theories (PDF, talk)
implicative algebras	(ITP) Formalizing Implicative Algebras in Coq (PDF, talk)
implicit complexity	(FSCD) Term rewriting characterisation of LOGSPACE for finite and infinite data (PDF, talk) (LCC) A recursion-theoretic characterisation of the positive polynomial-time functions (PDF, talk) (Linearity/TLLA) A semantic conjecture on second-order MLL and its complexity consequences (work in progress) (PDF, talk)
Implicit Hitting Set	(IJCAR) Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories (PDF, talk)
Importance Splitting	(FM) Statistical Model Checking of LLVM Code (PDF, talk)
impredicative encodings	(LICS) Impredicative Encodings of (Higher) Inductive Types (PDF, talk)
impredicativity	(LICS) Impredicative Encodings of (Higher) Inductive Types (PDF, talk)
inconsistency measures	(PRUV) Measuring Disagreement among Knowledge Bases (PDF, talk)
inconsistency-tolerant reasoning	(PRUV) Measuring Disagreement among Knowledge Bases (PDF, talk)
Inconsistent Requirements Explanation	(DS-FM) Consistency Checking of Functional Requirements (PDF, talk)
increasing chains	(SR) Beyond admissibility: Dominance between chains of strategies (PDF, talk)
Incremental	(SCSC) Towards Incremental Cylindrical Algebraic Decomposition in Maple (PDF, talk)
Incremental Analysis	(ICLP) Towards Incremental and Modular Context-sensitive Analysis (PDF, talk)
Incremental Maintenance	(ICLP) Certified Graph View Maintenance with Regular Datalog (PDF, talk)
Incremental SAT	(IJCAR) An Assumption-Based Approach for Solving The Minimal S5-Satisfiability Problem (PDF, talk)
Indexed types	(FSCD) Index-Stratified Types (PDF, talk)
Indistinguishability	(CAV) Model checking indistinguishability of randomized security protocols (PDF, talk)
induction	(WiL) Non-well-founded proof system for Transitive Closure Logic (PDF, talk) (PARIS) Local validity for circular proofs in linear logic with fixed points (PDF, talk) (PARIS) Transitive Closure Logic: Infinitary and Cyclic Proof Systems (PDF, talk)
induction principle	(ITP) Efficient Mendler-Style Lambda-Encodings in Cedille (PDF, talk)
induction reasoning	(CL&C) Validating Back-links of FOL$_{\mbox{\normalsize ID}}$ Cyclic Pre-proofs (PDF, talk) (PARIS) Useless Explicit Induction Reasoning (PDF, talk)
induction rules	(PC) Bounded induction without parameters (PDF, )
inductive datatypes	(ITP) Efficient Mendler-Style Lambda-Encodings in Cedille (PDF, talk)
Inductive Definitions	(HCVS) A simple functional presentation and an inductive correctness proof of the Horn algorithm (PDF, talk) (AVOCS) An Entailment Checker for Separation Logic with Inductive Definitions (PDF, talk)
Inductive invariants	(CAV) Syntax-Guided Termination Analysis (PDF, talk) (CSF) Inductive Invariants for Noninterference in Multi-agent Workflows (PDF, talk) (SMT) Discovering Universally Quantified Solutions for Constrained Horn Clauses (PDF, talk)
Inductive Logic Programming	(ICLP) Cumulative Scoring-based Induction of Default Theories (PDF, talk) (ICLP) Learning Commonsense Knowledge through Interactive Dialogue (PDF, talk) (ICLP) Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples (PDF, talk) (ICLP) Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning (PDF, talk) (ICLP-DC) The Learning-Knowledge-Reasoning Paradigm For Natural Language Understanding and Question Answering (PDF, talk)
Inductive predicates	(ADSL) Labelled Cyclic Proofs for Separation Logic (PDF, talk)
inductive theorem prover	(PARIS) Towards the Automatic Construction of Schematic Proofs (PDF, talk)
Inductive Theorem Proving	(ICLP) Solving Horn Clauses on Inductive Data Types Without Induction (PDF, talk)
inductive types	(FSCD) Cumulative Inductive Types in Coq (PDF, talk) (LICS) Impredicative Encodings of (Higher) Inductive Types (PDF, talk)
inductive validity cores	(CAV) The JKind Model Checker (PDF, talk)
inductive-inductive types	(FSCD) A Syntax for Higher Inductive-Inductive Types (PDF, talk)
Industrial application	(Overture) Transforming an industrial case study from VDM++ to VDM-SL (PDF, talk)
industrial case	(FM) Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty (PDF, talk)
inference	(NLCS) Automated Reasoning from Polarized Parse Trees (PDF, talk) (FM) FSM Inference from Long Traces (PDF, talk)
inference attacks	(CSF) Privacy Risk in Machine Learning: Analyzing the Connection to Overfitting (PDF, talk)
infinitary and cyclic systems	(WiL) Non-well-founded proof system for Transitive Closure Logic (PDF, talk)
Infinitary Proofs	(PARIS) Transitive Closure Logic: Infinitary and Cyclic Proof Systems (PDF, talk)
infinitary rewriting	(FSCD) Strict Ideal Completions of the Lambda Calculus (PDF, talk) (FSCD) Term rewriting characterisation of LOGSPACE for finite and infinite data (PDF, talk)
Infinite computation	(CL&C) Some ideas on cut-elimination for cyclic arithmetic proofs (PDF, talk)
infinite descent	(AVOCS) An Entailment Checker for Separation Logic with Inductive Definitions (PDF, talk) (PARIS) Local validity for circular proofs in linear logic with fixed points (PDF, talk)
infinite duration	(SR) Concurrent games and semi-random determinacy (PDF, talk)
infinite-state systems	(CAV) Eager Abstraction for Symbolic Model Checking (PDF, talk) (LICS) PTL-separability and closures for WQOs on words (PDF, talk)
Infinity-Categories	(HoTT/UF) (Truncated) Simplicial Models of Type Theory (PDF, talk)
Infinity-Presheaves	(HoTT/UF) (Truncated) Simplicial Models of Type Theory (PDF, talk)
information flow	(LaSh) A Logic of Information Flows (PDF, talk) (FM) Formal Specification and Verification of Dynamic Parametrized Architectures (PDF, talk) (CSF) The Complexity of Monitoring Hyperproperties (PDF, talk) (CSF) Knowledge-based Security of Dynamic Secrets for Reactive Programs (PDF, talk) (CSF) Assuming you know: epistemic semantics of relational annotations for expressive flow policies (PDF, talk) (CSF) A Permission-Dependent Type System for Secure Information Flow Analysis (PDF, talk) (LICS) A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow (PDF, talk)
information flow analysis	(CAV) Lazy Self-Composition for Security Verification (PDF, talk)
Information flow control	(CSF) Types for Information Flow Control: Labeling Granularity and Semantic Models (PDF, talk)
inner-approximations	(CAV) Inner and Outer Approximating Flowpipes for Delay Differential Equations (PDF, talk)
innermost conditional narrowing	(FSCD) Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (PDF, talk)
instantiation	(SMT) Higher-Order SMT Solving (PDF, talk)
Integer Arithmetic	(IJCAR) A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems (PDF, talk)
Integer Transition Systems	(WST) Complexity Analysis for Bitvector Programs (PDF, talk)
integer weights	(LICS) Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes (PDF, talk)
Integrated Development Environment	(F-IDE) User Support for the Combinator Logic Synthesizer Framework (PDF, talk) (FM) QFLan: A Tool for the Quantitative Analysis of Highly Reconfigurable Systems (PDF, talk)
integrated verification	(FM) Evidential and Continuous Integration of Software Verification Tools (PDF, talk)
integration	(FM) IPL: An Integration Property Language for Multi-Model Cyber-Physical Systems (PDF, talk) (CAV) Continuous formal verification of Amazon s2n (PDF, talk)
integrity	(CSF) A Cryptographic Look at Multi-Party Channels (PDF, talk)
Intension	(NLCS) Propositional Attitude Operators in Homotopy Type Theory (PDF, talk)
Intensional Logic	(NLCS) Propositional Attitude Operators in Homotopy Type Theory (PDF, talk)
Intensional Sets	(ICLP) Functional ASP with Intensional Sets; Application to Gelfond-Zhang Agreggates (PDF, talk)
Intensional Type Theory	(NLCS) Propositional Attitude Operators in Homotopy Type Theory (PDF, talk)
intentions	(ICLP) An ASP Methodology for Understanding Narratives about Stereotypical Activities (PDF, talk)
interaction graphs	(Linearity/TLLA) Coherent interaction graphs: a nondeterministic geometry of interaction for MLL (PDF, talk)
Interaction nets	(DCM) Models of Computation that Conserve Data (PDF, talk)
Interactive system	(F-IDE) Integrating user design and formal models within PVSio-Web (PDF, talk)
interactive theorem prover	(UITP) Automated Theorem Proving in a Chat Environment (PDF, talk)
interactive theorem proving	(F-IDE) Lightweight Interactive Proving inside an Automatic Program Verifier (PDF, talk) (ITP) Software tool support for modular reasoning in modal logics of actions (PDF, talk) (ITP) Towards Verified Handwritten Calculational Proofs (short paper) (PDF, talk) (ITP) Verified Memoization and Dynamic Programming (PDF, talk) (LaSh) A Derivative-Based Decision Procedure for WS1S (PDF, talk) (ThEdu) Towards intuitive reasoning in axiomatic geometry (PDF, talk) (IJCAR) Proof-Producing Synthesis of CakeML with I/O and Local State from Monadic HOL Functions (PDF, talk)
interactive tool	(FSCD) ProTeM: A Proof Term Manipulator (PDF, talk)
Interface design	(F-IDE) Integrating user design and formal models within PVSio-Web (PDF, talk)
Interlocking	(FM) Interlocking Design Automation using Prover Trident (PDF, talk) (AVOCS) A Framework for the Formal Verification of Networks of Railway Interlockings - Application to the Belgian Railways (PDF, talk)
Intermediate Language for Verification	(F-IDE) Lightweight Interactive Proving inside an Automatic Program Verifier (PDF, talk)
internal and external calculi	(WiL) A semantical view of sequent based systems (PDF, talk)
internal language	(FSCD) Internal Universes in Models of Homotopy Type Theory (PDF, talk)
internal parametricity	(HoTT/UF) Internalizing Presheaf Semantics: Charting the Design Space (PDF, talk)
Internet of Things	(FCS) LISA: Predicting the Impact of DoS Attacks on Real-World Low Power IoT Systems (PDF, talk) (AVOCS) Formal Verification of Synchronisation, Gossip and Environmental Effects for Critical IoT Systems (PDF, talk)
Interoperability	(LFMTP) Sharing a library between proof assistants: reaching out to the HOL family (PDF, talk)
Interpolation	(HCVS) Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions (PDF, talk) (CAV) Learning Abstractions for Program Synthesis (PDF, talk) (CAV) Space-time Interpolants (PDF, talk)
interprocedural analysis	(WST) Procedure-Modular Termination Analysis (PDF, talk)
Intersection Type Systems	(Linearity/TLLA) Generalized generalized species of structure and resource modalities (PDF, talk)
intersection types	(TYDI) Deep-Inference Intersection Types (PDF, talk) (LICS) Every λ-Term is Meaningful for the Infinitary Relational Model (PDF, talk) (ITRS) Natural Deduction and Normalization Proofs for the Intersection Type Discipline (PDF, talk) (ITRS) Intersection Subtyping with Constructors (PDF, talk) (ITRS) On sets of terms with a given intersection type (PDF, ) (ITRS) Gradual Intersection Types (PDF, talk)
intersections	(LICS) Degrees of Relatedness - A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory (PDF, talk)
interval arithmetics	(SCSC) New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square (PDF, talk)
interval propagation	(SCSC) Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT (PDF, talk)
Intrinsic noise	(VEMDP) Noise Control for Molecular Computing (PDF, talk)
intruder deduction problem	(UNIF) Knowledge Problems in Equational Extensions of Subterm Convergent Theories (PDF, talk)
intuitionistic combinatorial proofs	(TYDI) Some incoherent musings on deep inference and combinatorial proofs (PDF, talk)
Intuitionistic linear logic	(FSCD) Proof nets for bi-intuitionistic linear logic (PDF, talk) (LICS) Around Classical and Intuitionistic Linear Logics (PDF, talk)
Intuitionistic logic	(ICLP) First-order answer set programming as constructive proof search (PDF, talk) (CL&C) Admissible tools in the kitchen of intuitionistic logic (PDF, talk) (LICS) Quasi-Open Bisimilarity with Mismatch is Intuitionistic (PDF, talk) (PC) Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk)
Intuitionistic logic of constant domains	(CL&C) On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains (PDF, talk)
Intuitionistic mathematics	(WiL) On Expanding Standard Notions of Constructivity (PDF, talk)
Intuitionistic modal logic	(WiL) Embedding Intuitionistic Modal Logics in Higher-Order Logic. An Easy Task? (PDF, talk) (WiL) Decomposing labelled proof theory for intuitionistic modal logic (PDF, talk)
Invariant Generation	(CAV) Exploiting Synchrony and Symmetry in Relational Verification (PDF, talk)
Invariants	(F-IDE) A Notebook Format for the Holistic Design of Embedded Systems (PDF, talk) (SAT) Effective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition (PDF, talk)
Inverse Reinforcement Learning	(CAV) Safety-Aware Apprenticeship Learning (PDF, talk)
IRM-calc	(SAT) Local Soundness for QBF Calculi (PDF, talk)
irrelevance	(LICS) Degrees of Relatedness - A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory (PDF, talk)
Isabelle	(ITP) Software tool support for modular reasoning in modal logics of actions (PDF, talk) (ITP) Verified Analysis of Random Binary Tree Structures (PDF, talk) (ITP) Towards Formal Foundations for Game Theory (short paper) (PDF, talk) (UITP) Isabelle/PIDE after 10 years of development (PDF, talk) (LaSh) A Derivative-Based Decision Procedure for WS1S (PDF, talk) (ThEdu) Lucas Interpretation from Programmers’ Perspective (PDF, talk) (IJCAR) Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle (PDF, talk) (Isabelle) Hilbert Meets Isabelle: Formalisation of the DPRM Theorem in Isabelle (PDF, talk) (Isabelle) Further Scaling of Isabelle Technology (PDF, talk) (Isabelle) The remote_build Tool (PDF, talk) (Isabelle) Using Isabelle/UTP for the Verification of Sorting Algorithms: A Case Study (PDF, talk)
Isabelle Proof Assistant	(UNIF) Formalization of First-Order Syntactic Unification (PDF, talk) (ThEdu) Natural Deduction Assistant (NaDeA) (PDF, talk) (ThEdu) Students' Proof Assistant (SPA) (PDF, talk) (ThEdu) Proving in the Isabelle Proof Assistant that the Set of Real Numbers is not Countable (PDF, talk)
Isabelle/HOL	(ITP) Physical addressing on real hardware in Isabelle/HOL (PDF, talk) (ITP) A Formalization of the LLL Basis Reduction Algorithm (PDF, talk) (ITP) Fast machine words in Isabelle/HOL (PDF, talk) (ITP) Relational parametricity and quotient preservation for modular (co)datatypes (PDF, talk) (ITP) A Formally Verified Solver for Homogeneous Linear Diophantine Equations (PDF, talk) (ITP) Verified Memoization and Dynamic Programming (PDF, talk) (ITP) MDP + TA = PTA: Probabilistic Timed Automata, Formalized (Short Paper) (PDF, talk) (IJCAR) Formalizing Bachmair and Ganzinger's Ordered Resolution Prover (PDF, talk) (IWC) Certified Ordered Completion (PDF, talk) (PAAR) A Verified Simple Prover for First-Order Logic (PDF, talk) (Isabelle) Formal Verification of Bounds for the LLL Basis Reduction Algorithm (PDF, talk) (Isabelle) Drawing Trees (PDF) (Isabelle) PaMpeR: A Proof Method Recommendation System for Isabelle/HOL (PDF, talk)
Isabelle/HOL Theorem Proving	(ITP) Program Verification in the Presence of Cached Address Translation (PDF, talk)
Isabelle/jEdit	(F-IDE) Isabelle/jEdit as IDE for domain-specific formal languages and informal text documents (PDF, talk)
IsaSAT	(Isabelle) A Verified SAT Solver with Watched Literals Using Imperative HOL (Extended Abstract) (PDF, talk)
Isomorphism type	(SAT) Minimal unsatisfiability and minimal strongly connected digraphs (PDF, talk)
isotopy	(HDRA) Normal forms for planar connected string diagrams (PDF, talk)
Iterated Boolean games	(SR) Local Equilibria in Logic-Based Multi-Player Games (PDF, talk)
J
JASP	(LPOP) Role-Based Access Control via JASP (PDF, talk)
Java	(CAV) JBMC: A Bounded Model Checking Tool for Verifying Java Bytecode (PDF, talk)
JDLV	(LPOP) On the Development of Industrial Applications with ASP (PDF, talk)
jEdit	(UITP) Isabelle/PIDE after 10 years of development (PDF, talk)
Jordan Normal Form	(WST) A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving (PDF, talk)
Judgemental Interpretation	(NLCS) Propositional Forms of Judgemental Interpretations (PDF, talk)
Jupyter	(F-IDE) A Notebook Format for the Holistic Design of Embedded Systems (PDF, talk)
K
k-safety verification	(CAV) Lazy Self-Composition for Security Verification (PDF, talk)
Kachinuki order	(WST) Semantic Kachinuki Order (PDF, talk)
Kakutani's fixed point theorem	(LICS) Distribution-based objectives for Markov Decision Processes (PDF, talk)
KeY	(F-IDE) Experience Report on Formally Verifying Parts of OpenJDK's API with KeY (PDF, talk) (ITP) Understanding Parameters of Deductive Verification: An Empirical Investigation of KeY (PDF, talk)
key set	(IJCAR) Automated Reasoning about Key Sets (PDF, talk)
kleptography	(CSF) Self-Guarding Cryptographic Protocols against Algorithm Substitution Attacks (PDF, talk) (CSF) Backdoored Hash Functions: Immunizing HMAC and HKDF (PDF, talk)
Knapsack	(SMT) Puli - A Problem-Specific OMT Solver (PDF, talk)
knot theory	(SCSC) Unknot Recognition Through Quantifier Elimination (PDF, talk)
Knowledge Acquisition	(ICLP-DC) Knowledge Authoring and Question Answering via Controlled Natural Language (PDF, talk)
knowledge base paradigm	(LPOP) The RBAC challenge in the KB-paradigm (PDF)
Knowledge based Reasoning	(FM) Timed Epistemic Knowledge Bases for Social Networks (PDF, talk)
knowledge compilation	(QBF) Tractability results for structured quantified CNF-formulas via knowledge compilation (PDF, talk) (PC) Proof systems for #SAT based on restricted circuits (PDF, talk)
Knowledge Representation	(NLCS) Graph Knowledge Representations for SICK (PDF, talk) (LPOP) Logic-based Methods for Software Engineers and Business People (PDF, talk)
Knowledge Representation and Reasoning	(ICLP-DC) Explaining Actual Causation via Reasoning about Actions and Change (PDF, talk) (ICLP-DC) The Learning-Knowledge-Reasoning Paradigm For Natural Language Understanding and Question Answering (PDF, talk)
knowledge-based noninterference	(CSF) Knowledge-based Security of Dynamic Secrets for Reactive Programs (PDF, talk)
Knuth-Bendix criterion	(UNIF) Rewriting with Generalized Nominal Unification (PDF, talk)
Koat	(WST) Control-Flow Refinement via Partial Evaluation (PDF, talk)
L
labelled Markov chain	(CAV) Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains (PDF, talk)
Labelled proof-systems	(ARQNL) Labelled Connection-based Proof Search for Multiplicative Intuitionistic Linear Logic (PDF, talk)
labelled sequent calculi	(ARQNL) Labelled calculi for QMLs with non-rigid and non-denoting terms (PDF, talk)
Labelled sequents	(WiL) Decomposing labelled proof theory for intuitionistic modal logic (PDF, talk)
labelled systems	(WiL) A semantical view of sequent based systems (PDF, talk)
lambda calculi	(LICS) Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams (PDF, talk)
lambda calculus	(FSCD) Strict Ideal Completions of the Lambda Calculus (PDF, talk) (FSCD) On repetitive right application of B-terms (PDF, talk) (FSCD) Nominal Unification with Atom and Context Variables (PDF, talk) (ICLP) First-order answer set programming as constructive proof search (PDF, talk) (LPOP) A software system should be declarative except where it interacts with the real world (PDF, talk) (DCM) Towards a Formal System for Topological Quantum Computation (PDF, talk) (LFMTP) Formalization in Constructive Type Theory of the Standardization Theorem (PDF, talk) (Linearity/TLLA) How to count linear and affine closed lambda terms? (PDF, talk) (Linearity/TLLA) The Bang Calculus and the Two Girard's Translations (PDF, talk) (LICS) Probabilistic stable functions on discrete cones are power series. (PDF, talk) (LICS) Eager Functions as Processes (PDF, talk) (PARIS) Collapses of Fixpoint Alternation Hierarchies in Low Type-Levels of Higher-Order Fixpoint Logic (PDF, talk) (HOR) Orthogonality and sequentiality in substructural Linear HRSs (PDF, talk) (ITRS) Strong normalization of simple types through uniform intersection types. (PDF, talk) (ITRS) Gradual Intersection Types (PDF, talk)
lambda calculus and combinatory logic	(LICS) A theory of linear typings as flows on 3-valent graphs (PDF, talk)
lambda prolog	(ARQNL) A Simple Semi-automated Proof Assistant for First-order Modal Logics (PDF, talk)
lambda-calculus	(FSCD) Counting Environments and Closures (PDF, talk) (FSCD) Homogeneity without Loss of Generality (PDF, talk) (TYDI) An introduction to deep inference (PDF, talk) (TYDI) Deep-Inference Intersection Types (PDF, talk) (WST) Termination of Lambda-Pi modulo rewriting using the size-change principle (PDF, talk) (Linearity/TLLA) On the Taylor expansion of λ-terms and the groupoid structure of their rigid approximants (PDF, talk) (LICS) Every λ-Term is Meaningful for the Infinitary Relational Model (PDF, talk) (HOR) Normalization and Taylor expansion of lambda-terms (PDF, talk) (ITRS) Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (PDF, talk)
lambda-encodings	(ITP) Efficient Mendler-Style Lambda-Encodings in Cedille (PDF, talk)
lambda-free higher-order logic	(IJCAR) Superposition for Lambda-Free Higher-Order Logic (PDF, talk)
lambda-prolog	(UITP) Implementing a Proof Assistant using Focusing and Logic Programming (PDF, talk)
lambda-tree syntax	(LFMTP) Functional programming with λ-tree syntax: a progress report (PDF, talk)
Lambek calculus	(Linearity/TLLA) On the Lambek Calculus with an Exchange Modality (PDF, talk) (Linearity/TLLA) Substructural Calculi with Dependent Types (PDF, talk)
lams	(FM) A lightweight deadlock analysis for programs with threads and reentrant locks (PDF, talk)
language based security	(CSF) A Permission-Dependent Type System for Secure Information Flow Analysis (PDF, talk)
Language inclusion	(CAV) Automata vs Linear-Programming Discounted-Sum Inclusion (PDF, talk)
large libraries	(ITP) ProofWatch: Watchlist Guidance for Large Theories in E (PDF, talk)
Large set	(IJCAR) Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing (PDF, talk)
large theories	(IJCAR) An abstraction-refinement framework for reasoning with large theories (PDF, talk)
large-scale reasoning	(IJCAR) Efficient Model Construction for Horn Logic with VLog: System Description (PDF, talk)
lattice	(VSTTE) Lattice-Based Refinement in Bounded Model Checking (PDF, talk)
Lattice Basis Reduction	(Isabelle) Formal Verification of Bounds for the LLL Basis Reduction Algorithm (PDF, talk)
lattice traversal	(VSTTE) Lattice-Based Refinement in Bounded Model Checking (PDF, talk)
Layout algorithm	(Isabelle) Drawing Trees (PDF)
laziness	(LICS) A sequent calculus with dependent types for classical arithmetic (PDF, talk)
lazy	(REFINE) A Theory of Lazy Imperative Timing (PDF, talk)
lazy evaluation	(Isabelle) Lazy Algebraic Types in Isabelle/HOL (PDF, talk)
lazy grounding	(ICLP-DC) Speeding Up Lazy-Grounding Answer Set Solving (PDF, talk)
lazy self-composition	(CAV) Lazy Self-Composition for Security Verification (PDF, talk)
Lean proof assistant	(LICS) Higher Groups in Homotopy Type Theory (PDF, talk)
learning	(CAV) The Learnability of Symbolic Automata (PDF, talk)
Least general generalization	(FSCD) Term-Graph Anti-Unification (PDF, talk) (NLCS) Anti-Unification and Natural Language Processing (PDF, talk)
Leo-III	(IJCAR) The Higher-Order Prover Leo-III (PDF, talk)
Leveled sequents	(PARIS) Towards the Automatic Construction of Schematic Proofs (PDF, talk)
Likelihood weighting	(ICLP) Constraint-Based Inference in Probabilistic Logic Programs (PDF, talk)
Linear Arithmetic	(IJCAR) A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems (PDF, talk)
Linear categories	(HDRA) Termination in linear (2,2)-categories with braidings and duals (PDF, talk)
Linear Category	(FSCD) Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories (PDF, talk)
linear clauses	(SCSC) Refutation of Products of Linear Polynomials (PDF, talk)
linear cliquewidth	(LICS) Definable decompositions for graphs of bounded linear cliquewidth (PDF, talk)
Linear Constraints	(IJCAR) Checking Array Bounds by Abstract Interpretation and Symbolic Expressions (PDF, talk)
linear distributivity	(TYDI) Some incoherent musings on deep inference and combinatorial proofs (PDF, talk)
linear logic	(FSCD) Proof nets for bi-intuitionistic linear logic (PDF, talk) (FSCD) Unique perfect matchings and proof nets (PDF, talk) (TYDI) Some incoherent musings on deep inference and combinatorial proofs (PDF, talk) (ICLP) A New Proof-theoretical Linear Semantics for CHR (PDF, talk) (Coq) Preliminary Report on the Yalla Library (PDF, talk) (IJCAR) Focussing, MALL and the polynomial hierarchy (PDF, talk) (Linearity/TLLA) Formalization of Automated Trading Systems in a Concurrent Linear Framework (PDF, talk) (Linearity/TLLA) From Linear Logic to Cyclic Sharing (PDF, talk) (Linearity/TLLA) On the Lambek Calculus with an Exchange Modality (PDF, talk) (Linearity/TLLA) Taking Linear Logic Apart (PDF, talk) (Linearity/TLLA) Substructural Calculi with Dependent Types (PDF, talk) (Linearity/TLLA) The structure of non decomposable connectives of linear logic (PDF, talk) (Linearity/TLLA) The Bang Calculus and the Two Girard's Translations (PDF, talk) (Linearity/TLLA) Benchmarking Linear Logic Translations (PDF, talk) (Linearity/TLLA) Generalized generalized species of structure and resource modalities (PDF, talk) (Linearity/TLLA) On the Taylor expansion of λ-terms and the groupoid structure of their rigid approximants (PDF, talk) (LICS) The Syntax and Semantics of Quantitative Type Theory (PDF, talk) (LICS) Work Analysis with Resource-Aware Session Types (PDF, talk) (LICS) Unification nets: canonical proof net quantifiers (PDF, talk) (LICS) Around Classical and Intuitionistic Linear Logics (PDF, talk) (LICS) LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic (PDF, talk) (LICS) A theory of linear typings as flows on 3-valent graphs (PDF, talk) (PARIS) Local validity for circular proofs in linear logic with fixed points (PDF, talk) (PARIS) LMSO: A Curry-Howard Approach to Church’s Synthesis via Linear Logic (PDF, talk) (HOR) Normalization and Taylor expansion of lambda-terms (PDF, talk) (HOR) Orthogonality and sequentiality in substructural Linear HRSs (PDF, talk) (ITRS) Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (PDF, talk) (ARQNL) Labelled Connection-based Proof Search for Multiplicative Intuitionistic Linear Logic (PDF, talk)
Linear polygraphs	(HDRA) Termination in linear (2,2)-categories with braidings and duals (PDF, talk)
Linear Programming	(ITP) A Coq Tactic for Equality Learning in Linear Arithmetic (PDF, talk)
Linear Temporal Logic	(ICLP) Temporal Answer Set Programming on Finite Traces (PDF, talk) (SR) Local Equilibria in Logic-Based Multi-Player Games (PDF, talk) (CAV) Rabinizer 4: From LTL to Your Favourite Deterministic Automaton (PDF, talk) (CAV) Strix: Explicit Reactive Synthesis Strikes Back! (PDF, talk) (LICS) Automaton-Based Criteria for Membership in CTL (PDF, talk) (LICS) One Theorem to Rule Them All: A Unified Translation of LTL into $\omega$-Automata (PDF, talk) (DS-FM) Consistency Checking of Functional Requirements (PDF, talk)
linear term	(Linearity/TLLA) How to count linear and affine closed lambda terms? (PDF, talk)
linear time hierarchy	(LICS) A parameterized halting problem, the linear time hierarchy, and the MRDP theorem (PDF, talk)
Linear Transformations	(IJCAR) A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems (PDF, talk)
Linear Tree Constraints	(LaSh) Decidable Linear Tree Constraints (PDF, talk)
linear/non-linear logic	(Linearity/TLLA) On the Lambek Calculus with an Exchange Modality (PDF, talk)
Linearity	(DCM) Models of Computation that Conserve Data (PDF, talk)
linearizability	(CAV) Monitoring Weak Consistency (PDF, talk)
Linearization	(SMT) The next 10^4 UppSAT Approximations (PDF, talk)
Lists	(ADSL) The Complexity of Prenex Separation Logic with One Selector (PDF, talk)
Literate programming	(F-IDE) A Notebook Format for the Holistic Design of Embedded Systems (PDF, talk)
Liveness Analysis	(CAV) Symbolic Liveness Analysis of Real-World Software (PDF, talk)
LLVM	(FM) Statistical Model Checking of LLVM Code (PDF, talk) (CAV) Formal Verification of a Vehicle-to-Vehicle (V2V) Messaging System (PDF, talk)
Local determinism	(DCM) A Category Theoretic Interpretation of Gandy’s Principles for Mechanisms (PDF, talk)
locale theory	(LICS) Computable decision-making on the reals and other spaces via partiality and nondeterminism (PDF, talk)
Log analysis	(CSF) The Complexity of Monitoring Hyperproperties (PDF, talk)
logarithmic space computation	(LCC) Traversal-invariant definability and Logarithmic-space computation (PDF, talk)
logic	(SCSC) Unknot Recognition Through Quantifier Elimination (PDF, talk) (TYDI) Nested sequents for modal logics and beyond (PDF, talk) (LaSh) A Logic of Information Flows (PDF, talk) (FM) IPL: An Integration Property Language for Multi-Model Cyber-Physical Systems (PDF, talk) (LCC) A recursion-theoretic characterisation of the positive polynomial-time functions (PDF, talk) (LICS) Logics for Word Transductions with Synthesis (PDF, talk)
logic for PTime	(LICS) On computability and tractability for infinite sets (PDF, talk)
Logic for Teaching	(ThEdu) Towards intuitive reasoning in axiomatic geometry (PDF, talk)
Logic Meta-Programming	(LPOP) LPOP2018 XSB Position Paper (PDF, talk)
Logic of Here and There	(ICLP) Temporal Answer Set Programming on Finite Traces (PDF, talk)
Logic on Trees	(LICS) Wreath Products of Distributive Forest Algebras (PDF, talk)
logic programming	(VEMDP) Rule-based Design of Computational DNA Devices (PDF, talk) (ICLP) Top-down and Bottom-up Evaluation Reconciled (PDF, talk) (ICLP) Epistemic Logic Programs with World View Constraints (PDF, talk) (LPOP) The RBAC challenge in LogiQL: Solutions and Limitations (PDF) (LPOP) LPOP2018 XSB Position Paper (PDF, talk) (FM) Variant analysis with QL (PDF, talk) (IJCAR) Focussing, MALL and the polynomial hierarchy (PDF, talk) (RCRA) Externally Supported Models for Efficient Computation of Paracoherent Answer Sets (PDF, talk) (RCRA) Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic (PDF, talk)
Logic Programming Applications	(RCRA) Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper) (PDF, talk)
Logic Solvers	(CAV) Understanding and Extending Incremental Determinization for 2QBF (PDF, talk)
Logic Tools	(ThEdu) Natural Deduction Assistant (NaDeA) (PDF, talk) (ThEdu) Students' Proof Assistant (SPA) (PDF, talk)
Logic-based tools	(ICLP-DC) Model Revision of Logical Regulatory Networks using Logic-based Tools (PDF, talk)
Logical complexity	(PARIS) On the logical complexity of cyclic arithmetic (PDF, talk)
logical design	(TERMGRAPH) Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting (PDF, talk)
logical formalism	(FCS) An Expressive, Flexible and Uniform Logical Formalism for Attribute-based Access Control (PDF, talk)
logical framework	(Linearity/TLLA) Formalization of Automated Trading Systems in a Concurrent Linear Framework (PDF, talk)
Logical Frameworks	(IJCAR) A Logical Framework with Commutative and Non-Commutative Subexponentials (PDF, talk) (LFMTP) Sharing a library between proof assistants: reaching out to the HOL family (PDF, talk) (LICS) Strong Sums in Focused Logic (PDF, talk)
Logical models	(WST) Well-founded models in proofs of termination (PDF, talk)
logical paradoxes	(LICS) Logical paradoxes in quantum computation (PDF, talk)
logical predicates	(LICS) Dialectica models of type theory (PDF, talk)
Logical Regulatory Networks	(ICLP-DC) Model Revision of Logical Regulatory Networks using Logic-based Tools (PDF, talk)
Logical relations	(FSCD) Index-Stratified Types (PDF, talk) (FSCD) A Syntax for Higher Inductive-Inductive Types (PDF, talk)
logically constrained term rewriting systems	(IJCAR) A Coinductive Approach to Proving Reachability in Logically Constrained Term Rewriting Systems (PDF, talk)
Logics for strategic reasoning	(SR) Verification of Multi-agent Systems with Imperfect Information and Public Actions (PDF, talk)
Logistics	(ICLP-DC) Scalable Robotic Intra-Logistics with Answer Set Programming (PDF, talk)
LOGSPACE	(FSCD) Term rewriting characterisation of LOGSPACE for finite and infinite data (PDF, talk)
LOIS	(LICS) On computability and tractability for infinite sets (PDF, talk)
long-distance resolution	(SAT) Local Soundness for QBF Calculi (PDF, talk)
loop unrolling	(ITP) Verified Timing Transformations in Synchronous Circuits with LambdaPi-Ware (PDF, talk)
Lower bound techniques	(PC) Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs (PDF)
Lower Bounds	(LICS) The State Complexity of Alternating Automata (PDF, talk) (PC) Resolution and the binary encoding of combinatorial principles (PDF, talk) (PC) Resolution with Counting: Different Moduli and Tree-Like Lower Bounds (PDF, talk)
LPMLN	(ICLP) A Probabilistic Extension of Action Language BC+ (PDF, talk) (ICLP-DC) Probabilistic Action Language pBC+ (PDF, talk)
LPOD	(ICLP) Translating LPOD and CR-Prolog2 into Standard Answer Set Programs (PDF, talk) (ICLP-DC) Translating P-log, LP^{MLN}, LPOD, and CR-Prolog2 into Standard Answer Set Programs (PDF, talk)
LTLf	(WiL) First-Order vs. Second-Order Encodings for LTLf-to-Automata: An Extended Abstract (PDF, talk)
lucas interpretation	(ThEdu) Lucas Interpretation from Programmers’ Perspective (PDF, talk)
Lukasiewicz Logics	(IJCAR) Probably Half True: Probabilistic Satisfiability over Lukasiewicz Infinitely-valued Logic (PDF, talk)
M
MAC	(CSF) Formal Security Proof of CMAC and its Variants (PDF, talk)
machine checked proofs	(IJCAR) Well-Founded Unions (PDF, talk)
Machine Learning	(ICLP) Cumulative Scoring-based Induction of Default Theories (PDF, talk) (SAT) Machine Learning-based Restart Policy for CDCL SAT Solvers (PDF, talk) (Coq) Proof Construction by Tactic Learning (PDF, talk) (IJCAR) ATPboost: Learning Premise Selection in Binary Setting with ATP Feedback (PDF, talk) (IJCAR) A SAT-Based Approach to Learn Explainable Decision Sets (PDF, talk) (CAV) Fast Numerical Program Analysis with Reinforcement Learning (PDF, talk) (CSF) Privacy Risk in Machine Learning: Analyzing the Connection to Overfitting (PDF, talk) (Isabelle) PaMpeR: A Proof Method Recommendation System for Isabelle/HOL (PDF, talk)
Machine Learning Systems	(VaVAS) Policing Functions for Machine Learning Systems (PDF, talk)
machine words	(ITP) Fast machine words in Isabelle/HOL (PDF, talk)
magic states	(LICS) Logical paradoxes in quantum computation (PDF, talk)
Magic wand	(ADSL) The Complexity of Prenex Separation Logic with One Selector (PDF, talk)
Maple	(SCSC) SMT-like Queries in Maple (PDF, talk)
MapReduce	(ICLP) MASP-Reduce: a proposal for distributed computation of stable models (PDF, talk)
MARCO	(SAT) Finding all Minimal Safe Inductive Sets (PDF, talk)
Markov Decision Process	(MoRe) Safe and Optimal Scheduling of Hard and Soft Tasks (PDF, talk) (MoRe) Logically-Constrained Reinforcement Learning (PDF, talk)
Markov decision processes	(ITP) MDP + TA = PTA: Probabilistic Timed Automata, Formalized (Short Paper) (PDF, talk) (MoRe) Multiple Objectives and Cost Bounds in MDP (PDF, talk) (MoRe) Multi-Scenario Uncertainty in Markov Decision Processes (PDF, talk) (CAV) Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm (PDF, talk) (CAV) Sound Value Iteration (PDF, talk) (CAV) Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives (PDF, talk) (LICS) Distribution-based objectives for Markov Decision Processes (PDF, talk) (LICS) Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes (PDF, talk) (LICS) Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes (PDF, talk) (VaVAS) Policy Generation with Probabilistic Guarantees for Long-term Autonomy of a Mobile Service Robot (PDF, talk)
Markov processes	(LICS) An algebraic theory of Markov processes (PDF, talk)
Martin-L\"{o}f type theory	(LICS) Impredicative Encodings of (Higher) Inductive Types (PDF, talk)
Martin-Löf type theory	(LICS) Dialectica models of type theory (PDF, talk)
Mason's Marks	(LPOP) A Rule-Based Tool for Analysis and Generation of Graphs Applied to Mason's Marks (PDF, talk)
Master Theorem	(ITP) Verified Tail Bounds for Randomized Programs (PDF, talk)
mathematical analysis	(FSCD) Counting Environments and Closures (PDF, talk)
Mathematical language	(UITP) Text-Orientated Formal Mathematics (PDF, talk)
mathematical proof	(ITP) Towards Verified Handwritten Calculational Proofs (short paper) (PDF, talk)
Mathematics	(ITP) An Agda Formalization of Üresin & Dubois' Asynchronous Fixed-Point Theory (PDF, talk)
Matita	(LFMTP) Sharing a library between proof assistants: reaching out to the HOL family (PDF, talk)
Matrix Growth	(WST) A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving (PDF, talk)
Matrix Interpretation	(WST) A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving (PDF, talk)
Matrix semigroups	(LICS) Polynomial Invariants for Affine Programs (PDF, talk)
Maude	(FCS) Statistical Model Checking of Guessing and Timing Attacks on Distance-bounding Protocols (PDF, talk)
Maximum Satisfiability	(IJCAR) Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories (PDF, talk)
MaxSAT	(SAT) Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT (PDF, talk) (SAT) Solving MaxSAT with Bit-Vector Optimization (PDF, talk)
MAXSAT application	(SAT) Approximately Propagation Complete and Conflict Propagating Constraint Encodings (PDF, talk)
MaxSAT resolution	(PC) On Dual-Rail Based MaxSAT Solving (PDF, talk)
MaxSAT solving	(PC) On Dual-Rail Based MaxSAT Solving (PDF, talk)
maxSMT	(IJCAR) MaedMax: A Maximal Ordered Completion Tool (PDF, talk)
MC-SAT	(SMT) Centralizing Equality Reasoning in MCSAT (PDF, talk)
MCMT	(IJCAR) Cubicle-W: Parameterized Model Checking on Weak Memory (PDF, talk)
Mean-payoff games	(SR) Infinite-Duration Richman Bidding Games (PDF, talk) (LICS) A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games (PDF, talk)
meaningless terms	(FSCD) Strict Ideal Completions of the Lambda Calculus (PDF, talk)
mechanical reasoning	(CL&C) Validating Back-links of FOL$_{\mbox{\normalsize ID}}$ Cyclic Pre-proofs (PDF, talk)
mechanised theorem proving	(LICS) Quasi-Open Bisimilarity with Mismatch is Intuitionistic (PDF, talk)
mechanized mathematics	(ITP) A Formally Verified Solver for Homogeneous Linear Diophantine Equations (PDF, talk)
mechanized meta-theory	(LFMTP) Property-Based Testing of Abstract Machines: an Experience Report (PDF, talk)
Mechanized proofs	(WiL) Towards a Playground for Logicians (PDF, talk)
mechanized reasoning	(LICS) Cellular Cohomology in Homotopy Type Theory (PDF, talk)
Memoization	(ITP) Verified Memoization and Dynamic Programming (PDF, talk)
Memory	(ITP) Physical addressing on real hardware in Isabelle/HOL (PDF, talk)
Memory Errors	(ICLP) Shape Neutral Analysis of Graph-based Data-structures (PDF, talk)
memory isolation	(AVOCS) Proof-Oriented Design of a Separation Kernel with Minimal Trusted Computing Base (PDF, talk)
memory model	(FM) Operational Semantics of a Weak Memory Model with Channel Synchronization (PDF, talk)
message passing concurrency	(CAV) On the Completeness of Verifying Message Passing Programs under Bounded Asynchrony (PDF, talk)
Message Passing Interface	(FM) Dynamic Symbolic Verification of MPI Programs (PDF, talk)
meta programming	(ITP) Tactics and certificates in Meta Dedukti (PDF, talk)
meta-data library	(POS) A Problem Meta-Data Library for Research in SAT (PDF, talk)
Meta-Interpretive Learning	(ICLP) Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning (PDF, talk)
meta-programming	(ITP) Towards Certified Meta-Programming with Typed Template-Coq (PDF, talk)
Meta-theory	(WiL) Towards a Playground for Logicians (PDF, talk)
Metamorphic Testing	(VaVAS) Policing Functions for Machine Learning Systems (PDF, talk)
Metareasoning	(ITP) HOL Light QE (PDF, talk)
metatheory	(HoTT/UF) Geometric realization of truncated semi-simplicial sets meta-constructed within HoTT (PDF, talk)
Minimal models	(HDRA) Minimal models for monomial algebras (PDF, talk)
Minimal unsatisfiability	(SAT) Minimal unsatisfiability and minimal strongly connected digraphs (PDF, talk)
Minimally strongly connected digraph	(SAT) Minimal unsatisfiability and minimal strongly connected digraphs (PDF, talk)
Minimisation	(IJCAR) An Assumption-Based Approach for Solving The Minimal S5-Satisfiability Problem (PDF, talk)
MIPS TLB	(ITP) Physical addressing on real hardware in Isabelle/HOL (PDF, talk)
Mixed Arithmetic	(IJCAR) A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems (PDF, talk)
Mixed Distributive Law	(FSCD) Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories (PDF, talk)
Mixed Integer Linear Programming	(RCRA) Optimal Fault-Tolerant Placement of Relay Nodes in a Mission Critical Wireless Network (PDF, talk)
ML	(IJCAR) Proof-Producing Synthesis of CakeML with I/O and Local State from Monadic HOL Functions (PDF, talk)
MMSNP	(LICS) A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP (PDF, talk)
Mobile robotics	(VaVAS) Policy Generation with Probabilistic Guarantees for Long-term Autonomy of a Mobile Service Robot (PDF, talk)
modal fixpoint logic	(PARIS) Collapses of Fixpoint Alternation Hierarchies in Low Type-Levels of Higher-Order Fixpoint Logic (PDF, talk)
modal logic	(IJCAR) An Assumption-Based Approach for Solving The Minimal S5-Satisfiability Problem (PDF, talk) (IJCAR) The Higher-Order Prover Leo-III (PDF, talk) (LICS) Quasi-Open Bisimilarity with Mismatch is Intuitionistic (PDF, talk) (LICS) A van Benthem Theorem for Fuzzy Modal Logic (PDF, talk) (ARQNL) System Demonstration: The Higher-Order Prover Leo-III (PDF, talk)
Modal logics	(WiL) On the Combination of Resolution and SAT Procedures for Modal Theorem-Proving (PDF, talk) (IJCAR) A Resolution-Based Calculus for Preferential Logics (PDF, talk)
modal mu	(LICS) A modal mu perspective on solving parity games in quasipolynomial time. (PDF, talk)
modal mu calculus	(ARQNL) Evidence Extraction from Parameterised Boolean Equation Systems (PDF, talk)
Modal Type Theory	(NLCS) Propositional Attitude Operators in Homotopy Type Theory (PDF, talk) (HoTT/UF) Dependent Right Adjoint Types (PDF, talk)
modalities	(FSCD) Internal Universes in Models of Homotopy Type Theory (PDF, talk) (Linearity/TLLA) On the Lambek Calculus with an Exchange Modality (PDF, talk) (LICS) Guarded Computational Type Theory (PDF, talk)
Model Animation	(FM) From Formal Requirements to Highly Assured Software for Unmanned Aircraft Systems (PDF, talk)
model checking	(ITP) Verifying the LTL to Büchi Automata Translation via Very Weak Alternating Automata (PDF, talk) (LaSh) Monadic Second-Order Model Checking with Fly-Automata (PDF, talk) (FM) Producing Explanations for Rich Logics (PDF, talk) (FM) IPL: An Integration Property Language for Multi-Model Cyber-Physical Systems (PDF, talk) (FM) Stepwise Development and Model Checking of a Distributed Interlocking System - using RAISE (PDF, talk) (FM) Verifying Auto-Generated C Code from Simulink (PDF, talk) (FM) View abstraction for systems with component identities (PDF, talk) (FM) SDN-Actors: Modeling and Verification of SDN Programs (PDF, talk) (SR) Verification of Multi-agent Systems with Imperfect Information and Public Actions (PDF, talk) (SR) Strategy Logic with Imperfect Information (PDF, talk) (SR) Quantifying Bounds in Strategy Logic (PDF, talk) (WPTE) Verification of Ada Programs with AdaHorn (PDF, talk) (CAV) Propositional Dynamic Logic for Higher-Order Functional Programs (PDF, talk) (CAV) Model Checking Quantitative Hyperproperties (PDF, talk) (CAV) Eager Abstraction for Symbolic Model Checking (PDF, talk) (CAV) Monitoring CTMCs By Multi-Clock Timed Automata (PDF, talk) (CAV) Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems (PDF, talk) (CAV) BTOR2, BtorMC and Boolector 3.0 (PDF, talk) (CAV) The JKind Model Checker (PDF, talk) (CAV) SimpleCAR: An Efficient Bug-Finding Tool Based On Approximate Reachability (PDF, talk) (CAV) Attracting Tangles to Solve Parity Games (PDF, talk) (CAV) On the Completeness of Verifying Message Passing Programs under Bounded Asynchrony (PDF, talk) (CAV) Constrained Dynamic Partial Order Reduction (PDF, talk) (CAV) Model Checking Boot Code from AWS Data Centers (PDF, talk) (AVOCS) Writing a Model Checker in 80 Days: Reusable Libraries and Custom Implementation (PDF, talk) (LICS) Distribution-based objectives for Markov Decision Processes (PDF, talk) (VaVAS) RoboTool: Modelling and Verification with RoboChart (PDF, talk)
Model Checking Games	(LaSh) Courcelle’s Theorem – A Game-Theoretic Approach (PDF, talk)
model construction	(IJCAR) Efficient Model Construction for Horn Logic with VLog: System Description (PDF, talk)
Model Counting	(SAT) Fast and Flexible Probabilistic Model Counting (PDF, talk) (PRUV) A New Probabilistic Algorithm for Approximate Model Counting (PDF, talk) (PRUV) VolCE: An Efficient Tool for Solving #SMT(LA) Problems (PDF, talk) (IJCAR) A New Probabilistic Algorithm for Approximate Model Counting (PDF, talk) (CAV) Model Checking Quantitative Hyperproperties (PDF, talk)
Model Expansion	(PRUV) A Model-Theoretic View on Preferences in Declarative Specifications of Search Problems (PDF, talk)
model finding	(FM) CompoSAT: Specification-Guided Coverage for Model Finding (PDF, talk)
model generation	(CAV) Model Generation for Quantified Formulas: A Taint-Based Approach (PDF, talk)
Model learning	(FM) Towards `Verifying' a Water Treatment System (PDF, talk)
Model quality	(ICLP) Improving Candidate Quality of Probabilistic Logic Models (PDF, talk)
Model Revision	(ICLP-DC) Model Revision of Logical Regulatory Networks using Logic-based Tools (PDF, talk)
model sampling	(SAT) Fast Sampling of Perfectly Uniform Satisfying Assignments (PDF, talk)
Model Theory	(PRUV) A Model-Theoretic View on Preferences in Declarative Specifications of Search Problems (PDF, talk) (LICS) A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP (PDF, talk)
Model transformations	(Overture) Transforming an industrial case study from VDM++ to VDM-SL (PDF, talk)
model-based engineering	(FM) IPL: An Integration Property Language for Multi-Model Cyber-Physical Systems (PDF, talk)
Model-Based risk Analysis	(VaVAS) Trust me - I am autonomous (PDF)
model-based testing	(ITP) Fast machine words in Isabelle/HOL (PDF, talk) (FM) Model-Based Testing for Avionics Systems (PDF, talk)
model-checking	(FM) Timed Vacuity (PDF, talk) (VaVAS) Social Consequence Engines (Abstract) (PDF, talk)
Model-checking first-order logic	(LICS) Parameterized circuit complexity of model-checking on sparse structures (PDF, talk)
model-checking problems	(LICS) Tree depth, quantifier elimination, and quantifier rank (PDF, talk)
Model-level uncertainty	(MoRe) Multi-Scenario Uncertainty in Markov Decision Processes (PDF, talk)
Modeling	(VEMDP) Rule-based Design of Computational DNA Devices (PDF, talk)
Modeling and Specification	(CSF) KEVM: A Complete Formal Semantics of the Ethereum Virtual Machine (PDF, talk)
Modelling Languages	(QBF) A Grounder From Second-Order Logic To QBF (PDF, talk)
modelling secure protocols	(CSF) Computer-aided proofs for multiparty computation with active security (PDF, talk)
models	(IJCAR) Theories as Types (PDF, talk)
Models of computation	(DCM) A Category Theoretic Interpretation of Gandy’s Principles for Mechanisms (PDF, talk)
Modular Analysis	(ICLP) Towards Incremental and Modular Context-sensitive Analysis (PDF, talk)
modular approach	(FM) Modular Verification of Programs with Effects and Effect Handlers in Coq (PDF, talk)
Modular Arithmetic	(CAV) Formally Verified Montgomery Multiplication (PDF, talk)
Modular System	(LaSh) A Logic of Information Flows (PDF, talk)
Modular Tensor Category	(DCM) Towards a Formal System for Topological Quantum Computation (PDF, talk)
modules	(LICS) Strong Sums in Focused Logic (PDF, talk)
Molecular computing	(VEMDP) Noise Control for Molecular Computing (PDF, talk)
Molecular Filters	(VEMDP) Molecular Filters for Noise Reduction (PDF, talk)
Molecular programming	(VEMDP) Rule-based Design of Computational DNA Devices (PDF, talk)
Monad	(Linearity/TLLA) On the Lambek Calculus with an Exchange Modality (PDF, talk) (LICS) Syntax and Semantics for Operations with Scopes (PDF, talk)
Monadic Second Order Logic	(LaSh) Monadic Second-Order Model Checking with Fly-Automata (PDF, talk) (LaSh) Courcelle’s Theorem – A Game-Theoretic Approach (PDF, talk)
Monads	(NLCS) Propositional Attitude Operators in Homotopy Type Theory (PDF, talk) (Coq) What is the Foreign Function Interface of the Coq Programming Language? (PDF, talk)
monitoring	(LICS) A Theory of Register Monitors (PDF, talk)
monoidal categories	(FSCD) A diagrammatic axiomatisation of fermionic quantum circuits (PDF, talk) (Linearity/TLLA) From Linear Logic to Cyclic Sharing (PDF, talk) (LICS) Compositional game theory (PDF, talk) (LICS) Two complete axiomatisations of pure-state qubit quantum computing (PDF, talk) (HDRA) Normal forms for planar connected string diagrams (PDF, talk)
Monoidal Coalgebra Modality	(FSCD) Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories (PDF, talk)
monotone	(PC) Complexity of expander-based reasoning and the power of monotone proofs (PDF, talk)
Monotone complexity	(LCC) A recursion-theoretic characterisation of the positive polynomial-time functions (PDF, talk) (PC) Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk)
Monotone proofs	(PC) Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk)
monotonicity	(NLCS) Automated Reasoning from Polarized Parse Trees (PDF, talk)
Montague semantics	(NLCS) Do different syntactic trees yield different logical readings? Some remarks on head variables in typed lambda calculus. (PDF, talk)
Montgomery Multiplication	(CAV) Formally Verified Montgomery Multiplication (PDF, talk)
MPI	(DS-FM) Analysis and Verification of Message Passing based Parallel Programs (PDF, talk)
MSO	(WiL) First-Order vs. Second-Order Encodings for LTLf-to-Automata: An Extended Abstract (PDF, talk) (LaSh) Monadic Second-Order Model Checking with Fly-Automata (PDF, talk) (LaSh) A Derivative-Based Decision Procedure for WS1S (PDF, talk) (LICS) MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras (PDF, talk)
MSO on Infinite Words	(PARIS) LMSO: A Curry-Howard Approach to Church’s Synthesis via Linear Logic (PDF, talk)
MSO on omega-Words	(LICS) LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic (PDF, talk)
MSO transduction	(LICS) Regular and First Order List Functions (PDF, talk)
mu-calculus	(FM) Producing Explanations for Rich Logics (PDF, talk)
Multi Factor	(CSF) An extensive formal analysis of multi-factor authentication protocols (PDF, talk)
Multi-agent systems	(SR) Verification of Multi-agent Systems with Imperfect Information and Public Actions (PDF, talk) (SR) Local Equilibria in Logic-Based Multi-Player Games (PDF, talk)
Multi-agent workflows	(CSF) Inductive Invariants for Noninterference in Multi-agent Workflows (PDF, talk)
Multi-clock timed automata	(CAV) Monitoring CTMCs By Multi-Clock Timed Automata (PDF, talk)
Multi-graphs	(TERMGRAPH) Drags: an algebraic framework for graph rewriting (PDF, talk)
multi-modelling	(Overture) Design Space Exploration for Secure Building Control (PDF, talk) (Overture) Multi-modelling of Cooperative Swarms (PDF, talk)
multi-objective optimization	(LICS) Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes (PDF, talk)
Multi-objective synthesis	(MoRe) Safe and Optimal Scheduling of Hard and Soft Tasks (PDF, talk)
Multi-party computation	(CSF) Enforcing ideal-world leakage bounds in real-world secret sharing MPC frameworks (PDF, talk)
Multi-Pass Dynamic Programming	(SAT) Exploiting Treewidth for Projected Model Counting and its Limits (PDF, talk)
Multi-player games	(SR) Local Equilibria in Logic-Based Multi-Player Games (PDF, talk)
Multi-Robot planning	(FM) Multi-Robot LTL Planning Under Uncertainty (PDF, talk)
Multi-valued Logic	(IJCAR) Probably Half True: Probabilistic Satisfiability over Lukasiewicz Infinitely-valued Logic (PDF, talk)
multicategories	(HDRA) Merge-bicategories: towards semi-strictification of higher categories (PDF, talk)
multiplayer games	(MoRe) Constraint Problem for Weak Subgame Perfect Equilibria with omega-regular Boolean Objectives (PDF, talk)
multiplicative linear logic	(Linearity/TLLA) Proof nets, coends and the Yoneda isomorphism (PDF, talk)
Multiplier Verification	(SCSC) A Practical Polynomial Calculus for Arithmetic Circuit Verification (PDF, talk)
multitope	(HDRA) The equivalence between opetopic sets and many-to-one polygraphs (PDF, talk)
muMALL	(PARIS) Local validity for circular proofs in linear logic with fixed points (PDF, talk)
N
N player games	(LICS) Rational Synthesis Under Imperfect Information (PDF, talk)
nanoCoP	(PAAR) Proof Search Optimizations for Non-clausal Connection Calculi (PDF, talk)
Nanofabricated Devices	(VEMDP) Formal Verification of Network-Based Biocomputation Circuits (PDF, talk)
narrowing	(WPTE) On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions (PDF, talk)
Nash equilibria	(SR) Compositional Game Theory (PDF, talk)
Nash equilibrium	(SR) Local Equilibria in Logic-Based Multi-Player Games (PDF, talk) (LICS) Rational Synthesis Under Imperfect Information (PDF, talk)
Natural deduction	(ThEdu) Natural Deduction Assistant (NaDeA) (PDF, talk) (CL&C) On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains (PDF, talk) (PAAR) Efficient translation of sequent calculus proofs into natural deduction proofs (PDF, talk) (ITRS) Natural Deduction and Normalization Proofs for the Intersection Type Discipline (PDF, talk)
Natural language	(UITP) Text-Orientated Formal Mathematics (PDF, talk)
natural language processing	(NLCS) OpenWordNet-PT: Taking Stock (PDF, talk) (NLCS) Anti-Unification and Natural Language Processing (PDF, talk)
natural language understanding	(NLCS) OpenWordNet-PT: Taking Stock (PDF, talk) (ICLP) An ASP Methodology for Understanding Narratives about Stereotypical Activities (PDF, talk) (ICLP-DC) The Learning-Knowledge-Reasoning Paradigm For Natural Language Understanding and Question Answering (PDF, talk)
Natural mathematical language	(ThEdu) Towards intuitive reasoning in axiomatic geometry (PDF, talk)
natural proofs	(LCC) Feasibly constructive proofs of succinct weak circuit lower bounds (PDF, talk)
Natural-style Proofs	(SCSC) Techniques for Natural-style Proofs in Elementary Analysis (PDF, talk)
Negation as failure	(ICLP) Cumulative Scoring-based Induction of Default Theories (PDF, talk)
Negation in Logic Programming	(ICLP) Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs (PDF, talk)
Negative translations	(LICS) Around Classical and Intuitionistic Linear Logics (PDF, talk)
neighbourhood singleton arc consistency	(RCRA) Partial (Neighbourhood) Singleton Arc Consistency for Constraint Satisfaction Problems (PDF, talk)
Nelson-Oppen	(IJCAR) Complexity of Combinations of Qualitative Constraint Satisfaction Problems (PDF, talk)
nested sequents	(TYDI) Nested sequents for modal logics and beyond (PDF, talk)
nested systems	(WiL) A semantical view of sequent based systems (PDF, talk) (TYDI) Sequentialising nested systems (PDF, talk)
Network Based Biocomputation	(VEMDP) Formal Verification of Network-Based Biocomputation Circuits (PDF, talk)
Network Intrusion Detection	(FCS) LISA: Predicting the Impact of DoS Attacks on Real-World Low Power IoT Systems (PDF, talk)
Network-free simulation	(VEMDP) Rule-Based Gillespie Simulation of Chemical Systems (PDF, talk)
networks of synchronized automata	(AVOCS) Using SMT engine to generate Symbolic Automata (PDF, talk)
neural network	(DS-FM) Formal verification of neural networks (PDF, talk)
neural networks	(PAAR) Dynamic Strategy Priority: Empower the strong and abandon the weak (PDF, talk)
Newman's lemma	(IWC) Critical pairs for Gray categories (PDF, talk)
next state relation	(IJCAR) A FOOLish Encoding of the Next State Relations of Imperative Programs (PDF, talk)
Noise Reduction	(VEMDP) Molecular Filters for Noise Reduction (PDF, talk)
nominal rewriting	(UNIF) Rewriting with Generalized Nominal Unification (PDF, talk)
nominal terms	(FSCD) Fixed-Point Constraints for Nominal Equational Unification (PDF, talk)
nominal unification	(FSCD) Fixed-Point Constraints for Nominal Equational Unification (PDF, talk) (FSCD) Nominal Unification with Atom and Context Variables (PDF, talk) (UNIF) Rewriting with Generalized Nominal Unification (PDF, talk)
nominalizations	(NLCS) OpenWordNet-PT: Taking Stock (PDF, talk)
non-clausal theorem proving	(PAAR) Proof Search Optimizations for Non-clausal Connection Calculi (PDF, talk)
non-cnf	(SAT) Circuit-based Search Space Pruning in QBF (PDF, talk)
non-commutative	(Linearity/TLLA) On the Lambek Calculus with an Exchange Modality (PDF, talk)
non-denoting terms	(ARQNL) Labelled calculi for QMLs with non-rigid and non-denoting terms (PDF, talk)
Non-Deterministic Automata	(LICS) One Theorem to Rule Them All: A Unified Translation of LTL into $\omega$-Automata (PDF, talk)
non-idempotency	(LICS) Every λ-Term is Meaningful for the Infinitary Relational Model (PDF, talk)
non-idempotent intersection types	(ITRS) Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (PDF, talk)
Non-interference	(CSF) Inductive Invariants for Noninterference in Multi-agent Workflows (PDF, talk)
Non-interleaving semantics	(CAV) Quasi-Optimal Partial Order Reduction (PDF, talk)
Non-lawlike computability	(LICS) Computability Beyond Church-Turing via Choice Sequences (PDF, talk)
non-linear arithmetic	(SCSC) Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT (PDF, talk)
Non-linear Real Arithmetic	(SCSC) Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics (PDF, talk)
Non-monotonic Reasoning	(RCRA) Externally Supported Models for Efficient Computation of Paracoherent Answer Sets (PDF, talk)
non-rigid terms	(ARQNL) Labelled calculi for QMLs with non-rigid and non-denoting terms (PDF, talk)
Non-Termination Bugs	(CAV) Symbolic Liveness Analysis of Real-World Software (PDF, talk)
Non-termination Proving	(CAV) Syntax-Guided Termination Analysis (PDF, talk)
non-wellfounded proofs	(CL&C) Some ideas on cut-elimination for cyclic arithmetic proofs (PDF, talk) (PARIS) Local validity for circular proofs in linear logic with fixed points (PDF, talk)
non-zero sum games	(LICS) Rational Synthesis Under Imperfect Information (PDF, talk)
nondeterminism	(LPOP) A software system should be declarative except where it interacts with the real world (PDF, talk) (DCM) Generic Graph Semantics (PDF, talk) (LICS) Classical realizability as a classifier for nondeterminism (PDF, talk)
nonlinear integer arithmetic	(SAT) Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization (PDF, talk) (IJCAR) A Why3 framework for reflection proofs and its application to GMP's algorithms (PDF, talk)
NonMonotonic Semantics	(ICLP) Declarative Algorithms in Datalog with Aggregates: user-friendly formal semantics conducive to performance and scalability (PDF, talk)
nonmonotonic term orders	(IJCAR) Superposition for Lambda-Free Higher-Order Logic (PDF, talk)
nonnegativity certificate	(PC) Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
Normal Form	(PAAR) Evaluating Pre-Processing Techniques for the Separated Normal Form for Temporal Logics (PDF, talk)
normal form bisimulation	(ITP) A Formal Equational Theory for Call-By-Push-Value (PDF, talk)
normal forms	(HDRA) Normal forms for planar connected string diagrams (PDF, talk)
normalisation	(FSCD) Strict Ideal Completions of the Lambda Calculus (PDF, talk) (TYDI) Two Unifying Structural Principles (PDF, talk)
Normalization	(HOR) Normalization and Taylor expansion of lambda-terms (PDF, talk) (ITRS) Natural Deduction and Normalization Proofs for the Intersection Type Discipline (PDF, talk)
norms	(VaVAS) Social Consequence Engines (Abstract) (PDF, talk)
Notation	(Coq) Teaching Your Rooster to Crow in C (PDF, talk) (LFMTP) What Does This Notation Mean Anyway? BNF-Style Notation as it is actually used (PDF, talk)
Notebooks	(F-IDE) A Notebook Format for the Holistic Design of Embedded Systems (PDF, talk)
novel applications domains	(SAT) Constrained Image Generation Using Binarized Neural Networks with Decision Procedures (PDF, talk)
Nowhere dense graphs	(LICS) On the number of types in sparse graphs (PDF, talk)
Numerical Program Analysis	(CAV) Fast Numerical Program Analysis with Reinforcement Learning (PDF, talk)
Nuprl	(WiL) On Expanding Standard Notions of Constructivity (PDF, talk)
Nuprl proof assistant	(LICS) Computability Beyond Church-Turing via Choice Sequences (PDF, talk)
nuxmv	(AVOCS) A Framework for the Formal Verification of Networks of Railway Interlockings - Application to the Belgian Railways (PDF, talk)
O
o-minimality	(MoRe) Stochastic o-minimal hybrid systems (PDF, talk)
OBDD	(PC) Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk)
Object Constraint Language (OCL)	(LPOP) Security Policies in Constraint Handling Rules (PDF, talk)
object-oriented	(FM) Object-Oriented Security Proofs (PDF, talk)
Object-oriented programs	(FM) A lightweight deadlock analysis for programs with threads and reentrant locks (PDF, talk)
observational equivalence	(ITP) A Formal Equational Theory for Call-By-Push-Value (PDF, talk) (WPTE) Automating the Diagram Method to Prove Correctness of Program Transformations (PDF, talk) (LICS) Probabilistic Böhm Trees and Probabilistic Separation (PDF, talk)
OCaml library	(LFMTP) Abstract Representation of Binders in OCaml using the Bindlib Library (PDF, talk)
Ocra	(AVOCS) A Framework for the Formal Verification of Networks of Railway Interlockings - Application to the Belgian Railways (PDF, talk)
odd-even network	(POS) Competitive Sorter-based Encoding of PB-Constraints into SAT (PDF, talk)
omega-languages	(FM) A Weakness Measure for GR(1) Formulae (PDF, talk) (LICS) A Theory of Register Monitors (PDF, talk)
Omega-regular languages	(LICS) Automaton-Based Criteria for Membership in CTL (PDF, talk)
omega-regular objectives	(MoRe) Constraint Problem for Weak Subgame Perfect Equilibria with omega-regular Boolean Objectives (PDF, talk) (MoRe) Parameterized complexity of games with monotonically ordered omega-regular objectives (PDF, talk)
OMT	(SMT) Puli - A Problem-Specific OMT Solver (PDF, talk)
Online Decomposition	(CAV) Fast Numerical Program Analysis with Reinforcement Learning (PDF, talk)
Online Social Networks	(FM) Timed Epistemic Knowledge Bases for Social Networks (PDF, talk)
ontologies	(IJCAR) FAME: An Automated Tool for Semantic Forgetting in Expressive Description Logics (PDF, talk)
Ontology	(ICLP-DC) Natural Language Generation From Ontologies (PDF, talk)
Ontology Languages	(PRUV) Leveraging Probabilistic Existential Rules for Adversarial Deduplication (PDF, talk)
Ontology Reasoning	(ICLP) Natural Language Generation From Ontologies: Application Paper (PDF, talk)
open games	(SR) Compositional Game Theory (PDF, talk) (LICS) Compositional game theory (PDF, talk)
Open-WBO	(SAT) Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers (PDF, talk)
OpenFlow	(FM) SDN-Actors: Modeling and Verification of SDN Programs (PDF, talk)
OpenJDK	(F-IDE) Experience Report on Formally Verifying Parts of OpenJDK's API with KeY (PDF, talk)
OpenTheory	(LFMTP) Sharing a library between proof assistants: reaching out to the HOL family (PDF, talk)
Operad	(Linearity/TLLA) Generalized generalized species of structure and resource modalities (PDF, talk) (HDRA) Generalizations of the associative operad and convergent rewrite systems (PDF, talk)
Operating System Verification	(ITP) Program Verification in the Presence of Cached Address Translation (PDF, talk)
operational semantics	(FM) A wide-spectrum language for verification of programs on weak memory models (PDF, talk) (FM) Operational Semantics of a Weak Memory Model with Channel Synchronization (PDF, talk) (WPTE) Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics (PDF, talk) (CSF) KEVM: A Complete Formal Semantics of the Ethereum Virtual Machine (PDF, talk) (Linearity/TLLA) The Bang Calculus and the Two Girard's Translations (PDF, talk)
Operational Termination	(WST) Well-founded models in proofs of termination (PDF, talk)
opetope	(HDRA) The equivalence between opetopic sets and many-to-one polygraphs (PDF, talk)
Optical Networks on Chip	(RCRA) Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper) (PDF, talk)
optimal propagation	(SAT) Approximately Propagation Complete and Conflict Propagating Constraint Encodings (PDF, talk)
Optimal Scheduling	(ICLP) Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP (PDF, talk)
Optimal Upper Bound	(LICS) A Simple and Optimal Complementation Algorithm for Büchi Automata (PDF, talk)
Optimisation	(Overture) Design Space Exploration for Secure Building Control (PDF, talk) (RCRA) Greedy Randomized Search for Scalable Compilation of Quantum Circuits (PDF, talk) (RCRA) Optimal Fault-Tolerant Placement of Relay Nodes in a Mission Critical Wireless Network (PDF, talk)
optimization	(CAV) Delta-Decision Procedures for Exists-Forall Problems over the Reals (PDF, talk) (DS-FM) Formal verification of neural networks (PDF, talk)
Optimization heuristics	(MoRe) Multi-Scenario Uncertainty in Markov Decision Processes (PDF, talk)
Optimization Modulo Bit-Vectors	(SAT) Solving MaxSAT with Bit-Vector Optimization (PDF, talk)
optimization techniques	(PAAR) Proof Search Optimizations for Non-clausal Connection Calculi (PDF, talk)
optimizations	(ITP) A Formal Equational Theory for Call-By-Push-Value (PDF, talk)
OR causality	(LICS) Concurrency and Probability: Removing Confusion, Compositionally (PDF, talk)
oracle Turing machines	(LICS) Type-two polynomial-time and restricted lookahead. (PDF, talk)
order invariant definability	(LCC) Traversal-invariant definability and Logarithmic-space computation (PDF, talk)
order theory	(SR) Beyond admissibility: Dominance between chains of strategies (PDF, talk)
ordered completion	(IWC) Certified Ordered Completion (PDF, talk)
ordered objectives	(MoRe) Parameterized complexity of games with monotonically ordered omega-regular objectives (PDF, talk)
ordered structures	(HoTT/UF) Ordered Cubes (PDF, talk)
ordering	(UNIF) Unification Based on Generalized Embedding (PDF, talk)
ordinal diagram system	(TERMGRAPH) On quasi ordinal diagram systems (PDF, talk)
Ordinary differential equation	(CAV) Monitoring CTMCs By Multi-Clock Timed Automata (PDF, talk)
ordinary differential equations	(FM) Vector Barrier Certificates and Comparison Systems (PDF, talk)
Origin	(LICS) Logics for Word Transductions with Synthesis (PDF, talk)
over-approximation	(FSCD) Completeness of Tree Automata Completion (PDF, talk)
Overture	(Overture) Overture FMU: Export VDM-RT Models as Tool-Wrapper FMUs (PDF, talk) (Overture) VDM at large: analysing the EMV Next Generation Kernel (PDF, talk) (Overture) Integrating VDM-SL into the continuous delivery pipelines of cloud-based software (PDF, talk)
P
Paracoherent Answer Sets	(RCRA) Externally Supported Models for Efficient Computation of Paracoherent Answer Sets (PDF, talk)
Parallel computation	(DCM) A Category Theoretic Interpretation of Gandy’s Principles for Mechanisms (PDF, talk)
parallel improvements	(WPTE) Optimizing Space of Parallel Processes (PDF, talk)
Parallel Processing	(POS) Tuning Parallel SAT Solvers (PDF, talk)
parallelism	(ICLP) MASP-Reduce: a proposal for distributed computation of stable models (PDF, talk)
parameter optimization	(POS) CryptoMiniSat Parameter-Optimization for Solving Cryptographic Instances (PDF, talk)
parameter-free axioms	(PC) Bounded induction without parameters (PDF, )
parameterised Boolean equation systems	(ARQNL) Evidence Extraction from Parameterised Boolean Equation Systems (PDF, talk)
Parameterised verification problem	(FM) View abstraction for systems with component identities (PDF, talk)
parameterized AC^0	(LICS) Tree depth, quantifier elimination, and quantifier rank (PDF, talk) (LICS) A parameterized halting problem, the linear time hierarchy, and the MRDP theorem (PDF, talk)
Parameterized Algorithms	(SAT) Exploiting Treewidth for Projected Model Counting and its Limits (PDF, talk)
parameterized complexity	(SAT) QBF as an Alternative to Courcelle's Theorem (PDF, talk)
Parameterized Model Checking	(IJCAR) Cubicle-W: Parameterized Model Checking on Weak Memory (PDF, talk)
parameterized systems	(CAV) Eager Abstraction for Symbolic Model Checking (PDF, talk)
parameterized verification	(HCVS) Declarative Parameterized Verification of Topology-sensitive Distributed Protocols (PDF, talk) (CAV) Peregrine: A Tool for the Analysis of Population Protocols (PDF, talk)
Parametricity	(ITP) Relational parametricity and quotient preservation for modular (co)datatypes (PDF, talk) (Coq) What is the Foreign Function Interface of the Coq Programming Language? (PDF, talk) (LICS) Degrees of Relatedness - A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory (PDF, talk) (LICS) A General Framework for Relational Parametricity (PDF, talk)
parametrized systems	(FM) Formal Specification and Verification of Dynamic Parametrized Architectures (PDF, talk)
Parity Game	(CAV) Strix: Explicit Reactive Synthesis Strikes Back! (PDF, talk) (CAV) Attracting Tangles to Solve Parity Games (PDF, talk)
parity games	(SR) Infinite-Duration Richman Bidding Games (PDF, talk) (SR) Solving Parity Games: Explicit vs Symbolic (PDF, talk) (SR) Dependences in Strategy Logic (PDF, talk) (LICS) A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games (PDF, talk) (LICS) A modal mu perspective on solving parity games in quasipolynomial time. (PDF, talk)
parsing	(NLCS) OpenWordNet-PT: Taking Stock (PDF, talk)
Partial algorithms in Coq	(ITP) Proof Pearl: Constructive Extraction of Cycle Finding Algorithms (PDF, talk)
partial correctness	(WPTE) Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics (PDF, talk)
Partial Evaluation	(WST) Control-Flow Refinement via Partial Evaluation (PDF, talk)
Partial Functions	(ICLP) Functional ASP with Intensional Sets; Application to Gelfond-Zhang Agreggates (PDF, talk)
Partial models	(FM) Multi-Robot LTL Planning Under Uncertainty (PDF, talk)
partial order reduction	(FM) SDN-Actors: Modeling and Verification of SDN Programs (PDF, talk) (CAV) Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems (PDF, talk) (CAV) Partial Order Aware Concurrency Sampling (PDF, talk)
Partial-order reduction	(CAV) Quasi-Optimal Partial Order Reduction (PDF, talk)
path orderings	(WST) GPO: A Path Ordering for Graphs (PDF, talk)
pattern matching	(Isabelle) Lazy Algebraic Types in Isabelle/HOL (PDF, talk)
paycheck pronouns	(NLCS) Paychecks, Presupposition, and Dependent Types (PDF, talk)
PB constraints	(RCRA) Encoding PB Constraints into SAT via Binary Adders and BDDs -- Revisited (PDF, talk)
PDL	(LICS) Wreath Products of Distributive Forest Algebras (PDF, talk)
PDR	(SAT) Finding all Minimal Safe Inductive Sets (PDF, talk) (SMT) Discovering Universally Quantified Solutions for Constrained Horn Clauses (PDF, talk)
PDR-Z3	(WPTE) Verification of Ada Programs with AdaHorn (PDF, talk)
Peano arithmetic	(CL&C) Some ideas on cut-elimination for cyclic arithmetic proofs (PDF, talk) (PARIS) On the logical complexity of cyclic arithmetic (PDF, talk)
Perfect masking	(CAV) SCInfer: Refinement-based Verification of Software Countermeasures against Side-Channel Attacks (PDF, talk)
perfect samplers	(SAT) Fast Sampling of Perfectly Uniform Satisfying Assignments (PDF, talk)
permission inference	(CAV) Permission Inference for Array Programs (PDF, talk)
permission model	(CSF) A Permission-Dependent Type System for Secure Information Flow Analysis (PDF, talk)
Permissions	(ADSL) A Complete Proof System for Basic Symbolic Heaps with Permissions (PDF, talk)
Permutation problems	(RCRA) Algebraic Crossover Operators for Permutations (PDF, talk)
permutations	(Coq) Preliminary Report on the Yalla Library (PDF, talk)
Persistent places	(LICS) Concurrency and Probability: Removing Confusion, Compositionally (PDF, talk)
Petri nets	(LICS) Concurrency and Probability: Removing Confusion, Compositionally (PDF, talk)
Phylostatic	(ICLP) Natural Language Generation From Ontologies: Application Paper (PDF, talk)
Phylotastic	(ICLP-DC) Natural Language Generation From Ontologies (PDF, talk)
pi calculus	(LICS) Eager Functions as Processes (PDF, talk)
pi-caclulus	(WiL) A New Linear Logic for Deadlock-Free Session-Typed Processes (Talk Abstract) (PDF, talk)
pi-calculus	(DCM) Pointing to Private Names (PDF, talk) (LICS) Quasi-Open Bisimilarity with Mismatch is Intuitionistic (PDF, talk)
Picat	(LPOP) A Picat-based XCSP Solver - from Parsing, Modeling, to SAT Encoding (PDF, talk)
Planning	(ICLP) Phylotastic: An Experiment in Creating, Manipulating, and Evolving Phylogenetic Biology Workflows Using Logic Programming (PDF, talk) (ICLP-DC) Scalable Robotic Intra-Logistics with Answer Set Programming (PDF, talk) (RCRA) Greedy Randomized Search for Scalable Compilation of Quantum Circuits (PDF, talk) (VaVAS) Social Consequence Engines (Abstract) (PDF, talk)
Planning under uncertainty	(MoRe) Multiple Objectives and Cost Bounds in MDP (PDF, talk)
PMCFG	(NLCS) Automatic test suite generation for PMCFG grammars (PDF, talk)
pointer arithmetic	(ADSL) On the Complexity of Pointer Arithmetic in Separation Logic (PDF, talk)
pointfree topology	(LICS) Computable decision-making on the reals and other spaces via partiality and nondeterminism (PDF, talk)
polarity	(NLCS) Automated Reasoning from Polarized Parse Trees (PDF, talk)
Policing function	(VaVAS) Policing Functions for Machine Learning Systems (PDF, talk)
policy language	(FCS) An Expressive, Flexible and Uniform Logical Formalism for Attribute-based Access Control (PDF, talk)
Policy Synthesis	(MoRe) Logically-Constrained Reinforcement Learning (PDF, talk)
polycategories	(HDRA) Merge-bicategories: towards semi-strictification of higher categories (PDF, talk)
polygraph	(FSCD) Coherence of Gray categories via rewriting (PDF, talk) (HDRA) The equivalence between opetopic sets and many-to-one polygraphs (PDF, talk)
polygraphs	(HDRA) Merge-bicategories: towards semi-strictification of higher categories (PDF, talk)
Polyhedra Domain Analysis	(CAV) Fast Numerical Program Analysis with Reinforcement Learning (PDF, talk)
Polymers	(VEMDP) Conservative Approximations of Polymers (PDF, talk)
polymorphism	(LICS) Impredicative Encodings of (Higher) Inductive Types (PDF, talk) (SMT) Alt-Ergo 2.2 (PDF, talk)
Polynomial Calculus	(SCSC) A Practical Polynomial Calculus for Arithmetic Circuit Verification (PDF, talk)
Polynomial Factorization	(ITP) A Formalization of the LLL Basis Reduction Algorithm (PDF, talk)
polynomial functor	(LICS) Dialectica models of type theory (PDF, talk)
Polynomial functors	(HoTT/UF) Algebraic models of dependent type theory (PDF, talk) (LICS) What's in a game? A theory of game models (PDF, talk)
Polynomial hierarchy	(IJCAR) Focussing, MALL and the polynomial hierarchy (PDF, talk)
polynomial simulation	(PC) On Dual-Rail Based MaxSAT Solving (PDF, talk)
polynomial upper bounds	(PC) On Dual-Rail Based MaxSAT Solving (PDF, talk)
polynomial-time tractability	(LICS) A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP (PDF, talk)
polytyptic programming	(ITP) Relational parametricity and quotient preservation for modular (co)datatypes (PDF, talk)
population protocols	(CAV) Peregrine: A Tool for the Analysis of Population Protocols (PDF, talk)
port graphs	(TERMGRAPH) Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting (PDF, talk)
Portfolio	(QBF) Portfolio-Based Algorithm Selection for Circuit QBFs (PDF, talk)
Portfolio Solver	(POS) Tuning Parallel SAT Solvers (PDF, talk)
Positive complexity	(LCC) A recursion-theoretic characterisation of the positive polynomial-time functions (PDF, talk)
Post Correspondence Problem	(ITP) Verification of PCP-Related Computational Reductions in Coq (PDF, talk)
power-law	(SAT) Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT (PDF, talk)
precision medicine	(RCRA) Computing Personalised Treatments through In Silico Clinical Trials. A Case Study on Downregulation in Assisted Reproduction. (PDF, talk)
precondition inference	(ICLP) An iterative approach to precondition inference using constrained Horn clauses (PDF, talk)
predecessor function	(ITP) Efficient Mendler-Style Lambda-Encodings in Cedille (PDF, talk)
predicate	(ICLP) Constraint Answer Set Programming without Grounding (PDF, talk)
Predicate Abstraction	(FM) Deadlock Detection for Actor-based Coroutines (PDF, talk)
preference	(ICLP) Introspecting Preferences In Answer Set Programming (PDF, talk) (ICLP-DC) Translating P-log, LP^{MLN}, LPOD, and CR-Prolog2 into Standard Answer Set Programs (PDF, talk) (PRUV) Evidential Group Decision Making Model with Belief-Based Preferences (PDF, talk)
Preference Logic	(PRUV) A new logic for jointly representing hard and soft constraints (PDF, talk)
Preference Modeling	(PRUV) A Model-Theoretic View on Preferences in Declarative Specifications of Search Problems (PDF, talk)
Preferential Logics	(PRUV) Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure (PDF, talk) (IJCAR) A Resolution-Based Calculus for Preferential Logics (PDF, talk)
prefix-constrained term rewriting	(FSCD) Confluence of Prefix-Constrained Rewrite Systems (PDF, talk)
premature convergence	(RCRA) An Enhanced Genetic Algorithm with the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem (PDF, talk)
preprocessing	(IJCAR) QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property (PDF, talk) (PAAR) Evaluating Pre-Processing Techniques for the Separated Normal Form for Temporal Logics (PDF, talk)
presheaf models	(HoTT/UF) Internalizing Presheaf Semantics: Charting the Design Space (PDF, talk)
presheaf semantics	(LICS) Degrees of Relatedness - A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory (PDF, talk)
Presheaves	(LICS) What's in a game? A theory of game models (PDF, talk)
presupposition	(NLCS) Paychecks, Presupposition, and Dependent Types (PDF, talk)
pretty printing	(Coq) Teaching Your Rooster to Crow in C (PDF, talk)
primary key	(IJCAR) Automated Reasoning about Key Sets (PDF, talk)
Prime Numbers	(LICS) The State Complexity of Alternating Automata (PDF, talk)
priorities	(WiL) A New Linear Logic for Deadlock-Free Session-Typed Processes (Talk Abstract) (PDF, talk)
Privacy	(FM) Timed Epistemic Knowledge Bases for Social Networks (PDF, talk) (CSF) Enforcing ideal-world leakage bounds in real-world secret sharing MPC frameworks (PDF, talk) (CSF) Privacy Risk in Machine Learning: Analyzing the Connection to Overfitting (PDF, talk)
Privacy-type properties	(CAV) The DEEPSEC prover (PDF, talk)
proactive security	(CSF) Self-Guarding Cryptographic Protocols against Algorithm Substitution Attacks (PDF, talk)
probabilistic	(ITP) Verified Analysis of Random Binary Tree Structures (PDF, talk)
Probabilistic Algorithm	(PRUV) A New Probabilistic Algorithm for Approximate Model Counting (PDF, talk) (IJCAR) A New Probabilistic Algorithm for Approximate Model Counting (PDF, talk)
probabilistic bisimilarity	(CAV) Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains (PDF, talk)
probabilistic bisimilarity distance	(CAV) Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains (PDF, talk)
Probabilistic Boolean Program	(CAV) SCInfer: Refinement-based Verification of Software Countermeasures against Side-Channel Attacks (PDF, talk)
Probabilistic computation	(LICS) Probabilistic stable functions on discrete cones are power series. (PDF, talk)
probabilistic CTL	(LICS) Riesz Modal Logic with Threshold Operators (PDF, talk)
probabilistic finite automata	(LICS) Distribution-based objectives for Markov Decision Processes (PDF, talk)
probabilistic games	(CAV) Reactive Control Improvisation (PDF, talk)
Probabilistic graphical models	(ICLP) Constraint-Based Inference in Probabilistic Logic Programs (PDF, talk)
Probabilistic Inductive Logic Programming	(ICLP) Improving Candidate Quality of Probabilistic Logic Models (PDF, talk)
probabilistic lambda-calculus	(LICS) Probabilistic Böhm Trees and Probabilistic Separation (PDF, talk)
Probabilistic Logic	(IJCAR) Probably Half True: Probabilistic Satisfiability over Lukasiewicz Infinitely-valued Logic (PDF, talk)
Probabilistic logic programming	(ICLP) Constraint-Based Inference in Probabilistic Logic Programs (PDF, talk)
Probabilistic model checking	(F-IDE) A Notebook Format for the Holistic Design of Embedded Systems (PDF, talk) (CAV) Sound Value Iteration (PDF, talk) (CAV) Safety-Aware Apprenticeship Learning (PDF, talk) (VaVAS) Towards a Hierarchical-Control Architecture for Distributed Autonomous Systems (Extended Abstract - Paper) (PDF, talk) (VaVAS) Probabilistic Model Checking for Autonomous Agent Strategy Synthesis - Extended Abstract (PDF, talk) (VaVAS) Policy Generation with Probabilistic Guarantees for Long-term Autonomy of a Mobile Service Robot (PDF, talk)
Probabilistic planning	(VaVAS) Policy Generation with Probabilistic Guarantees for Long-term Autonomy of a Mobile Service Robot (PDF, talk)
Probabilistic programs	(WST) Inference of Linear Upper-Bounds on the Expected Cost by Solving Cost Relations (PDF, talk) (CAV) Constraint-Based Synthesis of Coupling Proofs (PDF, talk) (LICS) The concurrent game semantics of Probabilistic PCF (PDF, talk)
probabilistic reasoning	(ICLP) A Probabilistic Extension of Action Language BC+ (PDF, talk) (ICLP-DC) Probabilistic Action Language pBC+ (PDF, talk)
Probabilistic rewriting	(FCS) Statistical Model Checking of Guessing and Timing Attacks on Distance-bounding Protocols (PDF, talk)
Probabilistic Satisfiability	(IJCAR) Probably Half True: Probabilistic Satisfiability over Lukasiewicz Infinitely-valued Logic (PDF, talk)
Probabilistic State Space Exploration	(CAV) Partial Order Aware Concurrency Sampling (PDF, talk)
probabilistic systems	(LICS) Distribution-based objectives for Markov Decision Processes (PDF, talk)
Probabilistic Timed Automata	(ITP) MDP + TA = PTA: Probabilistic Timed Automata, Formalized (Short Paper) (PDF, talk)
probabilistic verification	(CAV) Constraint-Based Synthesis of Coupling Proofs (PDF, talk) (CAV) Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm (PDF, talk) (LICS) Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes (PDF, talk)
probability	(ITP) Verified Tail Bounds for Randomized Programs (PDF, talk)
problem database	(IJCAR) Cops and CoCoWeb: Infrastructure for Confluence Tools (PDF, talk)
problem encodings and reformulations	(SAT) Constrained Image Generation Using Binarized Neural Networks with Decision Procedures (PDF, talk)
problem fingerprinting	(POS) A Problem Meta-Data Library for Research in SAT (PDF, talk)
procedural interpretation	(ICLP) Top-down and Bottom-up Evaluation Reconciled (PDF, talk)
process calculi	(TYDI) Truely Concurrent Processes in the Calculus of Structures (PDF, talk)
process calculus	(Linearity/TLLA) Taking Linear Logic Apart (PDF, talk)
product types	(ITRS) Intersection Subtyping with Constructors (PDF, talk)
profunctor	(LICS) Species, Profunctors and Taylor Expansion Weighted by SMCC--A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs-- (PDF, talk)
Program Analysis	(ICLP) Towards Incremental and Modular Context-sensitive Analysis (PDF, talk) (ICLP) Shape Neutral Analysis of Graph-based Data-structures (PDF, talk) (LaSh) Decidable Linear Tree Constraints (PDF, talk) (FM) Variant analysis with QL (PDF, talk) (CAV) Quasi-Optimal Partial Order Reduction (PDF, talk) (LICS) Polynomial Invariants for Affine Programs (PDF, talk)
Program Derivation	(REFINE) Programming Without Refinement (PDF, talk)
Program extraction	(LICS) A functional interpretation with state (PDF, talk)
Program invariant	(LICS) Polynomial Invariants for Affine Programs (PDF, talk)
Program Projection	(REFINE) Programming Without Refinement (PDF, talk)
program refinement	(LICS) ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency (PDF, talk)
program specialisation	(ICLP) An iterative approach to precondition inference using constrained Horn clauses (PDF, talk)
Program Synthesis	(IJCAR) Proof-Producing Synthesis of CakeML with I/O and Local State from Monadic HOL Functions (PDF, talk) (CAV) Syntax-Guided Termination Analysis (PDF, talk) (CAV) Counterexample Guided Inductive Synthesis Modulo Theories (PDF, talk) (CAV) Constraint-Based Synthesis of Coupling Proofs (PDF, talk) (CAV) Syntax Guided Synthesis with Quantitative Syntactic Objectives (PDF, talk) (CAV) Learning Abstractions for Program Synthesis (PDF, talk)
program transformation	(FSCD) Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (PDF, talk) (WPTE) On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems (PDF, talk) (WPTE) Automating the Diagram Method to Prove Correctness of Program Transformations (PDF, talk) (WPTE) Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics (PDF, talk)
program transformations	(FSCD) Nominal Unification with Atom and Context Variables (PDF, talk)
Program translation	(TERMGRAPH) Programming by Term Rewriting (PDF, talk)
Program Verification	(ITP) Software Verification with ITPs Should Use Binary Code Extraction to Reduce the TCB (short paper) (PDF, talk) (ITP) Program Verification in the Presence of Cached Address Translation (PDF, talk) (HCVS) Metaprogramming and symbolic execution for detecting runtime errors in Erlang programs (PDF, talk) (ICLP) Solving Horn Clauses on Inductive Data Types Without Induction (PDF, talk) (IJCAR) A FOOLish Encoding of the Next State Relations of Imperative Programs (PDF, talk) (IJCAR) Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle (PDF, talk) (WPTE) Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics (PDF, talk) (WPTE) Verification of Ada Programs with AdaHorn (PDF, talk) (CAV) Syntax-Guided Termination Analysis (PDF, talk) (CAV) Nagini: A Static Verifier for Python (PDF, talk) (CAV) Program Analysis is Harder than Verification: A Computability Perspective (PDF, talk) (CAV) Formally Verified Montgomery Multiplication (PDF, talk) (Isabelle) Using Isabelle/UTP for the Verification of Sorting Algorithms: A Case Study (PDF, talk) (DS-FM) Analysis and Verification of Message Passing based Parallel Programs (PDF, talk) (SMT) Discovering Universally Quantified Solutions for Constrained Horn Clauses (PDF, talk)
programming language semantics	(LICS) Work Analysis with Resource-Aware Session Types (PDF, talk) (LICS) Computable decision-making on the reals and other spaces via partiality and nondeterminism (PDF, talk)
programming languages	(LPOP) The RBAC challenge in LogiQL: Solutions and Limitations (PDF) (LICS) Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams (PDF, talk)
programming logic	(IJCAR) A Separation Logic with Data: Small Models and Automation (PDF, talk)
programming paradigm	(LPOP) A software system should be declarative except where it interacts with the real world (PDF, talk)
Programming-by-Example	(CAV) Learning Abstractions for Program Synthesis (PDF, talk)
progress measure	(LICS) A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games (PDF, talk)
Projected Model Counting	(SAT) Exploiting Treewidth for Projected Model Counting and its Limits (PDF, talk)
Projective plane	(WiL) On Expanding Standard Notions of Constructivity (PDF, talk)
Prolog	(ICLP) Top-down and Bottom-up Evaluation Reconciled (PDF, talk) (ICLP) Towards Static Performance Guarantees for Programs with Run-time Checks (PDF, talk)
Prompt LTL	(SR) Quantifying Bounds in Strategy Logic (PDF, talk)
Proof	(CAV) Continuous formal verification of Amazon s2n (PDF, talk)
proof assistant	(UITP) Implementing a Proof Assistant using Focusing and Logic Programming (PDF, talk) (ThEdu) Lucas Interpretation from Programmers’ Perspective (PDF, talk) (IJCAR) Formalizing Bachmair and Ganzinger's Ordered Resolution Prover (PDF, talk) (LFMTP) The RedPRL Proof Assistant (PDF) (ARQNL) A Simple Semi-automated Proof Assistant for First-order Modal Logics (PDF, talk)
proof assistants	(ITP) The Coinductive Formulation of Common Knowledge (PDF, talk) (ITP) HOL Light QE (PDF, talk) (ITP) Reification by Parametricity (PDF, talk) (FSCD) Cumulative Inductive Types in Coq (PDF, talk)
proof automation	(ITP) ProofWatch: Watchlist Guidance for Large Theories in E (PDF, talk)
proof by reflection	(ITP) Reification by Parametricity (PDF, talk)
proof checker	(WST) TTT2 with Termination Templates for Teaching (PDF, talk)
Proof checking	(UITP) Text-Orientated Formal Mathematics (PDF, talk) (POS) Two flavors of DRAT (PDF, talk)
proof complexity	(TYDI) Two Unifying Structural Principles (PDF, talk) (TYDI) Proof complexity of deep inference: a survey (PDF, talk) (SAT) Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers (PDF, talk) (SAT) In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving (PDF, talk) (LCC) Feasibly constructive proofs of succinct weak circuit lower bounds (PDF, talk) (IJCAR) Extended Resolution Simulates DRAT (PDF, talk) (CAV) The Proof Complexity of SMT Solvers (PDF, talk) (PARIS) On the logical complexity of cyclic arithmetic (PDF, talk) (PC) Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs (PDF) (PC) Proof systems for #SAT based on restricted circuits (PDF, talk) (PC) Short Proofs in QBF Expansion (PDF) (PC) Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk) (PC) Resolution and the binary encoding of combinatorial principles (PDF, talk) (PC) Resolution with Counting: Different Moduli and Tree-Like Lower Bounds (PDF, talk)
proof compression	(UITP) Partial Regularization of First-Order Resolution Proofs (PDF, talk) (IJCAR) A Tableaux Calculus for Reducing Proof Size (PDF, talk)
proof engineering	(ITP) Reification by Parametricity (PDF, talk) (Coq) Procrastination, A proof engineering technique (PDF, talk)
proof guidance	(ITP) ProofWatch: Watchlist Guidance for Large Theories in E (PDF, talk)
proof identity	(IJCAR) From Syntactic Proofs to Combinatorial Proofs (PDF, talk)
Proof Method Recommendation	(Isabelle) PaMpeR: A Proof Method Recommendation System for Isabelle/HOL (PDF, talk)
Proof Mining	(Isabelle) PaMpeR: A Proof Method Recommendation System for Isabelle/HOL (PDF, talk)
Proof nets	(FSCD) Proof nets for bi-intuitionistic linear logic (PDF, talk) (Linearity/TLLA) The structure of non decomposable connectives of linear logic (PDF, talk) (Linearity/TLLA) Proof nets, coends and the Yoneda isomorphism (PDF, talk) (LICS) Unification nets: canonical proof net quantifiers (PDF, talk)
proof of univalence	(HoTT/UF) Internalizing Presheaf Semantics: Charting the Design Space (PDF, talk)
proof schema	(PARIS) Towards the Automatic Construction of Schematic Proofs (PDF, talk)
proof search	(ADSL) Cyclic Theorem Prover for Separation Logic by Magic Wand (PDF, talk) (Coq) Proof Construction by Tactic Learning (PDF, talk) (IJCAR) Focussing, MALL and the polynomial hierarchy (PDF, talk)
proof semantics	(TYDI) Two Unifying Structural Principles (PDF, talk)
Proof System	(Isabelle) Substitutionless First-Order Logic: A Formal Soundness Proof (PDF, talk)
proof systems	(IJCAR) QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property (PDF, talk)
proof terms	(FSCD) ProTeM: A Proof Term Manipulator (PDF, talk) (CL&C) Fast cut-elimination using proof terms: an empirical study (PDF, talk)
Proof theory	(WiL) A semantical view of sequent based systems (PDF, talk) (WiL) Towards a Playground for Logicians (PDF, talk) (WiL) Non-well-founded proof system for Transitive Closure Logic (PDF, talk) (WiL) Decomposing labelled proof theory for intuitionistic modal logic (PDF, talk) (TYDI) An introduction to deep inference (PDF, talk) (TYDI) Two Unifying Structural Principles (PDF, talk) (TYDI) Sequentialising nested systems (PDF, talk) (TYDI) Nested sequents for modal logics and beyond (PDF, talk) (ICLP) First-order answer set programming as constructive proof search (PDF, talk) (CL&C) Admissible tools in the kitchen of intuitionistic logic (PDF, talk) (CL&C) Some ideas on cut-elimination for cyclic arithmetic proofs (PDF, talk) (IJCAR) A Tableaux Calculus for Reducing Proof Size (PDF, talk) (IJCAR) A Logical Framework with Commutative and Non-Commutative Subexponentials (PDF, talk) (IJCAR) Focussing, MALL and the polynomial hierarchy (PDF, talk) (PAAR) Efficient translation of sequent calculus proofs into natural deduction proofs (PDF, talk) (PARIS) On the logical complexity of cyclic arithmetic (PDF, talk)
proof theory of modal logic	(ITP) Software tool support for modular reasoning in modal logics of actions (PDF, talk)
proof-as-program	(LICS) Classical realizability as a classifier for nondeterminism (PDF, talk)
Proof-checker	(ITP) CalcCheck: A Proof Checker for Teaching the “Logical Approach to Discrete Math” (PDF, talk)
proof-relevant	(ICLP-DC) Proof-relevant resolution for elaboration of programming languages (PDF, talk)
Proof-relevant logic	(ICLP) Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis (PDF, talk)
proof-search	(PARIS) Local validity for circular proofs in linear logic with fixed points (PDF, talk)
proof-theoretic semantics	(NLCS) Paychecks, Presupposition, and Dependent Types (PDF, talk)
proof-theoretical linear semantics	(ICLP) A New Proof-theoretical Linear Semantics for CHR (PDF, talk)
proofs	(FM) Object-Oriented Security Proofs (PDF, talk)
Proofs by reflection	(IJCAR) A Why3 framework for reflection proofs and its application to GMP's algorithms (PDF, talk)
proofs-as-programs	(LICS) A sequent calculus with dependent types for classical arithmetic (PDF, talk)
property directed reachability	(SMT) Discovering Universally Quantified Solutions for Constrained Horn Clauses (PDF, talk)
property falsification	(CAV) Inner and Outer Approximating Flowpipes for Delay Differential Equations (PDF, talk)
Property Specification Patterns	(DS-FM) Consistency Checking of Functional Requirements (PDF, talk)
property-based testing	(LFMTP) Property-Based Testing of Abstract Machines: an Experience Report (PDF, talk)
Propositional Dynamic Logic	(CAV) Propositional Dynamic Logic for Higher-Order Functional Programs (PDF, talk) (LICS) Wreath Products of Distributive Forest Algebras (PDF, talk)
propositional implicational intuitionistic logic	(RCRA) Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic (PDF, talk)
propositional logic	(SAT) Exploiting Treewidth for Projected Model Counting and its Limits (PDF, talk) (PRUV) A new logic for jointly representing hard and soft constraints (PDF, talk) (CL&C) Admissible tools in the kitchen of intuitionistic logic (PDF, talk) (IJCAR) Extended Resolution Simulates DRAT (PDF, talk) (CSF) Guided design of attack trees: a system-based approach (PDF, talk) (ARQNL) Pseudo-Propositional Logic (PDF, talk)
propositional model counting	(PC) Proof systems for #SAT based on restricted circuits (PDF, talk)
Propositional Resizing	(HoTT/UF) Cubical Assemblies and the Independence of the Propositional Resizing Axiom (PDF, talk)
PROPs	(LICS) Rewriting with Frobenius (PDF, talk)
Protocol Verification	(CAV) Model checking indistinguishability of randomized security protocols (PDF, talk) (CSF) An extensive formal analysis of multi-factor authentication protocols (PDF, talk)
protokernel	(AVOCS) Proof-Oriented Design of a Separation Kernel with Minimal Trusted Computing Base (PDF, talk)
prototyping	(SAT) PySAT: A Python Toolkit for Prototyping with SAT Oracles (PDF, talk)
prover	(IJCAR) Formalizing Bachmair and Ganzinger's Ordered Resolution Prover (PDF, talk)
Prover IDE	(UITP) Isabelle/PIDE after 10 years of development (PDF, talk)
Prover Trident	(FM) Interlocking Design Automation using Prover Trident (PDF, talk)
proximity relation	(UNIF) Proximity-Based Generalization (PDF, talk)
Pseudo-Boolean	(POS) Competitive Sorter-based Encoding of PB-Constraints into SAT (PDF, talk)
Pseudo-Boolean Optimisation	(RCRA) Optimal Fault-Tolerant Placement of Relay Nodes in a Mission Critical Wireless Network (PDF, talk)
Pseudo-Boolean Solving	(SAT) Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers (PDF, talk) (SAT) In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving (PDF, talk)
PSPACE	(FSCD) A Unifying Framework for Type Inhabitation (PDF, talk)
Pushdown systems with transductions	(CAV) Android Stack Machine (PDF, talk)
PVS	(ITP) Formalizing Ring Theory in PVS (short paper) (PDF, talk) (ITP) Boosting the Reuse of Formal Specifications (PDF, talk) (FM) A Formally Verified Floating-Point Implementation of the Compact Position Reporting Algorithm (PDF, talk)
python	(SAT) PySAT: A Python Toolkit for Prototyping with SAT Oracles (PDF, talk) (LPOP) Logic-based Methods for Software Engineers and Business People (PDF, talk)
Q
Q-Resolution	(SAT) Polynomial-Time Validation of QCDCL Certificates (PDF, talk) (PC) Short Proofs in QBF Expansion (PDF) (PC) The Symmetry Rule for Quantified Boolean Formulas (PDF)
QBF	(SAT) QBF as an Alternative to Courcelle's Theorem (PDF, talk) (SAT) Polynomial-Time Validation of QCDCL Certificates (PDF, talk) (QBF) Portfolio-Based Algorithm Selection for Circuit QBFs (PDF, talk) (QBF) Towards the Semantics of QBF Clauses (PDF, talk) (QBF) A Grounder From Second-Order Logic To QBF (PDF, talk) (IJCAR) QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property (PDF, talk) (CAV) Synthesis Of Asynchronous Reactive Programs From Temporal Specifications (PDF, talk) (PC) Short Proofs in QBF Expansion (PDF)
QBF calculi	(SAT) Local Soundness for QBF Calculi (PDF, talk)
QDimacs	(QBF) A Grounder From Second-Order Logic To QBF (PDF, talk)
QRAT	(IJCAR) QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property (PDF, talk)
Qualitative Reasoning	(ICLP) A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming (PDF, talk)
qualitative spatial reasoning	(WiL) About the unification type of topological logics over Euclidean spaces (PDF, talk)
qualitattive spatial reasoning	(UNIF) About the Unification Type of Topological Logics over Euclidean Spaces (PDF, talk)
quantale relator	(LICS) Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances (PDF, talk)
quantification	(QBF) Tractability results for structured quantified CNF-formulas via knowledge compilation (PDF, talk)
Quantified Bit-Vectors	(CAV) Solving Quantified Bit-Vectors using Invertibility Conditions (PDF, talk)
quantified boolean formula	(SAT) Circuit-based Search Space Pruning in QBF (PDF, talk)
Quantified Boolean Formulas	(SAT) Symmetries for QBF (PDF, talk) (IJCAR) QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property (PDF, talk) (CAV) Understanding and Extending Incremental Determinization for 2QBF (PDF, talk) (PC) Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs (PDF) (PC) The Symmetry Rule for Quantified Boolean Formulas (PDF)
Quantified Circuit	(QBF) Portfolio-Based Algorithm Selection for Circuit QBFs (PDF, talk)
quantified modal logic	(ARQNL) A Simple Semi-automated Proof Assistant for First-order Modal Logics (PDF, talk)
quantified modal logics	(ARQNL) Labelled calculi for QMLs with non-rigid and non-denoting terms (PDF, talk)
quantified resolution asymmetric tautology	(IJCAR) QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property (PDF, talk)
Quantifier	(CAV) Delta-Decision Procedures for Exists-Forall Problems over the Reals (PDF, talk)
quantifier elimination	(SCSC) Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics (PDF, talk) (SCSC) Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT (PDF, talk) (FM) Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty (PDF, talk) (IJCAR) Deciding the First-Order Theory of an Algebra of Feature Trees with Updates (PDF, talk)
quantifier instantiation	(SMT) Discovering Universally Quantified Solutions for Constrained Horn Clauses (PDF, talk)
quantifier rank	(LICS) Tree depth, quantifier elimination, and quantifier rank (PDF, talk)
Quantifier-free Theory of Arrays	(IJCAR) Efficient Interpolation for the Theory of Arrays (PDF, talk)
quantifiers	(LICS) Unification nets: canonical proof net quantifiers (PDF, talk) (SMT) Discovering Universally Quantified Solutions for Constrained Horn Clauses (PDF, talk)
quantitative algebraic reasoning	(LICS) An algebraic theory of Markov processes (PDF, talk)
Quantitative Analysis	(FM) QFLan: A Tool for the Quantitative Analysis of Highly Reconfigurable Systems (PDF, talk) (CAV) Automata vs Linear-Programming Discounted-Sum Inclusion (PDF, talk)
quantitative information flow	(FM) An Algebraic Approach for Reasoning About Information Flow (PDF, talk) (CSF) Symbolic Side-Channel Analysis for Probabilistic Programs (PDF, talk)
Quantitative Model Checking	(MoRe) Logically-Constrained Reinforcement Learning (PDF, talk)
Quantitative Objective	(CAV) Syntax Guided Synthesis with Quantitative Syntactic Objectives (PDF, talk)
Quantitative Semantics for Temporal Logic	(CAV) A Counting Semantics for Monitoring LTL Specifications over Finite Traces (PDF, talk)
quantum computation	(LICS) Logical paradoxes in quantum computation (PDF, talk) (LICS) Two complete axiomatisations of pure-state qubit quantum computing (PDF, talk)
Quantum Computing	(FSCD) A diagrammatic axiomatisation of fermionic quantum circuits (PDF, talk) (TERMGRAPH) A Framework for Rewriting Families of String Diagrams (PDF, talk) (RCRA) Greedy Randomized Search for Scalable Compilation of Quantum Circuits (PDF, talk) (LICS) A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics (PDF, talk) (LICS) Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics (PDF, talk) (LICS) Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams (PDF, talk)
Quantum functional languages	(Linearity/TLLA) Quantum programming made easy (PDF, talk)
quantum program	(LICS) Species, Profunctors and Taylor Expansion Weighted by SMCC--A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs-- (PDF, talk)
Quantum Programming	(Linearity/TLLA) Quantum programming made easy (PDF, talk)
Quasi-inverse	(FCS) A Homotopical Approach to Cryptography (PDF, talk)
queries	(LPOP) Easier Rules and Constraints for Programming (PDF, talk)
query	(LICS) Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable. (PDF, talk)
Query Answering	(ICLP) Cautious Reasoning in ASP via Minimal models and Unsatisfiable Cores (PDF, talk)
Query Enumeration	(LICS) MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras (PDF, talk)
Query Optimization	(WST) Verification of Rewriting-based Query Optimizers (PDF, talk)
Question Answering	(ICLP) Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples (PDF, talk) (ICLP-DC) Knowledge Authoring and Question Answering via Controlled Natural Language (PDF, talk) (ICLP-DC) The Learning-Knowledge-Reasoning Paradigm For Natural Language Understanding and Question Answering (PDF, talk)
Quicksort	(ITP) Verified Analysis of Random Binary Tree Structures (PDF, talk)
Quotation and evaluation	(ITP) HOL Light QE (PDF, talk)
quotient inductive types	(FSCD) A Syntax for Higher Inductive-Inductive Types (PDF, talk)
quotients	(ITP) Relational parametricity and quotient preservation for modular (co)datatypes (PDF, talk) (ITP) Boosting the Reuse of Formal Specifications (PDF, talk)
R
Railway	(VaVAS) Towards validation and verification of an autonomous railway inspection and repair system (PDF, )
railway interlocking systems	(FM) Stepwise Development and Model Checking of a Distributed Interlocking System - using RAISE (PDF, talk)
RAISE	(FM) Stepwise Development and Model Checking of a Distributed Interlocking System - using RAISE (PDF, talk)
Ramsey theory	(LICS) A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP (PDF, talk)
Random Algorithms	(RCRA) Greedy Randomized Search for Scalable Compilation of Quantum Circuits (PDF, talk)
random generation	(HOR) Combinatorics of explicit substitutions (extended abstract) (PDF, talk)
random parity equations	(SAT) Fast and Flexible Probabilistic Model Counting (PDF, talk)
random sample voting	(CSF) Alethea: A Provably Secure Random Sample Voting Protocol (PDF, talk)
random SAT	(SAT) Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT (PDF, talk)
random variables	(LICS) Boolean-Valued Semantics for Stochastic Lambda-Calculus (PDF, talk)
randomised	(ITP) Verified Analysis of Random Binary Tree Structures (PDF, talk)
Randomization	(CAV) Model checking indistinguishability of randomized security protocols (PDF, talk)
randomized algorithm	(ITP) Verified Tail Bounds for Randomized Programs (PDF, talk)
Randomized algorithms	(SAT) Fast and Flexible Probabilistic Model Counting (PDF, talk) (CAV) Constraint-Based Synthesis of Coupling Proofs (PDF, talk)
RankFinder	(WST) Control-Flow Refinement via Partial Evaluation (PDF, talk)
ranking functions	(LICS) Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS (PDF, talk)
Rare Event Simulation	(FM) Statistical Model Checking of LLVM Code (PDF, talk)
Rating of Geometric Provers	(ThEdu) Rating of Geometric Automated Theorem Provers (PDF, talk)
Rational closure	(PRUV) Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure (PDF, talk)
Rational synthesis	(LICS) Rational Synthesis Under Imperfect Information (PDF, talk)
rationality	(SR) Beyond admissibility: Dominance between chains of strategies (PDF, talk)
RBAC	(LPOP) Easier Rules and Constraints for Programming (PDF, talk)
Re-composition	(ICLP) Phylotastic: An Experiment in Creating, Manipulating, and Evolving Phylogenetic Biology Workflows Using Logic Programming (PDF, talk)
reach-avoid specification	(CAV) Controller Synthesis Made Real: Reach-avoid Specifications and Linear Dynamics (PDF, talk)
reachability	(IJCAR) A Coinductive Approach to Proving Reachability in Logically Constrained Term Rewriting Systems (PDF, talk) (WPTE) On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions (PDF, talk) (CAV) Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm (PDF, talk)
reachability analysis	(FM) Approximate Partial Order Reduction (PDF, talk) (CAV) SimpleCAR: An Efficient Bug-Finding Tool Based On Approximate Reachability (PDF, talk) (CAV) Inner and Outer Approximating Flowpipes for Delay Differential Equations (PDF, talk) (AVOCS) Backward reachability analysis for timed automata with data variables (PDF, talk)
Reachability analysis of nonlinear systems	(CAV) Reachable Set Over-approximation for Nonlinear Systems Using Piecewise Barrier Tubes (PDF, talk)
reachability logic	(WPTE) Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics (PDF, talk)
Reachability problem	(CAV) Android Stack Machine (PDF, talk)
Reachable set over-approximation	(CAV) Reachable Set Over-approximation for Nonlinear Systems Using Piecewise Barrier Tubes (PDF, talk)
reactive programs	(CSF) Knowledge-based Security of Dynamic Secrets for Reactive Programs (PDF, talk)
reactive synthesis	(CAV) Reactive Control Improvisation (PDF, talk) (CAV) Strix: Explicit Reactive Synthesis Strikes Back! (PDF, talk)
read-once branching programs	(PC) Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk)
real algebraic geometry	(SCSC) Unknot Recognition Through Quantifier Elimination (PDF, talk)
Real Analysis	(Coq) Classical Analysis with Coq (PDF, talk)
Real Arithetmic	(SMT) The next 10^4 UppSAT Approximations (PDF, talk)
Real Cohesive Homotopy Type Theory	(HoTT/UF) Cohesive Covering Theory (PDF, talk)
Real Numbers	(ThEdu) Proving in the Isabelle Proof Assistant that the Set of Real Numbers is not Countable (PDF, talk)
real roots	(SCSC) New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square (PDF, talk)
real-time	(Overture) Overture FMU: Export VDM-RT Models as Tool-Wrapper FMUs (PDF, talk) (LICS) A Theory of Register Monitors (PDF, talk)
real-time logic TCTL	(FM) Timed Vacuity (PDF, talk)
Real-world applications	(LPOP) How to upgrade ASP for true dynamic modelling and solving? (PDF, talk)
realisability	(HOR) Refining Properties of Filter Models: Sensibility, Approximability and Reducibility (PDF, talk)
Realizability	(HoTT/UF) Cubical Assemblies and the Independence of the Propositional Resizing Axiom (PDF, talk) (CAV) Synthesizing Reactive Systems from Hyperproperties (PDF, talk) (LICS) Classical realizability as a classifier for nondeterminism (PDF, talk) (PARIS) LMSO: A Curry-Howard Approach to Church’s Synthesis via Linear Logic (PDF, talk)
Reasoning about Actions and Change	(ICLP-DC) Explaining Actual Causation via Reasoning about Actions and Change (PDF, talk)
Reasoning about syntax	(ITP) HOL Light QE (PDF, talk)
recognizability	(LICS) Definable decompositions for graphs of bounded linear cliquewidth (PDF, talk)
record types	(IJCAR) Theories as Types (PDF, talk)
Recursion	(Coq) Towards a formalization of the guard condition (PDF, talk)
recursion-free constrained Horn clause	(HCVS) Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions (PDF, talk)
Recursion-theoretic characterisations	(LCC) A recursion-theoretic characterisation of the positive polynomial-time functions (PDF, talk)
Recursive functions	(HCVS) A simple functional presentation and an inductive correctness proof of the Horn algorithm (PDF, talk)
Recursive types	(FSCD) Index-Stratified Types (PDF, talk)
recursively enumerable	(Isabelle) Hilbert Meets Isabelle: Formalisation of the DPRM Theorem in Isabelle (PDF, talk)
Reduction	(CAV) Reasoning About TSO Programs Using Reduction and Abstraction (PDF, talk)
Reduction orderings	(TERMGRAPH) On quasi ordinal diagram systems (PDF, talk)
Reduction semantics	(DCM) Pointing to Private Names (PDF, talk) (PARIS) What makes guarded types tick? (PDF, talk)
reduction to SAT	(VEMDP) Computing Properties of Stable Configurations of Thermodynamic Binding Networks (PDF, talk)
Reductive cut elimination	(CL&C) Herbrand's Theorem as Higher-Order Recursion (PDF, talk)
Redundancy-free Proof-Search	(IJCAR) Constructive Decision via Redundancy-free Proof-Search (PDF, talk)
refactoring	(F-IDE) AsmetaF: a flattener for the ASMETA framework (PDF, talk)
refinement	(ITP) Boosting the Reuse of Formal Specifications (PDF, talk) (FM) Compositional Reasoning for Shared-variable Concurrent Programs (PDF, talk) (Isabelle) A Verified SAT Solver with Watched Literals Using Imperative HOL (Extended Abstract) (PDF, talk) (REFINE) Correctness of Concurrent Objects under Weak Memory Models (PDF, talk) (REFINE) Refining Santa: An Excercise in Efficient Synchronization (PDF, talk)
refinement logic	(LFMTP) The RedPRL Proof Assistant (PDF)
Reflection	(ITP) HOL Light QE (PDF, talk)
Reformulation	(LaSh) Automated Constraint Modelling with Conjure (PDF, talk)
register machines	(LICS) A Theory of Register Monitors (PDF, talk)
Regression Tree	(Isabelle) PaMpeR: A Proof Method Recommendation System for Isabelle/HOL (PDF, talk)
Regular Datalog	(ICLP) Certified Graph View Maintenance with Regular Datalog (PDF, talk)
regular expressions	(LaSh) A Derivative-Based Decision Procedure for WS1S (PDF, talk) (FM) The Compound Interest in Relaxing Punctuality (PDF, talk) (LICS) Regular Transducer Expressions for Regular Transformations over infinite words (PDF, talk)
regular languages	(Linearity/TLLA) A semantic conjecture on second-order MLL and its complexity consequences (work in progress) (PDF, talk) (LICS) PTL-separability and closures for WQOs on words (PDF, talk)
regular tree grammar	(FSCD) Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (PDF, talk) (WPTE) On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions (PDF, talk)
regularity preservation	(FSCD) Completeness of Tree Automata Completion (PDF, talk)
reification	(ITP) Reification by Parametricity (PDF, talk)
Reinforcement Learning	(MoRe) Logically-Constrained Reinforcement Learning (PDF, talk) (FM) Falsification of Cyber-Physical Systems Using Deep Reinforcement Learning (PDF, talk) (CAV) Fast Numerical Program Analysis with Reinforcement Learning (PDF, talk) (CAV) Safety-Aware Apprenticeship Learning (PDF, talk)
relational databases	(TERMGRAPH) Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting (PDF, talk)
relational model	(LICS) Every λ-Term is Meaningful for the Infinitary Relational Model (PDF, talk)
relational reasoning	(LICS) ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency (PDF, talk)
relational semantics	(ITRS) Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (PDF, talk)
relational theory	(TERMGRAPH) Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting (PDF, talk)
Relational Verification	(CAV) Exploiting Synchrony and Symmetry in Relational Verification (PDF, talk)
Relative Correctness	(REFINE) Programming Without Refinement (PDF, talk)
relative entropy programming	(PC) Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
relative soundness results	(CSF) A Typing Result for Stateful Protocols (PDF, talk)
Relevance Logic	(IJCAR) Constructive Decision via Redundancy-free Proof-Search (PDF, talk)
Reliable	(FM) Resource-aware Design for Reliable Autonomous Applications with Multiple Periods (PDF, talk)
rely-guarantee	(FM) Compositional Reasoning for Shared-variable Concurrent Programs (PDF, talk)
rely/guarantee concurrency	(FM) Encoding fairness in a synchronous concurrent program algebra (PDF, talk) (REFINE) Challenges of specifying concurrent program components (PDF, talk)
remote build	(Isabelle) The remote_build Tool (PDF, talk)
replaceability	(RCRA) Replaceability for constraint satisfaction problems: Algorithms, Inferences, and Complexity Patterns (PDF, talk)
Requirement Analysis	(FM) From Formal Requirements to Highly Assured Software for Unmanned Aircraft Systems (PDF, talk)
requirements analysis	(F-IDE) The CLEAR Way To Transparent Formal Methods (PDF, talk)
requirements based testing	(F-IDE) The CLEAR Way To Transparent Formal Methods (PDF, talk)
Requirements Engineering	(AVOCS) Analyzing Consistency of Formal Requirements (PDF, talk) (DS-FM) Consistency Checking of Functional Requirements (PDF, talk)
Requirements specification	(FM) Formal Verification of Automotive Simulink Controller Models: Empirical Technical Challenges, Evaluation and Recommendations (PDF, talk)
Resolution	(WiL) On the Combination of Resolution and SAT Procedures for Modal Theorem-Proving (PDF, talk) (SAT) Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers (PDF, talk) (SAT) In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving (PDF, talk) (SAT) Cops-Robber games and the resolution of Tseitin formulas (PDF, talk) (ICLP-DC) Proof-relevant resolution for elaboration of programming languages (PDF, talk) (UITP) Partial Regularization of First-Order Resolution Proofs (PDF, talk) (IJCAR) Formalizing Bachmair and Ganzinger's Ordered Resolution Prover (PDF, talk) (IJCAR) A Resolution-Based Calculus for Preferential Logics (PDF, talk) (IJCAR) Enumerating Justifications using Resolution (PDF, talk) (CAV) The Proof Complexity of SMT Solvers (PDF, talk) (PC) Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk) (PC) Resolution with Counting: Different Moduli and Tree-Like Lower Bounds (PDF, talk)
Resolution Calculi	(QBF) Towards the Semantics of QBF Clauses (PDF, talk) (PAAR) Evaluating Pre-Processing Techniques for the Separated Normal Form for Temporal Logics (PDF, talk)
resource calculus	(LICS) Species, Profunctors and Taylor Expansion Weighted by SMCC--A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs-- (PDF, talk)
Resource Usage Analysis	(ICLP) Towards Static Performance Guarantees for Programs with Run-time Checks (PDF, talk) (LCC) A General Equational Framework for Static Profiling of Parametric Resource Usage (PDF, talk)
Resource-aware	(FM) Resource-aware Design for Reliable Autonomous Applications with Multiple Periods (PDF, talk)
Restart	(SAT) Machine Learning-based Restart Policy for CDCL SAT Solvers (PDF, talk)
restricted chase	(IJCAR) Efficient Model Construction for Horn Logic with VLog: System Description (PDF, talk)
Reverse mathematics	(PARIS) On the logical complexity of cyclic arithmetic (PDF, talk)
Reversibility	(DCM) Models of Computation that Conserve Data (PDF, talk)
Rewrite Rules	(SMT) Rewrites for SMT Solvers using Syntax-Guided Enumeration (PDF, talk)
Rewrite system	(HDRA) Generalizations of the associative operad and convergent rewrite systems (PDF, talk)
Rewrite Systems	(LaSh) Declarative Dynamic Programming with Inverse Coupled Rewrite Systems (PDF, talk)
rewriting	(ITP) Tactics and certificates in Meta Dedukti (PDF, talk) (FSCD) A Unifying Framework for Type Inhabitation (PDF, talk) (FSCD) Coherence of Gray categories via rewriting (PDF, talk) (IJCAR) Cops and CoCoWeb: Infrastructure for Confluence Tools (PDF, talk) (WST) Verification of Rewriting-based Query Optimizers (PDF, talk) (IWC) Critical pairs for Gray categories (PDF, talk) (SMT) SMT Solving Modulo Tableau and Rewriting Theories (PDF, talk) (HDRA) Normal forms for planar connected string diagrams (PDF, talk)
ribbon categories	(LICS) Ribbon tensorial logic (PDF, talk)
Rice's theorem	(CAV) Program Analysis is Harder than Verification: A Computability Perspective (PDF, talk)
rich logic	(FM) Producing Explanations for Rich Logics (PDF, talk)
Richard Montague	(NLCS) Propositional Attitude Operators in Homotopy Type Theory (PDF, talk)
Richman games	(SR) Infinite-Duration Richman Bidding Games (PDF, talk)
Riesz modal logic	(LICS) Riesz Modal Logic with Threshold Operators (PDF, talk)
right lifting property	(HoTT/UF) Robust Notions of Contextual Fibrancy (PDF, talk)
Ring Theory	(ITP) Formalizing Ring Theory in PVS (short paper) (PDF, talk)
Robotic	(VaVAS) Towards validation and verification of an autonomous railway inspection and repair system (PDF, )
robotic planning	(CAV) Reactive Control Improvisation (PDF, talk)
robust declassification	(CSF) Knowledge-based Security of Dynamic Secrets for Reactive Programs (PDF, talk)
robustness	(CAV) Reasoning About TSO Programs Using Reduction and Abstraction (PDF, talk) (CAV) Inner and Outer Approximating Flowpipes for Delay Differential Equations (PDF, talk)
Robustness guided falsification	(FM) Falsification of Cyber-Physical Systems Using Deep Reinforcement Learning (PDF, talk)
Role-Based Access Control	(LPOP) Role-Based Access Control via JASP (PDF, talk)
Role-Based Access Control (RBAC)	(LPOP) Security Policies in Constraint Handling Rules (PDF, talk)
roundoff error	(FM) Combining Tools for Optimization and Analysis of Floating-Point Computations (PDF, talk)
Rule-base modeling	(VEMDP) Computational Approaches for the Programmed Assembly of Nanocellulose Meshes (PDF, talk)
rule-based language	(VEMDP) Executable Biochemical Space for Specification and Analysis of Biochemical Systems (PDF, talk)
Rule-based modelling	(VEMDP) Conservative Approximations of Polymers (PDF, talk) (VEMDP) Rule-Based Gillespie Simulation of Chemical Systems (PDF, talk)
Rule-Based Programming	(AVOCS) Rule-Based Synthesis of Chains of Security Functions for Software-Defined Networks (PDF, talk)
Rule-Based Systems	(ICLP) Application of Logic-Based Methods to Machine Component Design (PDF, talk)
rules	(LPOP) Easier Rules and Constraints for Programming (PDF, talk)
rules of the road	(VaVAS) Formalisation of the Rules of the Road for embedding into an Autonomous Vehicle Agent (PDF, talk)
Run-time Checks	(ICLP) Towards Static Performance Guarantees for Programs with Run-time Checks (PDF, talk)
Runtime complexity	(CAV) Automata vs Linear-Programming Discounted-Sum Inclusion (PDF, talk)
runtime verification	(CAV) Monitoring Weak Consistency (PDF, talk) (CAV) A Counting Semantics for Monitoring LTL Specifications over Finite Traces (PDF, talk) (CSF) The Complexity of Monitoring Hyperproperties (PDF, talk)
S
S5	(IJCAR) An Assumption-Based Approach for Solving The Minimal S5-Satisfiability Problem (PDF, talk)
safe schemes	(FSCD) Homogeneity without Loss of Generality (PDF, talk)
safety	(FM) On Software Safety, Security, and Abstract Interpretation (PDF, talk)
safety critical	(FM) Disruptive Innovations for the Development and the Deployment of Fault-Free Software (PDF, talk)
Safety properties	(FM) Compositional Reasoning for Shared-variable Concurrent Programs (PDF, talk) (SMT) SMT-based Compile-time Verification of Safety Properties for Smart Contracts (PDF, talk)
safety verification	(FM) Vector Barrier Certificates and Comparison Systems (PDF, talk) (FM) Approximate Partial Order Reduction (PDF, talk)
SAT	(WiL) On the Combination of Resolution and SAT Procedures for Modal Theorem-Proving (PDF, talk) (SAT) Machine Learning-based Restart Policy for CDCL SAT Solvers (PDF, talk) (SAT) Chronological Backtracking (PDF, talk) (SAT) ALIAS: A Modular Tool for Finding Backdoors for SAT (PDF, talk) (LPOP) A Picat-based XCSP Solver - from Parsing, Modeling, to SAT Encoding (PDF, talk) (IJCAR) Exploring Approximations for Floating-Point Arithmetic using UppSAT (PDF, talk) (IJCAR) Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing (PDF, talk) (IJCAR) Extended Resolution Simulates DRAT (PDF, talk) (CAV) Understanding and Extending Incremental Determinization for 2QBF (PDF, talk) (POS) Tuning Parallel SAT Solvers (PDF, talk) (POS) Competitive Sorter-based Encoding of PB-Constraints into SAT (PDF, talk) (POS) The Effect of Scrambling CNFs (PDF, talk) (SMT) SMT Solving Modulo Tableau and Rewriting Theories (PDF, talk)
SAT and BDD-based decision procedures	(CAV) ADAC: Automated Design of Approximate Circuits (PDF, talk)
SAT encoding	(SAT) Approximately Propagation Complete and Conflict Propagating Constraint Encodings (PDF, talk) (RCRA) Encoding PB Constraints into SAT via Binary Adders and BDDs -- Revisited (PDF, talk)
SAT modulo theories	(CAV) Eager Abstraction for Symbolic Model Checking (PDF, talk)
SAT problem	(ARQNL) Pseudo-Propositional Logic (PDF, talk)
SAT Solver	(SAT) Centrality-Based Improvements to CDCL Heuristics (PDF, talk) (FM) FSM Inference from Long Traces (PDF, talk) (POS) CryptoMiniSat Parameter-Optimization for Solving Cryptographic Instances (PDF, talk) (Isabelle) A Verified SAT Solver with Watched Literals Using Imperative HOL (Extended Abstract) (PDF, talk)
SAT solvers	(SAT) PySAT: A Python Toolkit for Prototyping with SAT Oracles (PDF, talk)
SAT solving	(SCSC) Refutation of Products of Linear Polynomials (PDF, talk) (SAT) Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers (PDF, talk) (SAT) In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving (PDF, talk)
SAT-based Optimization	(SAT) Solving MaxSAT with Bit-Vector Optimization (PDF, talk)
Sat4j	(SAT) Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers (PDF, talk)
Satisfiability	(IJCAR) Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories (PDF, talk) (RCRA) On the Configuration of SAT Formulae (PDF, talk) (LICS) Unary negation fragment with equivalence relations has the finite model property (PDF, talk)
Satisfiability Checking	(SCSC) Techniques for Natural-style Proofs in Elementary Analysis (PDF, talk)
Satisfiability Modulo Constraint Handling Rules	(ICLP) Shape Neutral Analysis of Graph-based Data-structures (PDF, talk)
Satisfiability Modulo Theories	(SCSC) Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics (PDF, talk) (ICLP) Shape Neutral Analysis of Graph-based Data-structures (PDF, talk) (ICLP) SMT-based Answer Set Solver CMODELS(DIFF) (System Description) (PDF, talk) (IJCAR) Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories (PDF, talk) (IJCAR) A Coinductive Approach to Proving Reachability in Logically Constrained Term Rewriting Systems (PDF, talk) (CAV) Solving Quantified Bit-Vectors using Invertibility Conditions (PDF, talk) (CAV) The Proof Complexity of SMT Solvers (PDF, talk) (FCS) Homomorphisms and Minimality for Enrich-by-Need Security Analysis (PDF, talk)
Satisfiability Modulo Theory	(IJCAR) Efficient Interpolation for the Theory of Arrays (PDF, talk)
satisfiability threshold	(SAT) Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT (PDF, talk)
Satisfiablity Modulo Theories	(SMT) Alt-Ergo 2.2 (PDF, talk)
SATsolvers	(SCSC) Hard Combinatorial Problems: A Challenge for Satisfiability (PDF, talk)
Scaling	(Isabelle) Further Scaling of Isabelle Technology (PDF, talk)
Scheduling	(MoRe) Safe and Optimal Scheduling of Hard and Soft Tasks (PDF, talk) (RCRA) Greedy Randomized Search for Scalable Compilation of Quantum Circuits (PDF, talk)
Scoped channels	(DCM) Pointing to Private Names (PDF, talk)
Scrambling	(POS) The Effect of Scrambling CNFs (PDF, talk)
search	(RCRA) Computing Personalised Treatments through In Silico Clinical Trials. A Case Study on Downregulation in Assisted Reproduction. (PDF, talk)
Search space pruning	(ICLP) Improving Candidate Quality of Probabilistic Logic Models (PDF, talk)
Second Order Logic	(QBF) A Grounder From Second-Order Logic To QBF (PDF, talk)
second order quantifiers	(Linearity/TLLA) Proof nets, coends and the Yoneda isomorphism (PDF, talk)
second-order quantification	(Linearity/TLLA) A semantic conjecture on second-order MLL and its complexity consequences (work in progress) (PDF, talk)
secure channels	(CSF) A Cryptographic Look at Multi-Party Channels (PDF, talk)
Secure compilation	(CSF) Enforcing ideal-world leakage bounds in real-world secret sharing MPC frameworks (PDF, talk) (CSF) Secure compilation of side-channel countermeasures: the case of cryptographic “constant-time” (PDF, talk)
Secure multiparty computation	(CSF) Computer-aided proofs for multiparty computation with active security (PDF, talk)
securitisation	(TERMGRAPH) A Port-graph Model for Finance (PDF, talk)
Security	(ITP) Program Verification in the Presence of Cached Address Translation (PDF, talk) (Overture) VDM at large: analysing the EMV Next Generation Kernel (PDF, talk) (Overture) Design Space Exploration for Secure Building Control (PDF, talk) (FM) Modular Verification of Programs with Effects and Effect Handlers in Coq (PDF, talk) (FM) On Software Safety, Security, and Abstract Interpretation (PDF, talk) (FM) Variant analysis with QL (PDF, talk) (FM) Object-Oriented Security Proofs (PDF, talk) (CAV) The DEEPSEC prover (PDF, talk) (CAV) Formal Verification of a Vehicle-to-Vehicle (V2V) Messaging System (PDF, talk) (CSF) Formal Security Proof of CMAC and its Variants (PDF, talk) (CSF) Enforcing ideal-world leakage bounds in real-world secret sharing MPC frameworks (PDF, talk)
security definitions	(CSF) Computer-aided proofs for multiparty computation with active security (PDF, talk)
Security Management	(AVOCS) Rule-Based Synthesis of Chains of Security Functions for Software-Defined Networks (PDF, talk)
Security Policy	(LPOP) Security Policies in Constraint Handling Rules (PDF, talk)
security protocols	(FCS) Proving physical proximity using symbolic models (PDF, talk) (CSF) Composition Theorems for CryptoVerif and Application to TLS 1.3 (PDF, talk) (CSF) A little more conversation, a little less action, a lot more satisfaction: Global states in ProVerif. (PDF, talk) (CSF) Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR (PDF, talk)
security verification	(CAV) Lazy Self-Composition for Security Verification (PDF, talk)
selection network	(POS) Competitive Sorter-based Encoding of PB-Constraints into SAT (PDF, talk)
self-composition	(CAV) Lazy Self-Composition for Security Verification (PDF, talk)
Self-Driving vehicle	(VaVAS) Towards a verifiable decision making framework for self-driving vehicles (PDF, talk)
semantic forgetting	(IJCAR) FAME: An Automated Tool for Semantic Forgetting in Expressive Description Logics (PDF, talk)
Semantic model	(CSF) Types for Information Flow Control: Labeling Granularity and Semantic Models (PDF, talk)
semantic parsing	(NLCS) Graph Knowledge Representations for SICK (PDF, talk) (ICLP) Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples (PDF, talk)
semantics	(SAT) Local Soundness for QBF Calculi (PDF, talk) (QBF) Towards the Semantics of QBF Clauses (PDF, talk) (DCM) Generic Graph Semantics (PDF, talk) (WPTE) Automating the Diagram Method to Prove Correctness of Program Transformations (PDF, talk) (CSF) Enforcing ideal-world leakage bounds in real-world secret sharing MPC frameworks (PDF, talk) (Linearity/TLLA) From Linear Logic to Cyclic Sharing (PDF, talk) (Linearity/TLLA) Entropy and Complexity Lower Bounds (PDF, talk) (LICS) Every λ-Term is Meaningful for the Infinitary Relational Model (PDF, talk)
semantics of programming languages	(LICS) The Geometry of Computation-Graph Abstraction (PDF, talk)
Semantics preservation	(TERMGRAPH) Semantics-Preserving DPO-Based Term Graph Rewriting (PDF, talk)
semidefinite programming	(LICS) Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem (PDF, talk)
semisimplicial type	(HoTT/UF) Geometric realization of truncated semi-simplicial sets meta-constructed within HoTT (PDF, talk)
sensibility	(HOR) Refining Properties of Filter Models: Sensibility, Approximability and Reducibility (PDF, talk)
sensitivity analysis	(FM) Approximate Partial Order Reduction (PDF, talk)
Sentence Planning	(ICLP) Specifying and Verbalising Answer Set Programs in Controlled Natural Language (PDF, talk)
separability	(LICS) PTL-separability and closures for WQOs on words (PDF, talk)
separation	(LICS) Probabilistic Böhm Trees and Probabilistic Separation (PDF, talk)
separation logic	(ITP) Backwards and Forwards with Separation Logic (PDF, talk) (ADSL) A Complete Proof System for Basic Symbolic Heaps with Permissions (PDF, talk) (ADSL) Sloth: Separation Logic and Theories via Small Models (PDF, talk) (ADSL) The Complexity of Prenex Separation Logic with One Selector (PDF, talk) (ADSL) Labelled Cyclic Proofs for Separation Logic (PDF, talk) (ADSL) Cyclic Theorem Prover for Separation Logic by Magic Wand (PDF, talk) (ADSL) On the Complexity of Pointer Arithmetic in Separation Logic (PDF, talk) (IJCAR) A Separation Logic with Data: Small Models and Automation (PDF, talk) (IJCAR) Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle (PDF, talk) (CAV) Nagini: A Static Verifier for Python (PDF, talk) (CAV) Permission Inference for Array Programs (PDF, talk) (AVOCS) An Entailment Checker for Separation Logic with Inductive Definitions (PDF, talk) (LICS) ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency (PDF, talk)
Separations	(SAT) In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving (PDF, talk)
sequent calculus	(WiL) A semantical view of sequent based systems (PDF, talk) (TYDI) Sequentialising nested systems (PDF, talk) (CL&C) (Short Paper) Towards a Dualized Sequent Calculus with Canonicity (PDF, talk) (IJCAR) From Syntactic Proofs to Combinatorial Proofs (PDF, talk) (Linearity/TLLA) The structure of non decomposable connectives of linear logic (PDF, talk) (PAAR) Efficient translation of sequent calculus proofs into natural deduction proofs (PDF, talk) (LICS) A sequent calculus with dependent types for classical arithmetic (PDF, talk) (PARIS) Local validity for circular proofs in linear logic with fixed points (PDF, talk)
Sequential algorithms	(LICS) Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types (PDF, talk)
sequential types	(LICS) Every λ-Term is Meaningful for the Infinitary Relational Model (PDF, talk)
session types	(WiL) A New Linear Logic for Deadlock-Free Session-Typed Processes (Talk Abstract) (PDF, talk)
Set Membership	(SAT) XORSAT Set Membership Filters (PDF, talk)
Set Theory	(LFMTP) What Does This Notation Mean Anyway? BNF-Style Notation as it is actually used (PDF, talk)
sets with atoms	(LICS) On computability and tractability for infinite sets (PDF, talk)
shapes for higher-dimensional structure	(HoTT/UF) Ordered Cubes (PDF, talk)
shared-variable concurrent programs	(FM) Compositional Reasoning for Shared-variable Concurrent Programs (PDF, talk)
sharing	(DCM) A syntactic model of mutation and aliasing (PDF, talk)
sharpness	(SAT) Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT (PDF, talk)
shuffling calculus	(ITRS) Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (PDF, talk)
side conditions	(Coq) Procrastination, A proof engineering technique (PDF, talk)
Side-channel attack	(CAV) SCInfer: Refinement-based Verification of Software Countermeasures against Side-Channel Attacks (PDF, talk)
side-channels	(CSF) Symbolic Side-Channel Analysis for Probabilistic Programs (PDF, talk)
Sign-off	(FM) Interlocking Design Automation using Prover Trident (PDF, talk)
simple proof assistant	(UITP) Implementing a Proof Assistant using Focusing and Logic Programming (PDF, talk)
simple types	(FSCD) A Unifying Framework for Type Inhabitation (PDF, talk) (ITRS) Strong normalization of simple types through uniform intersection types. (PDF, talk)
Simplicial sets	(HoTT/UF) Towards a geometric model theory of type theory (PDF) (HoTT/UF) First-order homotopical logic and Grothendieck fibrations (PDF, talk)
Simplicial Type Theory	(HoTT/UF) (Truncated) Simplicial Models of Type Theory (PDF, talk)
Simply typed lambda calculus	(FSCD) Higher-Order Equational Pattern Anti-Unification (PDF, talk)
simply typed lambda terms	(RCRA) Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic (PDF, talk)
simulation	(TERMGRAPH) A Port-graph Model for Finance (PDF, talk) (CAV) Peregrine: A Tool for the Analysis of Population Protocols (PDF, talk) (VaVAS) RoboTool: Modelling and Verification with RoboChart (PDF, talk)
Simulation of Turing Machines	(HDRA) Minimal Bacus FP is Turing Complete (PDF, talk)
Simulink	(FM) Verifying Auto-Generated C Code from Simulink (PDF, talk)
Simulink-based development	(FM) Formal Verification of Automotive Simulink Controller Models: Empirical Technical Challenges, Evaluation and Recommendations (PDF, talk)
singleton arc consistency	(RCRA) Partial (Neighbourhood) Singleton Arc Consistency for Constraint Satisfaction Problems (PDF, talk)
Singular DP-reduction	(SAT) Minimal unsatisfiability and minimal strongly connected digraphs (PDF, talk)
Size	(SAT) In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving (PDF, talk)
Skeptical Approach	(ITP) A Coq Tactic for Equality Learning in Linear Arithmetic (PDF, talk)
Skolem functions	(CAV) What’s hard about Boolean Functional Synthesis? (PDF, talk)
skolemization	(SR) Dependences in Strategy Logic (PDF, talk)
SLD-resolution	(TERMGRAPH) SLD-Resolution Reduction of Second-Order Horn Fragments - Extended Abstract (PDF, talk)
Smart Buildings	(Overture) Design Space Exploration for Secure Building Control (PDF, talk)
Smart Contract Verification	(CSF) KEVM: A Complete Formal Semantics of the Ethereum Virtual Machine (PDF, talk)
Smart contracts	(SMT) SMT-based Compile-time Verification of Safety Properties for Smart Contracts (PDF, talk)
smart grid	(LICS) A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow (PDF, talk)
SMT	(SCSC) Towards Incremental Cylindrical Algebraic Decomposition in Maple (PDF, talk) (SCSC) Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT (PDF, talk) (SCSC) SMT-like Queries in Maple (PDF, talk) (SAT) Effective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition (PDF, talk) (SAT) Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization (PDF, talk) (FM) Z3 and SMT in Industrial R&D (PDF, talk) (ADSL) Sloth: Separation Logic and Theories via Small Models (PDF, talk) (IJCAR) Cubicle-W: Parameterized Model Checking on Weak Memory (PDF, talk) (IJCAR) Exploring Approximations for Floating-Point Arithmetic using UppSAT (PDF, talk) (IJCAR) A Generic Framework for Implicate Generation Modulo Theories (PDF, talk) (IJCAR) A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems (PDF, talk) (IJCAR) A Separation Logic with Data: Small Models and Automation (PDF, talk) (IJCAR) Datatypes with Shared Selectors (PDF, talk) (CAV) Constraint-Based Synthesis of Coupling Proofs (PDF, talk) (CAV) StringFuzz: A Fuzzer for String Solvers (PDF, talk) (CAV) Delta-Decision Procedures for Exists-Forall Problems over the Reals (PDF, talk) (CAV) Constrained Dynamic Partial Order Reduction (PDF, talk) (SMT) The next 10^4 UppSAT Approximations (PDF, talk) (SMT) Puli - A Problem-Specific OMT Solver (PDF, talk) (SMT) SMT-based Compile-time Verification of Safety Properties for Smart Contracts (PDF, talk) (SMT) Rewrites for SMT Solvers using Syntax-Guided Enumeration (PDF, talk) (SMT) Higher-Order SMT Solving (PDF, talk) (SMT) SMT Solving Modulo Tableau and Rewriting Theories (PDF, talk) (SMT) What is the Point of an SMT-LIB Problem? (PDF, talk)
SMT Solver	(CAV) Formal Verification of a Vehicle-to-Vehicle (V2V) Messaging System (PDF, talk) (AVOCS) Writing a Model Checker in 80 Days: Reusable Libraries and Custom Implementation (PDF, talk)
SMT solvers	(HCVS) Declarative Parameterized Verification of Topology-sensitive Distributed Protocols (PDF, talk) (ICLP) Solving Horn Clauses on Inductive Data Types Without Induction (PDF, talk) (CAV) Controller Synthesis Made Real: Reach-avoid Specifications and Linear Dynamics (PDF, talk) (CAV) The Proof Complexity of SMT Solvers (PDF, talk) (VSTTE) Lattice-Based Refinement in Bounded Model Checking (PDF, talk)
SMT Solving	(SCSC) Evaluation of Equational Constraints for CAD in SMT Solving (PDF, talk) (SCSC) Unknot Recognition Through Quantifier Elimination (PDF, talk) (CAV) BTOR2, BtorMC and Boolector 3.0 (PDF, talk) (CAV) MaxSMT-Based Type Inference for Python 3 (PDF, talk) (CAV) Solving Quantified Bit-Vectors using Invertibility Conditions (PDF, talk)
SMT-based model checking	(FM) Formal Specification and Verification of Dynamic Parametrized Architectures (PDF, talk)
SMT-solving	(SMT) Centralizing Equality Reasoning in MCSAT (PDF, talk)
SMTLIB	(SCSC) SMT-like Queries in Maple (PDF, talk)
Soft constraints	(PRUV) Evidential Group Decision Making Model with Belief-Based Preferences (PDF, talk)
Software as a Service	(Overture) Integrating VDM-SL into the continuous delivery pipelines of cloud-based software (PDF, talk)
software design	(LPOP) A software system should be declarative except where it interacts with the real world (PDF, talk)
software development	(FM) Disruptive Innovations for the Development and the Deployment of Fault-Free Software (PDF, talk)
Software Engineering	(FM) Z3 and SMT in Industrial R&D (PDF, talk)
software formal verification	(AVOCS) Climbing the Software Assurance Ladder - Practical Formal Verification for Reliable Software (PDF, talk)
Software model checking	(CAV) Let this Graph be your Witness! An Attestor for Verifying Java Pointer Programs (PDF, talk)
software model-checking	(VSTTE) Lattice-Based Refinement in Bounded Model Checking (PDF, talk)
Software Product Lines	(FM) QFLan: A Tool for the Quantitative Analysis of Highly Reconfigurable Systems (PDF, talk)
Software Testing	(CAV) Symbolic Liveness Analysis of Real-World Software (PDF, talk)
Software Tools	(LPOP) A Rule-Based Tool for Analysis and Generation of Graphs Applied to Mason's Marks (PDF, talk)
software verification	(ITP) Software Verification with ITPs Should Use Binary Code Extraction to Reduce the TCB (short paper) (PDF, talk) (FM) Modular Verification of Programs with Effects and Effect Handlers in Coq (PDF, talk) (FM) A Formally Verified Floating-Point Implementation of the Compact Position Reporting Algorithm (PDF, talk) (IJCAR) Checking Array Bounds by Abstract Interpretation and Symbolic Expressions (PDF, talk) (CAV) JBMC: A Bounded Model Checking Tool for Verifying Java Bytecode (PDF, talk) (CAV) On the Completeness of Verifying Message Passing Programs under Bounded Asynchrony (PDF, talk)
Software-Defined Networking	(AVOCS) Rule-Based Synthesis of Chains of Security Functions for Software-Defined Networks (PDF, talk)
software-defined networks	(FM) SDN-Actors: Modeling and Verification of SDN Programs (PDF, talk)
solving equations	(LICS) Satisfiability in multi-valued circuits (PDF, talk)
sound up-to techniques	(LICS) Sound up-to techniques and Complete abstract domains (PDF, talk)
Soundness	(Isabelle) Substitutionless First-Order Logic: A Formal Soundness Proof (PDF, talk)
Space	(SAT) In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving (PDF, talk)
SPARK2014 and Critical Ada Software	(F-IDE) Lightweight Interactive Proving inside an Automatic Program Verifier (PDF, talk)
Spatial Reasoning	(ICLP) A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming (PDF, talk)
Species of Structures	(Linearity/TLLA) Generalized generalized species of structure and resource modalities (PDF, talk)
specification	(FM) IPL: An Integration Property Language for Multi-Model Cyber-Physical Systems (PDF, talk) (WST) Objective and Subjective Specifications (PDF, talk)
Specification Language	(LaSh) ESSENCE, A Language for Specifying Combinatorial Problems: What, Why and So What? (PDF, talk)
Specification-based monitoring	(CAV) A Counting Semantics for Monitoring LTL Specifications over Finite Traces (PDF, talk)
Splitting	(UNIF) Bounded ACh Unification (PDF, talk)
SQL	(ITP) A Coq formalisation of SQL’s execution engines (PDF, talk)
Ssreflect	(ITP) A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs (PDF, talk)
Stability	(LICS) On the number of types in sparse graphs (PDF, talk)
stable model	(ICLP) Constraint Answer Set Programming without Grounding (PDF, talk)
stable model semantics	(ICLP) First-order answer set programming as constructive proof search (PDF, talk)
Stack-Based Access Control	(CAV) Propositional Dynamic Logic for Higher-Order Functional Programs (PDF, talk)
star-autonomous categories	(Linearity/TLLA) Models of Linear Logic based on the Schwartz epsilon product (PDF, talk)
State Complexity	(LICS) The State Complexity of Alternating Automata (PDF, talk)
state injection	(LICS) Logical paradoxes in quantum computation (PDF, talk)
State machine	(VaVAS) RoboTool: Modelling and Verification with RoboChart (PDF, talk)
State monad	(LICS) A functional interpretation with state (PDF, talk)
state space minimisation	(FM) To Compose, Or Not to Compose, That is the Question: An Analysis of Compositional State Space Generation (PDF, talk)
State-space abstraction	(CAV) Let this Graph be your Witness! An Attestor for Verifying Java Pointer Programs (PDF, talk)
stateful protocols	(CSF) A Typing Result for Stateful Protocols (PDF, talk)
Static Analysis	(LCC) A General Equational Framework for Static Profiling of Parametric Resource Usage (PDF, talk) (IJCAR) A FOOLish Encoding of the Next State Relations of Imperative Programs (PDF, talk) (IJCAR) Checking Array Bounds by Abstract Interpretation and Symbolic Expressions (PDF, talk) (CAV) Fast Numerical Program Analysis with Reinforcement Learning (PDF, talk) (CAV) Permission Inference for Array Programs (PDF, talk) (CAV) Constrained Dynamic Partial Order Reduction (PDF, talk)
static analyzers	(WPTE) Verification of Ada Programs with AdaHorn (PDF, talk)
static dependency pairs	(WST) Improving Static Dependency Pairs for Higher-Order Rewriting (PDF, talk)
static equivalence problem	(UNIF) Knowledge Problems in Equational Extensions of Subterm Convergent Theories (PDF, talk)
Static Profiling	(LCC) A General Equational Framework for Static Profiling of Parametric Resource Usage (PDF, talk)
Static program analysis	(FM) On Software Safety, Security, and Abstract Interpretation (PDF, talk) (CAV) Program Analysis is Harder than Verification: A Computability Perspective (PDF, talk)
static semantics	(IJCAR) Uniform Substitution for Differential Game Logic (PDF, talk)
Statistical Model Checking	(FM) QFLan: A Tool for the Quantitative Analysis of Highly Reconfigurable Systems (PDF, talk) (FM) Statistical Model Checking of LLVM Code (PDF, talk) (FCS) Statistical Model Checking of Guessing and Timing Attacks on Distance-bounding Protocols (PDF, talk)
Statistical relational learning	(ICLP) Constraint-Based Inference in Probabilistic Logic Programs (PDF, talk)
stepwise development	(FM) Stepwise Development and Model Checking of a Distributed Interlocking System - using RAISE (PDF, talk)
stereotypical activities	(ICLP) An ASP Methodology for Understanding Narratives about Stereotypical Activities (PDF, talk)
Stochastic Chemical Reaction Networks	(VEMDP) Molecular Filters for Noise Reduction (PDF, talk)
Stochastic dynamical systems and control	(VEMDP) Noise Control for Molecular Computing (PDF, talk)
stochastic games	(CAV) Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm (PDF, talk)
Stochastic hybrid system	(MoRe) Stochastic o-minimal hybrid systems (PDF, talk)
stochastic lambda calculus	(LICS) Boolean-Valued Semantics for Stochastic Lambda-Calculus (PDF, talk)
Stochastic modeling	(VEMDP) Computational Approaches for the Programmed Assembly of Nanocellulose Meshes (PDF, talk)
stochastic models	(VaVAS) Towards a Hierarchical-Control Architecture for Distributed Autonomous Systems (Extended Abstract - Paper) (PDF, talk)
Stochastic multi-scenario optimization	(MoRe) Multi-Scenario Uncertainty in Markov Decision Processes (PDF, talk)
stochastic reachability	(VaVAS) Adaptive Neighborhood Resizing for Stochastic Reachability in Multi-Agent Systems (PDF, talk)
stochastic shortest path	(LICS) Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes (PDF, talk)
Stochastic simulation	(VEMDP) Rule-Based Gillespie Simulation of Chemical Systems (PDF, talk)
Stone space	(LICS) On the number of types in sparse graphs (PDF, talk)
Straight-Line Graphs	(LPOP) A Rule-Based Tool for Analysis and Generation of Graphs Applied to Mason's Marks (PDF, talk)
strategic graph rewriting	(TERMGRAPH) Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting (PDF, talk)
strategies	(SAT) Local Soundness for QBF Calculi (PDF, talk)
strategy languages	(TERMGRAPH) A Port-graph Model for Finance (PDF, talk)
Strategy Logic	(SR) Strategy Logic with Imperfect Information (PDF, talk) (SR) Quantifying Bounds in Strategy Logic (PDF, talk) (SR) Dependences in Strategy Logic (PDF, talk) (SR) Local Equilibria in Logic-Based Multi-Player Games (PDF, talk)
Strategy synthesis	(MoRe) Safe and Optimal Scheduling of Hard and Soft Tasks (PDF, talk) (VaVAS) Probabilistic Model Checking for Autonomous Agent Strategy Synthesis - Extended Abstract (PDF, talk)
Streaming string transducers	(LICS) Regular and First Order List Functions (PDF, talk)
Streams	(LICS) A Generalized Modality for Recursion (PDF, talk)
Streett objectives	(CAV) Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives (PDF, talk)
strict inequalities	(CAV) A Direct Encoding for NNC Polyhedra (PDF, talk)
Strict partial orders	(REFINE) Ordering strict partial orders to model behavioural refinement (PDF, talk)
strictification	(HDRA) Merge-bicategories: towards semi-strictification of higher categories (PDF, talk)
string data structure	(IWC) Coherence of monoids by insertions (PDF, talk)
string data structures	(HDRA) String data structures for Chinese monoids (PDF, talk)
string diagram	(HDRA) Normal forms for planar connected string diagrams (PDF, talk)
string diagrams	(FSCD) A diagrammatic axiomatisation of fermionic quantum circuits (PDF, talk) (TERMGRAPH) A Framework for Rewriting Families of String Diagrams (PDF, talk) (LICS) Rewriting with Frobenius (PDF, talk) (LICS) Two complete axiomatisations of pure-state qubit quantum computing (PDF, talk) (LICS) Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams (PDF, talk)
string rewriting	(ITP) Verification of PCP-Related Computational Reductions in Coq (PDF, talk) (WST) Semantic Kachinuki Order (PDF, talk) (WST) Embracing Infinity - Termination of String Rewriting by Almost Linear Weight Functions (PDF, talk) (IWC) Coherence modulo relations (PDF, talk)
strings	(CAV) StringFuzz: A Fuzzer for String Solvers (PDF, talk)
strong sums	(LICS) Strong Sums in Focused Logic (PDF, talk)
strongest postcondition	(ITP) Backwards and Forwards with Separation Logic (PDF, talk)
strongly normalizable terms	(ITRS) On sets of terms with a given intersection type (PDF, )
Structural modeling	(VEMDP) Computational Approaches for the Programmed Assembly of Nanocellulose Meshes (PDF, talk)
Structural Operational Semantics	(IJCAR) A Logical Framework with Commutative and Non-Commutative Subexponentials (PDF, talk)
structural proof theory	(TYDI) Deep Inference, Herbrand's Theorem and Expansion Proofs (PDF, talk)
structural rules	(ARQNL) Labelled calculi for QMLs with non-rigid and non-denoting terms (PDF, talk)
structure theory	(LICS) Satisfiability in multi-valued circuits (PDF, talk)
stubborn sets	(CAV) Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems (PDF, talk)
subject reduction	(ITRS) Intersection Subtyping with Constructors (PDF, talk)
substitutability	(RCRA) Replaceability for constraint satisfaction problems: Algorithms, Inferences, and Complexity Patterns (PDF, talk)
Substitution	(Isabelle) Substitutionless First-Order Logic: A Formal Soundness Proof (PDF, talk)
substructural calculus	(Linearity/TLLA) Substructural Calculi with Dependent Types (PDF, talk)
subterm convergent theories	(UNIF) Knowledge Problems in Equational Extensions of Subterm Convergent Theories (PDF, talk)
Subtyping	(FSCD) Cumulative Inductive Types in Coq (PDF, talk) (ITRS) Intersection Subtyping with Constructors (PDF, talk)
succinct ordered tree coding	(LICS) A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games (PDF, talk)
sums of nonnegative circuit polynomials	(PC) Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
sums of squares	(PC) Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
sums-of-squares	(LICS) Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem (PDF, talk)
superposition	(IJCAR) Superposition for Lambda-Free Higher-Order Logic (PDF, talk) (IJCAR) Superposition with Datatypes and Codatatypes (PDF, talk) (SMT) SMT Solving Modulo Tableau and Rewriting Theories (PDF, talk)
swarms	(Overture) Multi-modelling of Cooperative Swarms (PDF, talk)
SyGuS	(CAV) Syntax Guided Synthesis with Quantitative Syntactic Objectives (PDF, talk)
Sylleptic categories	(HDRA) Towards a fully formalized definition of syllepsis in weak higher categories (PDF, talk)
Symbolic Algorithms	(SR) Solving Parity Games: Explicit vs Symbolic (PDF, talk) (CAV) Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives (PDF, talk)
Symbolic Analysis	(DS-FM) Analysis and Verification of Message Passing based Parallel Programs (PDF, talk)
symbolic automata	(CAV) The Learnability of Symbolic Automata (PDF, talk)
symbolic behavioral semantics	(AVOCS) Using SMT engine to generate Symbolic Automata (PDF, talk)
symbolic computation	(SCSC) Unknot Recognition Through Quantifier Elimination (PDF, talk) (SCSC) Techniques for Natural-style Proofs in Elementary Analysis (PDF, talk) (ITP) HOL Light QE (PDF, talk)
symbolic constraints	(CSF) A Typing Result for Stateful Protocols (PDF, talk)
symbolic cryptography	(CSF) Symbolic security of garbled circuits (PDF, talk)
Symbolic evaluation	(ICLP) Constraint-Based Inference in Probabilistic Logic Programs (PDF, talk)
Symbolic Execution	(CAV) Formal Verification of a Vehicle-to-Vehicle (V2V) Messaging System (PDF, talk) (CAV) Symbolic Liveness Analysis of Real-World Software (PDF, talk) (CAV) Model Checking Boot Code from AWS Data Centers (PDF, talk)
symbolic heap	(ADSL) Cyclic Theorem Prover for Separation Logic by Magic Wand (PDF, talk)
Symbolic heaps	(ADSL) A Complete Proof System for Basic Symbolic Heaps with Permissions (PDF, talk)
Symbolic model	(CAV) The DEEPSEC prover (PDF, talk)
symbolic models	(FCS) Proving physical proximity using symbolic models (PDF, talk)
symbolic sampling	(CSF) Symbolic Side-Channel Analysis for Probabilistic Programs (PDF, talk)
symbolic security	(CSF) Symbolic security of garbled circuits (PDF, talk)
Symmetric monoidal categories	(LICS) Rewriting with Frobenius (PDF, talk)
Symmetries	(SAT) Symmetries for QBF (PDF, talk)
Symmetry Breaking	(SAT) Symmetries for QBF (PDF, talk) (IJCAR) Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing (PDF, talk)
Symmetry reduction	(FM) View abstraction for systems with component identities (PDF, talk)
Symmetry Rule	(PC) The Symmetry Rule for Quantified Boolean Formulas (PDF)
Symmetry-Breaking Predicates	(CAV) Exploiting Synchrony and Symmetry in Relational Verification (PDF, talk)
Synchronization	(REFINE) Refining Santa: An Excercise in Efficient Synchronization (PDF, talk)
synchronizations	(FM) A lightweight deadlock analysis for programs with threads and reentrant locks (PDF, talk)
Synchronous Programming	(LICS) A Generalized Modality for Recursion (PDF, talk)
syntactic models	(DCM) A syntactic model of mutation and aliasing (PDF, talk)
syntax	(PAAR) TFX: The TPTP Extended Typed First-order Form (PDF, talk)
Syntax guided synthesis	(CAV) Counterexample Guided Inductive Synthesis Modulo Theories (PDF, talk)
syntax of type theory	(HoTT/UF) Towards the syntax and semantics of higher dimensional type theory (PDF, talk)
Syntax-Guided Synthesis	(IJCAR) Datatypes with Shared Selectors (PDF, talk) (SMT) Rewrites for SMT Solvers using Syntax-Guided Enumeration (PDF, talk)
Synthesis	(IJCAR) FORT 2.0 (PDF, talk) (CAV) Synthesizing Reactive Systems from Hyperproperties (PDF, talk) (CAV) Synthesis Of Asynchronous Reactive Programs From Temporal Specifications (PDF, talk) (CAV) Rabinizer 4: From LTL to Your Favourite Deterministic Automaton (PDF, talk) (CAV) Attracting Tangles to Solve Parity Games (PDF, talk) (CAV) Understanding and Extending Incremental Determinization for 2QBF (PDF, talk) (LICS) Logics for Word Transductions with Synthesis (PDF, talk) (VaVAS) Formal Synthesis of Control Strategies for Dynamical Systems (PDF)
Synthetic Biology	(VEMDP) Bayesian Verification of Chemical Reaction Networks (PDF, talk)
Synthetic Data	(FCS) LISA: Predicting the Impact of DoS Attacks on Real-World Low Power IoT Systems (PDF, talk)
Synthetic Geometry	(ThEdu) Towards intuitive reasoning in axiomatic geometry (PDF, talk)
Synthetic Topology	(HoTT/UF) Cohesive Covering Theory (PDF, talk)
system architectures	(FM) Formal Specification and Verification of Dynamic Parametrized Architectures (PDF, talk)
System Composition	(LICS) Sequential Relational Decomposition (PDF, talk)
system description	(IJCAR) The Higher-Order Prover Leo-III (PDF, talk)
system F	(LICS) Impredicative Encodings of (Higher) Inductive Types (PDF, talk)
System Verification	(VaVAS) Towards a verifiable decision making framework for self-driving vehicles (PDF, talk)
System-based design	(CSF) Guided design of attack trees: a system-based approach (PDF, talk)
Systematic Testing	(CAV) Partial Order Aware Concurrency Sampling (PDF, talk)
systematicity	(WiL) Towards a Logical Framework for Latent Variable Modelling (PDF, talk)
Systems Biology	(VEMDP) Bayesian Verification of Chemical Reaction Networks (PDF, talk)
Systems decomposition	(LICS) Sequential Relational Decomposition (PDF, talk)
Systems of recursion equations	(FSCD) Term-Graph Anti-Unification (PDF, talk)
syzygies	(IWC) The diamond lemma for free modules (PDF, talk)
T
Tableau calculus	(IJCAR) A Tableaux Calculus for Reducing Proof Size (PDF, talk)
tableaux	(IJCAR) From Syntactic Proofs to Combinatorial Proofs (PDF, talk) (SMT) SMT Solving Modulo Tableau and Rewriting Theories (PDF, talk)
tabling	(ICLP) Top-down and Bottom-up Evaluation Reconciled (PDF, talk)
tactics	(ITP) Tactics and certificates in Meta Dedukti (PDF, talk) (Coq) Proof Construction by Tactic Learning (PDF, talk)
tail bound	(ITP) Verified Tail Bounds for Randomized Programs (PDF, talk)
taint analysis	(CAV) Lazy Self-Composition for Security Verification (PDF, talk)
Taylor expansion	(Linearity/TLLA) On the Taylor expansion of λ-terms and the groupoid structure of their rigid approximants (PDF, talk) (LICS) Species, Profunctors and Taylor Expansion Weighted by SMCC--A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs-- (PDF, talk)
Taylor expansion of lambda-terms	(HOR) Normalization and Taylor expansion of lambda-terms (PDF, talk)
Taylor models	(CAV) Inner and Outer Approximating Flowpipes for Delay Differential Equations (PDF, talk)
TCP server	(UITP) Isabelle/PIDE after 10 years of development (PDF, talk)
teaching	(WST) TTT2 with Termination Templates for Teaching (PDF, talk)
Teaching computer science with proof assistants	(ITP) CalcCheck: A Proof Checker for Teaching the “Logical Approach to Discrete Math” (PDF, talk)
Technology	(Isabelle) Further Scaling of Isabelle Technology (PDF, talk)
templates	(WST) TTT2 with Termination Templates for Teaching (PDF, talk)
Temporal Answer Set Programming	(ICLP) Temporal Answer Set Programming on Finite Traces (PDF, talk)
Temporal Logic	(CAV) Synthesis Of Asynchronous Reactive Programs From Temporal Specifications (PDF, talk) (PAAR) Evaluating Pre-Processing Techniques for the Separated Normal Form for Temporal Logics (PDF, talk)
temporal logic of repeating values	(LICS) Playing with Repetitions in Data Words Using Energy Games (PDF, talk)
Temporal logics	(VaVAS) Policy Generation with Probabilistic Guarantees for Long-term Autonomy of a Mobile Service Robot (PDF, talk)
Temporal Verification	(CAV) Propositional Dynamic Logic for Higher-Order Functional Programs (PDF, talk) (LICS) Dependent Temporal Effects and Fixpoint Logic for Verification (PDF, talk)
Tensor logic	(LICS) Around Classical and Intuitionistic Linear Logics (PDF, talk)
tensorflow	(LICS) The Geometry of Computation-Graph Abstraction (PDF, talk)
tensorial logic	(LICS) Ribbon tensorial logic (PDF, talk)
Term graph transformation	(TERMGRAPH) Semantics-Preserving DPO-Based Term Graph Rewriting (PDF, talk)
term orderings	(IJCAR) MaedMax: A Maximal Ordered Completion Tool (PDF, talk)
term rewriting	(FSCD) Term rewriting characterisation of LOGSPACE for finite and infinite data (PDF, talk) (FSCD) ProTeM: A Proof Term Manipulator (PDF, talk) (TERMGRAPH) Drags: an algebraic framework for graph rewriting (PDF, talk) (IWC) Towards a Verified Decision Procedure for Confluence of Ground Term Rewrite Systems in Isabelle/HOL (PDF, talk) (WPTE) On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions (PDF, talk) (HOR) Orthogonality and sequentiality in substructural Linear HRSs (PDF, talk)
term rewriting systems	(FSCD) Completeness of Tree Automata Completion (PDF, talk) (TERMGRAPH) Programming by Term Rewriting (PDF, talk) (Coq) ComplCoq: Rewrite Hint Construction with Completion Procedures (PDF, talk)
termination	(WST) Termination of Lambda-Pi modulo rewriting using the size-change principle (PDF, talk) (WST) Semantic Kachinuki Order (PDF, talk) (WST) GPO: A Path Ordering for Graphs (PDF, talk) (WST) Procedure-Modular Termination Analysis (PDF, talk) (WST) Embracing Infinity - Termination of String Rewriting by Almost Linear Weight Functions (PDF, talk) (IWC) Convergence of Simultaneously and Sequentially Unraveled TRSs for Normal Conditional TRSs (PDF, talk) (WPTE) Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics (PDF, talk) (LICS) Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS (PDF, talk) (HDRA) Termination in linear (2,2)-categories with braidings and duals (PDF, talk)
termination analysis	(WST) Control-Flow Refinement via Partial Evaluation (PDF, talk) (WST) Improving Static Dependency Pairs for Higher-Order Rewriting (PDF, talk)
termination proofs	(TERMGRAPH) On quasi ordinal diagram systems (PDF, talk) (IJCAR) Well-Founded Unions (PDF, talk)
Termination Proving	(CAV) Syntax-Guided Termination Analysis (PDF, talk)
termination tools	(WST) TTT2 with Termination Templates for Teaching (PDF, talk)
test case generation	(CAV) The JKind Model Checker (PDF, talk)
Testing	(VaVAS) Trust me - I am autonomous (PDF) (VaVAS) Reproducibility in Robotics - The Big 5 Issues (PDF)
text documents	(F-IDE) Isabelle/jEdit as IDE for domain-specific formal languages and informal text documents (PDF, talk)
text-based interaction	(UITP) Adding Text-Based Interaction to a Direct-Manipulation Interface for Program Verification -- Lessons Learned (PDF, talk)
textual inference	(NLCS) Graph Knowledge Representations for SICK (PDF, talk)
The Coq Proof Assistant	(ITP) A Coq Tactic for Equality Learning in Linear Arithmetic (PDF, talk)
the MRDP theorem	(LICS) A parameterized halting problem, the linear time hierarchy, and the MRDP theorem (PDF, talk)
The Santa Claus Problem	(REFINE) Refining Santa: An Excercise in Efficient Synchronization (PDF, talk)
theorem proving	(F-IDE) Experience Report on Formally Verifying Parts of OpenJDK's API with KeY (PDF, talk) (ITP) Understanding Parameters of Deductive Verification: An Empirical Investigation of KeY (PDF, talk) (FSCD) Completion for Logically Constrained Rewriting (PDF, talk) (ICLP) Certified Graph View Maintenance with Regular Datalog (PDF, talk) (FM) Z3 and SMT in Industrial R&D (PDF, talk) (IJCAR) Superposition with Datatypes and Codatatypes (PDF, talk) (IJCAR) MaedMax: A Maximal Ordered Completion Tool (PDF, talk) (IJCAR) An abstraction-refinement framework for reasoning with large theories (PDF, talk) (RCRA) Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic (PDF, talk) (PAAR) Set of Support for Higher-Order Reasoning (PDF, talk) (PAAR) Dynamic Strategy Priority: Empower the strong and abandon the weak (PDF, talk) (VaVAS) RoboTool: Modelling and Verification with RoboChart (PDF, talk) (SMT) What is the Point of an SMT-LIB Problem? (PDF, talk)
Theorem Proving by Induction	(CAV) Formally Verified Montgomery Multiplication (PDF, talk)
theories	(IJCAR) Theories as Types (PDF, talk)
Theory of Computation	(LICS) A General Framework for Relational Parametricity (PDF, talk)
threads	(FM) A lightweight deadlock analysis for programs with threads and reentrant locks (PDF, talk)
Time complexity Analysis	(IJCAR) Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle (PDF, talk)
Time Models	(REFINE) Ordering strict partial orders to model behavioural refinement (PDF, talk)
Time Refinement	(REFINE) Ordering strict partial orders to model behavioural refinement (PDF, talk)
Time-varying graphs	(DCM) A Category Theoretic Interpretation of Gandy’s Principles for Mechanisms (PDF, talk)
Timed automata	(ITP) MDP + TA = PTA: Probabilistic Timed Automata, Formalized (Short Paper) (PDF, talk) (AVOCS) Backward reachability analysis for timed automata with data variables (PDF, talk)
timed systems	(FM) The Compound Interest in Relaxing Punctuality (PDF, talk) (CAV) Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems (PDF, talk)
timed-arc Petri nets	(CAV) Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems (PDF, talk)
timing	(REFINE) A Theory of Lazy Imperative Timing (PDF, talk)
timing attacks	(FCS) A Study on the Preservation on Cryptographic Constant-Time Security in the CompCert Compiler (PDF, talk)
timing transformations	(ITP) Verified Timing Transformations in Synchronous Circuits with LambdaPi-Ware (PDF, talk)
TLS	(CSF) Composition Theorems for CryptoVerif and Application to TLS 1.3 (PDF, talk)
tool	(Isabelle) The remote_build Tool (PDF, talk)
Tool paper	(FM) QFLan: A Tool for the Quantitative Analysis of Highly Reconfigurable Systems (PDF, talk)
toolkit	(SAT) PySAT: A Python Toolkit for Prototyping with SAT Oracles (PDF, talk)
top tree	(IWC) Complete Axiom System of Cluster Algebra (PDF, talk)
top-down	(ICLP) Top-down and Bottom-up Evaluation Reconciled (PDF, talk)
topologicai logics	(WiL) About the unification type of topological logics over Euclidean spaces (PDF, talk)
Topological Quantum Computation	(DCM) Towards a Formal System for Topological Quantum Computation (PDF, talk)
topos theory	(HoTT/UF) Towards a geometric model theory of type theory (PDF)
total correctness	(WPTE) Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics (PDF, talk)
Total Store Ordering	(CAV) Reasoning About TSO Programs Using Reduction and Abstraction (PDF, talk)
Totalizer	(SAT) Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT (PDF, talk)
tptp	(PAAR) TFX: The TPTP Extended Typed First-order Form (PDF, talk)
Trace semantics	(CSF) Guided design of attack trees: a system-based approach (PDF, talk)
traceability	(CAV) The JKind Model Checker (PDF, talk)
traced monoidal categories	(Linearity/TLLA) From Linear Logic to Cyclic Sharing (PDF, talk)
Traffic Scenarios	(SCSC) Constraint Systems from Traffic Scenarios for the Validation of Autonomous Driving (PDF, talk)
Trajectory	(ICLP) A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming (PDF, talk)
transcendental syntax	(Linearity/TLLA) Coherent interaction graphs: a nondeterministic geometry of interaction for MLL (PDF, talk)
transducers	(LICS) Regular Transducer Expressions for Regular Transformations over infinite words (PDF, talk)
transduction	(LICS) Definable decompositions for graphs of bounded linear cliquewidth (PDF, talk) (LICS) Logics for Word Transductions with Synthesis (PDF, talk)
transition system	(FM) Deadlock Detection for Actor-based Coroutines (PDF, talk) (FM) Approximate Partial Order Reduction (PDF, talk)
Transitive Closure	(PARIS) Transitive Closure Logic: Infinitary and Cyclic Proof Systems (PDF, talk)
Transitive closure logic	(WiL) Non-well-founded proof system for Transitive Closure Logic (PDF, talk)
Translation	(CSF) Types for Information Flow Control: Labeling Granularity and Semantic Models (PDF, talk) (PAAR) Efficient translation of sequent calculus proofs into natural deduction proofs (PDF, talk)
Translation Lookaside Buffer (TLB)	(ITP) Program Verification in the Presence of Cached Address Translation (PDF, talk)
translations	(Linearity/TLLA) Benchmarking Linear Logic Translations (PDF, talk)
treap	(ITP) Verified Analysis of Random Binary Tree Structures (PDF, talk)
Tree	(HDRA) Generalizations of the associative operad and convergent rewrite systems (PDF, talk)
tree automata	(FSCD) Completeness of Tree Automata Completion (PDF, talk) (LICS) Automaton-Based Criteria for Membership in CTL (PDF, talk)
tree automata completion	(FSCD) Completeness of Tree Automata Completion (PDF, talk)
tree constraints	(IJCAR) Deciding the First-Order Theory of an Algebra of Feature Trees with Updates (PDF, talk)
Tree Decompositions	(SAT) Exploiting Treewidth for Projected Model Counting and its Limits (PDF, talk) (LaSh) Solving #SAT by Parameterized Algorithms: Exploiting Small Treewidth (PDF, talk)
tree-depth	(LICS) Tree depth, quantifier elimination, and quantifier rank (PDF, talk)
Trees	(LICS) MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras (PDF, talk)
treewidth	(SAT) QBF as an Alternative to Courcelle's Theorem (PDF, talk) (QBF) Tractability results for structured quantified CNF-formulas via knowledge compilation (PDF, talk) (LaSh) Solving #SAT by Parameterized Algorithms: Exploiting Small Treewidth (PDF, talk)
tripos	(ITP) Formalizing Implicative Algebras in Coq (PDF, talk)
true concurrency	(TYDI) Truely Concurrent Processes in the Calculus of Structures (PDF, talk) (LICS) An Asynchronous Soundness Theorem for Concurrent Separation Logic (PDF, talk)
truncation levels	(LICS) Free Higher Groups in Homotopy Type Theory (PDF, talk)
Trust Management	(LPOP) Security Policies in Constraint Handling Rules (PDF, talk)
trusted code base	(ITP) Software Verification with ITPs Should Use Binary Code Extraction to Reduce the TCB (short paper) (PDF, talk)
trusted computing base	(ITP) Software Verification with ITPs Should Use Binary Code Extraction to Reduce the TCB (short paper) (PDF, talk)
Tseitin formulas	(SAT) Cops-Robber games and the resolution of Tseitin formulas (PDF, talk)
tuple-generating dependencies	(IJCAR) Efficient Model Construction for Horn Logic with VLog: System Description (PDF, talk)
Turing degrees	(LICS) An answer to the Gamma question (PDF, talk)
tutoring	(ThEdu) Lucas Interpretation from Programmers’ Perspective (PDF, talk)
Two player games	(LICS) Playing with Repetitions in Data Words Using Energy Games (PDF, talk)
two-level type theory	(LFMTP) The RedPRL Proof Assistant (PDF)
two-player games	(MoRe) Parameterized complexity of games with monotonically ordered omega-regular objectives (PDF, talk)
Two-player win/lose	(SR) Concurrent games and semi-random determinacy (PDF, talk)
two-variable logic	(LICS) Weighted model counting beyond two-variable logic (PDF, talk)
type classes	(ICLP-DC) Proof-relevant resolution for elaboration of programming languages (PDF, talk)
Type Inference	(ITP) Formalization of a Polymorphic Subtyping Algorithm (PDF, talk) (ICLP) Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis (PDF, talk) (CAV) MaxSMT-Based Type Inference for Python 3 (PDF, talk)
type inference and type inhabitation	(RCRA) Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic (PDF, talk)
type inhabitation	(F-IDE) User Support for the Combinator Logic Synthesizer Framework (PDF, talk) (FSCD) A Unifying Framework for Type Inhabitation (PDF, talk)
type refinement systems	(HOR) The next 700 (type-theoretical) denotational models ? (PDF, talk)
type system	(FM) A lightweight deadlock analysis for programs with threads and reentrant locks (PDF, talk) (CSF) A Permission-Dependent Type System for Secure Information Flow Analysis (PDF, talk) (CSF) Types for Information Flow Control: Labeling Granularity and Semantic Models (PDF, talk) (LICS) Causal Computational Complexity of Distributed Processes (PDF, talk)
type systems	(CSF) Enforcing ideal-world leakage bounds in real-world secret sharing MPC frameworks (PDF, talk) (LICS) Work Analysis with Resource-Aware Session Types (PDF, talk) (LICS) A Generalized Modality for Recursion (PDF, talk) (LICS) A theory of linear typings as flows on 3-valent graphs (PDF, talk)
type theory	(WiL) On Expanding Standard Notions of Constructivity (PDF, talk) (ITP) The Coinductive Formulation of Common Knowledge (PDF, talk) (ITP) Efficient Mendler-Style Lambda-Encodings in Cedille (PDF, talk) (FSCD) The clocks they are adjunctions. Denotational semantics for Clocked Type Theory (PDF, talk) (FSCD) Call-by-name Gradual Type Theory (PDF, talk) (NLCS) Propositional Forms of Judgemental Interpretations (PDF, talk) (HoTT/UF) A Yoneda lemma-formulation of the univalence axiom (PDF, talk) (HoTT/UF) Towards a geometric model theory of type theory (PDF) (IJCAR) Theories as Types (PDF, talk) (Linearity/TLLA) Quantum programming made easy (PDF, talk) (LICS) The Syntax and Semantics of Quantitative Type Theory (PDF, talk) (LICS) Computability Beyond Church-Turing via Choice Sequences (PDF, talk) (LICS) Guarded Computational Type Theory (PDF, talk) (PARIS) What makes guarded types tick? (PDF, talk)
Type-based Development	(F-IDE) User Support for the Combinator Logic Synthesizer Framework (PDF, talk)
type-logical grammar	(IJCAR) A Logical Framework with Commutative and Non-Commutative Subexponentials (PDF, talk)
typed assembly languages	(LFMTP) Property-Based Testing of Abstract Machines: an Experience Report (PDF, talk)
typed lambda calculus	(NLCS) Do different syntactic trees yield different logical readings? Some remarks on head variables in typed lambda calculus. (PDF, talk)
typing results	(CSF) A Typing Result for Stateful Protocols (PDF, talk)
U
UD	(NLCS) OpenWordNet-PT: Taking Stock (PDF, talk)
Ultrametrics	(ITP) An Agda Formalization of Üresin & Dubois' Asynchronous Fixed-Point Theory (PDF, talk)
UML	(LPOP) Security Policies in Constraint Handling Rules (PDF, talk)
unambiguous	(LICS) Regular Transducer Expressions for Regular Transformations over infinite words (PDF, talk)
unary negation fragment	(LICS) Unary negation fragment with equivalence relations has the finite model property (PDF, talk)
Uncertain planning	(FM) Multi-Robot LTL Planning Under Uncertainty (PDF, talk)
Uncertainty	(PRUV) Evidential Group Decision Making Model with Belief-Based Preferences (PDF, talk)
Uncountability	(ThEdu) Proving in the Isabelle Proof Assistant that the Set of Real Numbers is not Countable (PDF, talk)
Undecidability	(ITP) Verification of PCP-Related Computational Reductions in Coq (PDF, talk)
under-approximations	(CAV) Inner and Outer Approximating Flowpipes for Delay Differential Equations (PDF, talk)
unification	(UNIF) Bounded ACh Unification (PDF, talk) (UNIF) About the Unification Type of Topological Logics over Euclidean Spaces (PDF, talk) (UNIF) ACUI Unification Modulo Ground Theories (PDF, talk) (UNIF) Efficiency of a Good but not Linear Nominal Unification Algorithm (PDF, talk) (UITP) Partial Regularization of First-Order Resolution Proofs (PDF, talk) (LICS) Unification nets: canonical proof net quantifiers (PDF, talk)
unification problem	(WiL) About the unification type of topological logics over Euclidean spaces (PDF, talk)
uniform interpolation	(IJCAR) FAME: An Automated Tool for Semantic Forgetting in Expressive Description Logics (PDF, talk)
uniform intersection types	(ITRS) Strong normalization of simple types through uniform intersection types. (PDF, talk)
uniform one-dimensional fragment	(LICS) Weighted model counting beyond two-variable logic (PDF, talk)
uniform proof	(PARIS) Coinductive Uniform Proofs: An Extended Abstract (PDF, talk)
Uniform quasi-wideness	(LICS) On the number of types in sparse graphs (PDF, talk)
uniform substitution	(IJCAR) Uniform Substitution for Differential Game Logic (PDF, talk)
Unifying Theories of Programming	(Isabelle) Using Isabelle/UTP for the Verification of Sorting Algorithms: A Case Study (PDF, talk)
Uninterpreted Function Symbols	(CAV) The Proof Complexity of SMT Solvers (PDF, talk)
unions	(LICS) Degrees of Relatedness - A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory (PDF, talk)
unions of relations	(IJCAR) Well-Founded Unions (PDF, talk)
unique normal form property	(IWC) Complete Axiom System of Cluster Algebra (PDF, talk)
unit equality	(IJCAR) Efficient encodings of first-order Horn formulas in equational logic (PDF, talk)
unit propagation	(SAT) Approximately Propagation Complete and Conflict Propagating Constraint Encodings (PDF, talk) (IJCAR) QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property (PDF, talk)
unit testing	(Overture) Enhancing Testing of VDM-SL models (PDF, talk)
Univalence	(FCS) A Homotopical Approach to Cryptography (PDF, talk)
univalence axiom	(HoTT/UF) A Yoneda lemma-formulation of the univalence axiom (PDF, talk)
univalent foundations	(FSCD) Internal Universes in Models of Homotopy Type Theory (PDF, talk) (HoTT/UF) A Yoneda lemma-formulation of the univalence axiom (PDF, talk) (LICS) On Higher Inductive Types in Cubical Type Theory (PDF, talk)
universal algebra	(LICS) A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP (PDF, talk)
universal IDE	(F-IDE) Isabelle/jEdit as IDE for domain-specific formal languages and informal text documents (PDF, talk)
Universe	(FCS) A Homotopical Approach to Cryptography (PDF, talk)
universes	(FSCD) Internal Universes in Models of Homotopy Type Theory (PDF, talk) (FSCD) Cumulative Inductive Types in Coq (PDF, talk) (LICS) Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types (PDF, talk) (LICS) Guarded Computational Type Theory (PDF, talk)
Unmanned Aircraft Systems	(FM) From Formal Requirements to Highly Assured Software for Unmanned Aircraft Systems (PDF, talk)
unraveling	(IWC) Convergence of Simultaneously and Sequentially Unraveled TRSs for Normal Conditional TRSs (PDF, talk)
Unsatisfiability proof generation	(POS) Two flavors of DRAT (PDF, talk)
untyped call by value lambda calculus	(ITP) A Formal Equational Theory for Call-By-Push-Value (PDF, talk)
untyped lambda calculus	(HOR) Refining Properties of Filter Models: Sensibility, Approximability and Reducibility (PDF, talk)
Unweighted Partial MaxSAT	(SAT) Solving MaxSAT with Bit-Vector Optimization (PDF, talk)
Usability	(F-IDE) User Support for the Combinator Logic Synthesizer Framework (PDF, talk)
user interface	(UITP) Automated Theorem Proving in a Chat Environment (PDF, talk)
Utility Theory	(ITP) Towards Formal Foundations for Game Theory (short paper) (PDF, talk)
V
vacuity	(FM) Timed Vacuity (PDF, talk)
Vacuity Checking	(DS-FM) Consistency Checking of Functional Requirements (PDF, talk)
validation	(ITP) Fast machine words in Isabelle/HOL (PDF, talk) (SAT) Polynomial-Time Validation of QCDCL Certificates (PDF, talk)
Validation and verification	(VaVAS) Towards validation and verification of an autonomous railway inspection and repair system (PDF, )
value iteration	(CAV) Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm (PDF, talk) (CAV) Sound Value Iteration (PDF, talk)
vampire	(IJCAR) A FOOLish Encoding of the Next State Relations of Imperative Programs (PDF, talk)
variant analysis	(FM) Variant analysis with QL (PDF, talk)
VC-density	(LICS) On the number of types in sparse graphs (PDF, talk)
VC-dimension	(LICS) On the number of types in sparse graphs (PDF, talk)
VDM	(Overture) Enhancing Testing of VDM-SL models (PDF, talk) (Overture) Transforming an industrial case study from VDM++ to VDM-SL (PDF, talk)
VDM-RT	(Overture) Overture FMU: Export VDM-RT Models as Tool-Wrapper FMUs (PDF, talk)
VDMJ	(Overture) VDM at large: analysing the EMV Next Generation Kernel (PDF, talk)
vector addition systems with states	(LICS) Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS (PDF, talk)
vector Lyapunov functions	(FM) Vector Barrier Certificates and Comparison Systems (PDF, talk)
Vehicle-to-Vehicle	(CAV) Formal Verification of a Vehicle-to-Vehicle (V2V) Messaging System (PDF, talk)
verifiable electronic voting	(CSF) Machine-checked proofs for electronic voting: privacy and verifiability for Belenios (PDF, talk)
Verification	(ITP) Verified Timing Transformations in Synchronous Circuits with LambdaPi-Ware (PDF, talk) (ITP) A Formal Equational Theory for Call-By-Push-Value (PDF, talk) (SAT) Effective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition (PDF, talk) (TERMGRAPH) Programming by Term Rewriting (PDF, talk) (FM) Towards `Verifying' a Water Treatment System (PDF, talk) (FM) IPL: An Integration Property Language for Multi-Model Cyber-Physical Systems (PDF, talk) (WST) Procedure-Modular Termination Analysis (PDF, talk) (WST) Verification of Rewriting-based Query Optimizers (PDF, talk) (SR) Quantifying Bounds in Strategy Logic (PDF, talk) (WPTE) Automating the Diagram Method to Prove Correctness of Program Transformations (PDF, talk) (CAV) Rabinizer 4: From LTL to Your Favourite Deterministic Automaton (PDF, talk) (CAV) SCInfer: Refinement-based Verification of Software Countermeasures against Side-Channel Attacks (PDF, talk) (CAV) Continuous formal verification of Amazon s2n (PDF, talk) (FCS) LISA: Predicting the Impact of DoS Attacks on Real-World Low Power IoT Systems (PDF, talk) (CSF) Enforcing ideal-world leakage bounds in real-world secret sharing MPC frameworks (PDF, talk) (CSF) A little more conversation, a little less action, a lot more satisfaction: Global states in ProVerif. (PDF, talk) (AVOCS) Analyzing Consistency of Formal Requirements (PDF, talk) (VaVAS) RoboTool: Modelling and Verification with RoboChart (PDF, talk)
verified compilation	(FCS) A Study on the Preservation on Cryptographic Constant-Time Security in the CompCert Compiler (PDF, talk)
verified compiler	(ITP) Software Verification with ITPs Should Use Binary Code Extraction to Reduce the TCB (short paper) (PDF, talk)
Verified Prover	(PAAR) A Verified Simple Prover for First-Order Logic (PDF, talk)
Vienna Development Method (VDM)	(Overture) Integrating VDM-SL into the continuous delivery pipelines of cloud-based software (PDF, talk)
view	(FM) IPL: An Integration Property Language for Multi-Model Cyber-Physical Systems (PDF, talk) (LICS) Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable. (PDF, talk)
View abstraction	(FM) View abstraction for systems with component identities (PDF, talk)
Virtual Machine	(Overture) ViennaVM: a Virtual Machine for VDM-SL development (PDF, talk)
virtual physiological human	(RCRA) Computing Personalised Treatments through In Silico Clinical Trials. A Case Study on Downregulation in Assisted Reproduction. (PDF, talk)
Visualization	(ICLP) Experimenting with robotic intra-logistics domains (PDF, talk) (ICLP) CHRvis: Syntax and Semantics (PDF, talk)
Volume Computation	(PRUV) VolCE: An Efficient Tool for Solving #SMT(LA) Problems (PDF, talk)
Volume Estimation	(PRUV) VolCE: An Efficient Tool for Solving #SMT(LA) Problems (PDF, talk)
Von Neumann-Morgenstern Utility Theorem	(ITP) Towards Formal Foundations for Game Theory (short paper) (PDF, talk)
VSCode	(UITP) Isabelle/PIDE after 10 years of development (PDF, talk)
W
watchlist guidance	(ITP) ProofWatch: Watchlist Guidance for Large Theories in E (PDF, talk)
WCET analysis	(F-IDE) A Notebook Format for the Holistic Design of Embedded Systems (PDF, talk)
weak diamond property	(FSCD) Decreasing diagrams with two labels are complete for confluence of countable systems (PDF, talk)
Weak Memory	(IJCAR) Cubicle-W: Parameterized Model Checking on Weak Memory (PDF, talk)
weak memory models	(FM) A wide-spectrum language for verification of programs on weak memory models (PDF, talk) (REFINE) Correctness of Concurrent Objects under Weak Memory Models (PDF, talk)
Weak omega category theory	(HDRA) Towards a fully formalized definition of syllepsis in weak higher categories (PDF, talk)
weak subgame perfect equilibria	(MoRe) Constraint Problem for Weak Subgame Perfect Equilibria with omega-regular Boolean Objectives (PDF, talk)
weak units	(HDRA) Merge-bicategories: towards semi-strictification of higher categories (PDF, talk)
weakest precondition	(ITP) Backwards and Forwards with Separation Logic (PDF, talk) (AVOCS) Backward reachability analysis for timed automata with data variables (PDF, talk)
weakness	(FM) A Weakness Measure for GR(1) Formulae (PDF, talk)
Web Service Composition	(ICLP-DC) Natural Language Generation From Ontologies (PDF, talk)
Web services	(ICLP) Phylotastic: An Experiment in Creating, Manipulating, and Evolving Phylogenetic Biology Workflows Using Logic Programming (PDF, talk)
Web services composition	(ICLP) Phylotastic: An Experiment in Creating, Manipulating, and Evolving Phylogenetic Biology Workflows Using Logic Programming (PDF, talk)
Weighted MaxSAT	(SAT) Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT (PDF, talk)
weighted model counting	(LICS) Weighted model counting beyond two-variable logic (PDF, talk)
Weighted timed automata	(FM) Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty (PDF, talk)
well-founded relations	(IJCAR) Well-Founded Unions (PDF, talk)
Well-foundedness	(WST) Well-founded models in proofs of termination (PDF, talk)
while programs with atoms	(LICS) On computability and tractability for infinite sets (PDF, talk)
wide-spectrum language	(FM) A wide-spectrum language for verification of programs on weak memory models (PDF, talk)
Wireless Networks	(RCRA) Optimal Fault-Tolerant Placement of Relay Nodes in a Mission Critical Wireless Network (PDF, talk)
witness generation	(SAT) Fast Sampling of Perfectly Uniform Satisfying Assignments (PDF, talk) (IJCAR) FORT 2.0 (PDF, talk)
Witnessing	(PC) Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk)
witnessing theorems	(PC) Bounded induction without parameters (PDF, )
wordnet	(NLCS) OpenWordNet-PT: Taking Stock (PDF, talk)
Workflows	(ICLP) Phylotastic: An Experiment in Creating, Manipulating, and Evolving Phylogenetic Biology Workflows Using Logic Programming (PDF, talk)
World View Constraints	(ICLP) Epistemic Logic Programs with World View Constraints (PDF, talk)
World View Rules	(ICLP) Epistemic Logic Programs with World View Constraints (PDF, talk)
Wreath Products	(LICS) Wreath Products of Distributive Forest Algebras (PDF, talk)
WS1S	(LaSh) A Derivative-Based Decision Procedure for WS1S (PDF, talk)
WSN	(SMT) Puli - A Problem-Specific OMT Solver (PDF, talk)
WV Facts	(ICLP) Epistemic Logic Programs with World View Constraints (PDF, talk)
X
XORSAT	(SAT) XORSAT Set Membership Filters (PDF, talk)
XSB	(LPOP) LPOP2018 XSB Position Paper (PDF, talk)
Y
Yoneda isomorphism	(Linearity/TLLA) Proof nets, coends and the Yoneda isomorphism (PDF, talk)
Z
Zariski topology	(LICS) Polynomial Invariants for Affine Programs (PDF, talk)
zw calculus	(FSCD) A diagrammatic axiomatisation of fermionic quantum circuits (PDF, talk)
zx calculus	(FSCD) A diagrammatic axiomatisation of fermionic quantum circuits (PDF, talk)
α
α-conversion	(UNIF) Efficiency of a Good but not Linear Nominal Unification Algorithm (PDF, talk)