yusuke1997/dblp-id-title huggingface dataset:
Ambiguous Classes in the Games µ-Calculus Hierarchy
Constructor Subtyping in the Calculus of Inductive Constructions
Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata
Temporal Stream Logic modulo Theories
The Free Exponential Modality of Probabilistic Coherence Spaces
Relative Full Completeness for Bicategorical Cartesian Closed Structure
Solvability in Resource Lambda-Calculus
Synchronizing Automata over Nested Words
Event Structure Semantics of Parallel Extrusion in the Pi-Calculus
Block Structure vs. Scope Extrusion: Between Innocence and Omniscience
On the Existence of Weak Subgame Perfect Equilibria
Towards a Formal Theory of Graded Monads
Some Sahlqvist Completeness Results for Coalgebraic Logics
Tree Transducers and Tree Compressions
Kantorovich Functors and Characteristic Logics for Behavioural Distances
Security Protocols and Specifications
Proving Correctness of Timed Concurrent Constraint Programs
Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings
The Recognizability Problem for Tree Automata with Comparisons between Brothers
Forward Analysis of Depth-Bounded Processes
Synthesizing Probabilistic Composers
Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings
Fair Adversaries and Randomization in Two-Player Games
Alternation Elimination for Automata over Nested Words
A Lower Bound on Web Services Composition
Contextual Approximation and Higher-Order Procedures
Model Checking Logics for Communicating Sequential Agents
An Infinitary Model of Linear Logic
Notions of Computation Determine Monads
When Programs Have to Watch Paint Dry
On the Total Variation Distance of Semi-Markov Chains
Synchronized Tree Languages Revisited and New Applications
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks
A Relatively Complete Calculus for Structured Heterogeneous Specifications
On the k-synchronizability of Systems
Election and Local Computations on Edges
A Simpler Proof Theory for Nominal Logic
On Computability of Data Word Functions Defined by Transducers
Mathematical Models of Computational and Combinatorial Structures
Manipulating Trees with Hidden Labels
Parameter Reduction in Grammar-Compressed Trees
On the Stability by Union of Reducibility Candidates
LTL over Integer Periodicity Constraints: (Extended Abstract)
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation
The Complexity of Nash Equilibria in Infinite Multiplayer Games
Products of Message Sequence Charts
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols
Degrees of Lookahead in Regular Infinite Games
The Reduced Product of Abstract Domains and the Combination of Decision Procedures
A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects
On the Semantics of Refinement Calculi
Rewriting Abstract Structures: Materialization Explained Categorically
Toward a Compositional Theory of Leftist Grammars and Transformations
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
Perfect-Information Stochastic Parity Games
Mobile Ambients
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity
Foundations for a Graph-Based Approach to the Specification of Access Control Policies
Drawing from an Urn is Isometric
Non-idempotent Intersection Types in Logical Form
Axiomatizations for Probabilistic Finite-State Behaviors
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization
Deconstructing General References via Game Semantics
Proper Semirings and Proper Convex Functors
Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part II
Relational Parametricity and Separation Logic
Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario
When Is a Container a Comonad?
A Trace Semantics for System F Parametric Polymorphism
Towards a Compositional Framework for Convex Analysis (with Applications to Probability Theory)
Complexity of Model-Checking Call-by-Value Programs
Foundations of Web Transactions
Bounded Context-Switching and Reentrant Locking
Improved Ramsey-Based Büchi Complementation
Separating Graph Logic from MSO
Combining Semilattices and Semimodules
Coalgebraic Trace Semantics via Forgetful Logics
A Unifying Model of Variables and Names
Constructing Infinitary Quotient-Inductive Types
Local Local Reasoning: A BI-Hyperdoctrine for Full Ground Store
Parity Games on Temporal Graphs
Contextual Equivalence for Signal Flow Graphs
High-Level Petri Nets as Type Theories in the Join Calculus
Synthesis from Component Libraries
Bisimulations for Communicating Transactions - (Extended Abstract)
Quantifier elimination for counting extensions of Presburger arithmetic
Model Checking CTL + and FCTL is Hard
A Theory of Encodings and Expressiveness (Extended Abstract) - (Extended Abstract)
Differential Calculus with Imprecise Input and Its Logical Framework
Intruder Theories (Ongoing Work)
Compositional Learning for Interleaving Parallel Automata
Parameterized Verification by Probabilistic Abstraction
An Effective Algorithm for the Membership Problem for Extended Regular Expressions
Bounded MSC Communication
The Polynomial Complexity of Vector Addition Systems with States
Realizability and Parametricity in Pure Type Systems
Playing with Probabilities in Reconfigurable Broadcast Networks
A WP-calculus for OO
PDL with Intersection and Converse Is 2 EXP-Complete
Asymptotic Information Leakage under One-Try Attacks
Note on the Tableau Technique for Commutative Transition Systems
A Coalgebraic Perspective on Minimization and Determinization
Path Category for Free - Open Morphisms from Coalgebras with Non-deterministic Branching
Confluence of Right Ground Term Rewriting Systems Is Decidable
Compositional Methods for Information-Hiding
Context-Free Languages of String Diagrams
Genericity and the pi-Calculus
A Category of Higher-Dimensional Automata
Safety Is not a Restriction at Level 2 for String Languages
Stochastic Window Mean-Payoff Games
Equivalences of Pushdown Systems Are Hard
Generalized Eilenberg Theorem I: Local Varieties of Languages
Quotient Inductive-Inductive Types
Bidomains and Full Abstraction for Countable Nondeterminism
Model-Checking Real-Time Systems: Revisiting the Alternating Automaton Route
Relational Connectors and Heterogeneous Simulations
Parameterized Weighted Containment
A Proof System for Compositional Verification of Probabilistic Concurrent Processes
Constructing a universe for the setoid model
On the Foundations of Quantitative Information Flow
Bounding Average-Energy Games
Deriving Bisimulation Congruences: 2-Categories Vs Precategories
Pure Pointer Programs and Tree Isomorphism
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
A Characterization of Families of Graphs in Which Election Is Possible
Resource Based Models for Asynchrony
Focused and Synthetic Nested Sequents
Propositional Dynamic Logic with Recursive Programs
Coalgebra Learning via Duality
Limits and difficulties in the design of under-approximation abstract domains
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
The Paths to Choreography Extraction
Games on Graphs with a Public Signal Monitoring
Sound Bisimulations for Higher-Order Distributed Process Calculus
Temporal Reasoning about Program Executions
Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces
Handling exp, × (and Timestamps) in Protocol Analysis
Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes
Operational Nominal Game Semantics
Foundations of Software Science and Computation Structures - 16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings
Verified Bytecode Verifiers
Interacting Bialgebras Are Frobenius
Complexity Results on Balanced Context-Free Languages
Generalized Synchronization Trees
Secrecy Types for Asymmetric Communication
Untyped Recursion Schemes and Infinite Intersection Types
Fragments of ML Decidable by Nested Data Class Memory Automata
Generalised Regular MSC Languages
Computing Quantiles in Markov Reward Models
Querying UML Class Diagrams
Logical Predicates in Higher-Order Mathematical Operational Semantics
Hierarchical Graph Transformation
Smooth Orchestrators
Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete
An Auxiliary Logic on Trees: on the Tower-Hardness of Logics Featuring Reachability and Submodel Reasoning
Stochastic Games with Lossy Channels
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
Symbolically Quantifying Response Time in Stochastic Models Using Moments and Semirings
Pattern Graphs and Rule-Based Models: The Semantics of Kappa
Structural Operational Semantics for Stochastic Process Calculi
Register Allocation After Classical SSA Elimination is NP-Complete
Computational Completeness of Programming Languages Based on Graph Transformation
A Distribution Law for CCS and a New Congruence Result for the pi -Calculus
Exponential Automatic Amortized Resource Analysis
Model and Program Repair via Group Actions
On the Existential Arithmetics with Addition and Bitwise Minimum
Types and Effects for Resource Usage Analysis
A Framework for Parameterized Monitorability
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP
Monoidal Extended Stone Duality
Electoral Systems in Ambient Calculi
HTML Validation of Context-Free Languages
A Hierarchy for Delimited Continuations in Call-by-Name
A Logical Framework with Higher-Order Rational (Circular) Terms
Foundations of Software Science and Computation Structures - 28th International Conference, FoSSaCS 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Hamilton, ON, Canada, May 3-8, 2025, Proceedings
Limit Synchronization in Markov Decision Processes
A Diagrammatic Algebra for Program Logics
The Rho Cube
Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types
Distance Desert Automata and the Star Height One Problem
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory
Interrupt Timed Automata
Guarded Traced Categories
Combining quantum and classical control: syntax, semantics and adequacy
Shortest Paths in One-Counter Systems
Well-Pointed Coalgebras (Extended Abstract)
Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002, Proceedings
Robust Equilibria in Mean-Payoff Games
Programming and Reasoning with Guarded Recursion for Coinductive Types
The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard
Strategies as Profunctors
An Axiomatic Semantics for the Synchronous Language Gentzen
Interpolation and Amalgamation for Arrays with MaxDiff
Nominal Automata with Name Binding
Robust Analysis of Timed Automata via Channel Machines
States of Convex Sets
On the cut-elimination of the modal μ-calculus: Linear Logic to the rescue
Ordinal Theory for Expressiveness of Well Structured Transition Systems
Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I
Semantic Barbs and Biorthogonality
Verifying Performance Equivalence for Timed Basic Parallel Processes
Denotational Semantics of Hybrid Automata
Verification of Probabilistic Systems with Faulty Communication
History-Register Automata
Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings
Algebra, Coalgebra, and Minimization in Polynomial Differential Equations
Efficient Type Matching
Freshness and Name-Restriction in Sets of Traces with Names
Constructive Data Refinement in Typed Lambda Calculus
Analysis of a Guard Condition in Type Theory (Extended Abstract)
Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling
A Lambda-Free Higher-Order Recursive Path Order
Simulation Hemi-metrics between Infinite-State Stochastic Games
String Languages Generated by Total Deterministic Macro Tree Transducers
A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy
Equational Axiomatization of Algebras with Structure
The WHILE Hierarchy of Program Schemes Is Infinite
Compositional Metric Reasoning with Probabilistic Process Calculi
Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts
A Completeness Result for Finite λ-bisimulations
Typing Local Definitions and Conditional Expressions with Rank 2 Intersection
Varieties of Effects
Cyclic Arithmetic Is Equivalent to Peano Arithmetic
On Rational Graphs
Fixed-Point Elimination in the Intuitionistic Propositional Calculus
The Implicit Calculus of Constructions as a Programming Language with Dependent Types
Analysis of Probabilistic Basic Parallel Processes
Brookes Is Relaxed, Almost!
Justness - A Completeness Criterion for Capturing Liveness Properties (Extended Abstract)
Abstraction in Reasoning about Higraph-Based Systems
Continuous Reachability for Unordered Data Petri Nets is in PTime
Foundations of Software Science and Computation Structures, Third International Conference, FOSSACS 2000, Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
Fair Quantitative Games
First-order separation over countable ordinals
Parity Games of Bounded Tree- and Clique-Width
On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus
Latticed-LTL Synthesis in the Presence of Noisy Inputs
The Complexity of Live Sequence Charts
Three Variables Suffice for Real-Time Logic
Foundations of Software Science and Computation Structure, Second International Conference, FoSSaCS'99, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999, Proceedings
Dimension-Minimality and Primality of Counter Nets
Decomposing Probabilistic Lambda-Calculi
Delayed Nondeterminism in Continuous-Time Markov Decision Processes
A Theory of "May" Testing for Asynchronous Languages
On the Confluence of lambda -Calculus with Conditional Rewriting
Two-Way Parikh Automata with a Visibly Pushdown Stack
Causal Inference by String Diagram Surgery
On Model Checking Durational Kripke Structures
Foundations for Decision Problems in Separation Logic with General Inductive Predicates
Reachability of Communicating Timed Processes
Probabilistic Modal μ -Calculus with Independent Product
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes
Graded Algebraic Theories
The Complexity of CTL* + Linear Past
Coalgebraic Correspondence Theory
Partiality, Revisited - The Partiality Monad as a Quotient Inductive-Inductive Type
Distributed Unfolding of Petri Nets
Verification for Java's Reentrant Multithreading Concept
The Impatient May Use Limited Optimism to Minimize Regret
Automated Constructivization of Proofs
Complexity of Decision Problems for Mixed and Modal Specifications
Regularity and Context-Freeness over Word Rewriting Systems
Categories of Processes Enriched in Final Coalgebras
On Well-Founded and Recursive Coalgebras
Deriving Labels and Bisimilarity for Concurrent Constraint Programming
Languages Ordered by the Subword Order
Partial Correctness Assertions Provable in Dynamic Logics
Model Checking Is Static Analysis of Modal Logic
Prevision Domains and Convex Powercones
Robust Multidimensional Mean-Payoff Games are Undecidable
Justifying Algorithms for beta - eta -Conversion
Processes for Adhesive Rewriting Systems
Sequent Calculus in the Topos of Trees
Verifying Higher-Order Functions with Tree Automata
The Cyclic-Routing UAV Problem is PSPACE-Complete
On the Expressiveness of Büchi Arithmetic
A Monadic Multi-stage Metalanguage
Full Abstraction for Reduced ML
Type Inference for First-Order Logic
Active Diagnosis for Probabilistic Systems
Sharing and Linear Logic with Restricted Access
Co-Büching Them All
On Presburger Arithmetic Extended with Modulo Counting Quantifiers
A Modal Deconstruction of Access Control Logics
Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics
RPO, Second-Order Contexts, and lambda-Calculus
Polynomials for Proving Termination of Context-Sensitive Rewriting
Symbolic Solution of Emerson-Lei Games for Reactive Synthesis
Logics for Bisimulation and Divergence
Models of a Non-associative Composition
First-Order and Counting Theories of omega -Automatic Structures
Model Checking Languages of Data Words
Reasoning About Call-by-need by Means of Types
Quantitative Robustness Analysis of Flat Timed Automata
Beyond Shapes: Lists with Ordered Data
A Higher-Order Simulation Relation for System F
A Duality Theoretic View on Limits of Finite Structures
Categorical composable cryptography
History-Based Access Control with Local Policies
The Spirit of Node Replication
On the Complexity of the Equivalence Problem for Probabilistic Automata
A Sound and Complete Logic for Algebraic Effects
A Programming Language Characterizing Quantum Polynomial Time
On Monadic Parametricity of Second-Order Functionals
The Finite Graph Problem for Two-Way Alternating Automata
Choice in Dynamic Linking
Spinal Atomic Lambda-Calculus
Testing Hennessy-Milner Logic with Recursion
Counting and Equality Constraints for Multitree Automata
Coalgebraic Logic and Synthesis of Mealy Machines
Sweedler Theory of Monads
Fitch-Style Modal Lambda Calculi
Nondeterministic Syntactic Complexity
Distributed Synthesis in Continuous Time
Learning Pomset Automata
A Coalgebraic View of Bar Recursion and Bar Induction
Presenting Functors by Operations and Equations
Model-Checking One-Clock Priced Timed Automata
Dependency Tree Automata
Complete Test Suites for Automata in Monoidal Closed Categories
A Kleene Theorem for Polynomial Coalgebras
Reachability in Fixed VASS: Expressiveness and Lower Bounds
A Coalgebraic Approach to Linear-Time Logics
Change Actions: Models of Generalised Differentiation
On Freeze LTL with Ordered Attributes
A pi-calculus Process Semantics of Concurrent Idealised ALGOL
Bridging Language-Based and Process Calculi Security
Minimizing Deterministic Lattice Automata
Angelic Semantics of Fine-Grained Concurrency
Foundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees
On Omega-Languages Defined by Mean-Payoff Conditions
Coherence Spaces and Uniform Continuity
Ackermannian Completion of Separators
The Microcosm Principle and Concurrency in Coalgebra
Monads Need Not Be Endofunctors
Counting CTL
Fair ω-Regular Games
Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings
A Game Semantics of Local Names and Good Variables
Unboundedness Problems for Machines with Reversal-Bounded Counters
Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs
Canonical Models for Computational Effects
Reasoning about Dynamic Policies
Iterator Types
On Term Rewriting Systems Having a Rational Derivation
Knowledge = Observation + Memory + Computation
Unifying Hyper and Epistemic Temporal Logics
Optimal Conditional Reachability for Multi-priced Timed Automata
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
Model Checking for Nominal Calculi
The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford
The omega-Regular Post Embedding Problem
Congruence for Structural Congruences
Partial and Conditional Expectations in Markov Decision Processes with Integer Weights
Deciding Contextual Equivalence of ν-Calculus with Effectful Contexts
Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness
Foundations of Software Science and Computation Structures - 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings
Reachability Analysis of Communicating Pushdown Systems
On Synchronous and Asynchronous Mobile Processes
Unary Resolution: Characterizing Ptime
A Kleene-Schützenberger Theorem for Weighted Timed Automata
MARRELLA and the Verification of an Embedded System
Specifying and Verifying Partial Order Properties Using Template MSCs
Guessing Attacks and the Computational Soundness of Static Equivalence
A Program Refinement Framework Supporting Reasoning about Knowledge and Time
On the Expressive Power of Restriction and Priorities in CCS with Replication
Complete and tractable machine-independent characterizations of second-order polytime
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Probabilistic Congruence for Semistochastic Generative Processes
Timed Negotiations
Leafy automata for higher-order concurrency
Partial Metrics and Co-continuous Valuations
Comodels and Effects in Mathematical Operational Semantics
Functions as Session-Typed Processes
A Higher-Order Language for Markov Kernels and Linear Operators
Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives
Cut Elimination in Nested Sequents for Intuitionistic Modal Logics
Craig Interpolation for Decidable First-Order Fragments
Matching Specifications for Message Sequence Charts
Weighted and Branching Bisimilarities from Generalized Open Maps
On Metric Temporal Logic and Faulty Turing Machines
Foundations of Software Science and Computational Structures - 14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings
Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism
Parameterized Analysis of Reconfigurable Broadcast Networks
An Algebraic Characterization of Typability in ML with Subtyping
Foundations of Software Science and Computational Structures, 8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings
Cones and Foci for Protocol Verification Revisited
Reactive Systems, Barbed Semantics, and the Mobile Ambients
Trace Refinement in Labelled Markov Decision Processes
Type Inference with Recursive Type Equations
Completeness for Algebraic Theories of Local State
Bisimulation for Demonic Schedulers
On Decidability Within the Arithmetic of Addition and Divisibility