yusuke1997/dblp-id-title huggingface dataset:
The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages
A General Semantic Construction of Dependent Refinement Type Systems, Categorically
Footprints in Local Reasoning
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
Logical Reasoning for Higher-Order Functions with Local State
Fixpoint Theory - Upside Down
On Decision Problems for Probabilistic Büchi Automata
A first-order logic characterisation of safety and co-safety languages
Probabilistic Asynchronous pi-Calculus
Reversing Algebraic Process Calculi
Companions, Codensity and Causality
Bicategories of Concurrent Games - (Invited Paper)
Irrelevance in Type Theory with a Heterogeneous Equality Judgement
The Calculus of Handshake Configurations
Coalgebraic Hybrid Logic
On History-Deterministic One-Counter Nets
On Asymmetric Unification and the Combination Problem in Disjoint Theories
Decidable and Expressive Classes of Probabilistic Automata
On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability
Minimal Coverability Tree Construction Made Complete and Efficient
Foundations of Software Science and Computation Structures - 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings
Network-Formation Games with Regular Objectives
From Symmetric Pattern-Matching to Quantum Control
Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings
Game Semantics for Bounded Polymorphism
Realizability Interpretation and Normalization of Typed Call-by-Need \lambda -calculus with Control
Verification of Cryptographic Protocols: Tagging Enforces Termination
Sequential and Concurrent Abstract Machines for Interaction Nets
Extending ${\cal H}_1$ -Clauses with Path Disequalities
Optimal Satisfiability Checking for Arithmetic \mu -Calculi
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations
Facets of Synthesis: Revisiting Church's Problem
Perfect-Information Stochastic Mean-Payoff Parity Games
Modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy
Introduction to Decidability of Higher-Order Matching
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
Narcissists Are Easy, Stepmothers Are Hard
Higher-Order Distributions for Differential Linear Logic
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
Coalgebraic Walks, in Quantum and Turing Computation
A Cook's Tour of Equational Axiomatizations for Prefix Iteration
What Do Reversible Programs Compute?
From Rewrite Rules to Axioms in the $\lambda \varPi $-Calculus Modulo Theory
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
On the Relative Expressive Power of Asynchronous Communication Primitives
Partiality and Recursion in Higher-Order Logic
Light Genericity
Proof Nets and Explicit Substitutions
Model Checking Fixed Point Logic with Chop
Strong Bisimulation for the Explicit Fusion Calculus
Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings
Variable binding and substitution for (nameless) dummies
Tighter Bounds for the Determinisation of Büchi Automata
Two-sorted algebraic decompositions of Brookes's shared-state denotational semantics
Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings
Complementation of Emerson-Lei Automata
Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems
A Theory for Observational Fault Tolerance
Determinization of Integral Discounted-Sum Automata is Decidable
On Word Rewriting Systems Having a Rational Derivation
Simple Stochastic Games with Few Random Vertices Are Easy to Solve
Alternating Timed Automata
Strong Normalization of lambda-mu-mu/tilde-Calculus with Explicit Substitutions
Modular Tableaux Calculi for Separation Theories
Coverability in 2-VASS with One Unary Counter is in NP
From Qualitative to Quantitative Semantics - By Change of Base
Tighter Construction of Tight Büchi Automata
A Strict Constrained Superposition Calculus for Graphs
A Game Semantics for Generic Polymorphism
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
"Most of" leads to undecidability: Failure of adding frequencies to LTL
Equational Theories of Abnormal Termination Based on Kleene Algebra
A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
Predicate Logic and Tree Automata with Tests
Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata
Erasure and Polymorphism in Pure Type Systems
Automata for True Concurrency Properties
Coverability Trees for Petri Nets with Unordered Data
Running Time Analysis of Broadcast Consensus Protocols
Idempotent Resources in Separation Logic - The Heart of core in Iris
Foundations of Software Science and Computation Structure, First International Conference, FoSSaCS'98, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings
Work-sensitive Dynamic Complexity of Formal Languages
Temporary Data in Shared Dataspace Coordination Languages
Structural Liveness of Conservative Petri Nets
Subgame Perfection for Equilibria in Quantitative Reachability Games
Weighted Specifications over Nested Words
A First-Order One-Pass CPS Transformation
Temporal Hyperproperties for Population Protocols
Unfolding and Event Structure Semantics for Graph Grammars
A Curry-style Semantics of Interaction: From Untyped to Second-Order Lazy λ μ-Calculus
Game Semantics for Nominal Exceptions
Verification of Parameterized Communicating Automata via Split-Width
The Invariance Problem for Matrix Semigroups
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
An Algebraic Presentation of Predicate Logic - (Extended Abstract)
On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations
On the Completeness of Dynamic Logic
Duality for Logics of Transition Systems
Comparator Automata in Quantitative Verification
Categorical Models for Intuitionistic and Linear Type Theory
Metric Temporal Logic with Counting
Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus
On the Dependencies of Logical Rules
Tree Automata with Memory, Visibility and Structural Constraints
The Effects of Adding Reachability Predicates in Propositional Separation Logic
Model-Checking omega-Regular Properties of Interval Markov Chains
Deriving Bisimulation Congruences for Conditional Reactive Systems
Probabilistic Temporal Logics via the Modal Mu-Calculus
Net Refinement by Pullback Rewriting
On Nominal Regular Languages with Binders
Certifying Inexpressibility
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Reasoning About Concurrent Systems Using Types
A Calculus of Circular Proofs and Its Categorical Semantics
A Double Category Theoretic Analysis of Graded Linear Exponential Comonads
Dynamic Policy Discovery with Remote Attestation
Reverse Bisimilarity vs. Forward Bisimilarity
Neural Flocking: MPC-Based Supervised Learning of Flocking Controllers
The Equational Theory of the Natural Join and Inner Union is Decidable
Clones, closed categories, and combinatory logic
Degree of Sequentiality of Weighted Automata
Minimisation of Multiplicity Tree Automata
On Garbage and Program Logic
Heterogeneous Development Graphs and Heterogeneous Borrowing
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
Join Inverse Categories as Models of Reversible Recursion
Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings
The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes
Stochastic Transition Systems for Continuous State Spaces and Non-determinism
Generalized Parity Games
Depending on Session-Typed Processes
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Type Isomorphisms and Proof Reuse in Dependent Type Theory
Enriched µ-Calculi Module Checking
DyNetKAT: An Algebra of Dynamic Networks
Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence
WQO Dichotomy for 3-Graphs
Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules
Model Checking Durational Probabilistic Systems
Identifiers in Registers - Describing Network Algorithms with Logic
On the Duality between Observability and Reachability
The Different Shades of Infinite Session Types
Sampled Universality of Timed Automata
A Complete Normal-Form Bisimilarity for State
Pebble minimization: the last theorems
Game Semantics and Normalization by Evaluation
Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics
Type-Based Complexity Analysis for Fork Processes
On the Translation of Automata to Linear Temporal Logic
Conflict Detection and Resolution in Access Control Policy Specifications
Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation
Parameterised Multiparty Session Types
Normal Bisimulations in Calculi with Passivation
Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables
Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems
On Piecewise Testable, Starfree, and Recognizable Picture Languages
Systems of Equations Satisfied in All Commutative Finite Semigroups
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms
Alternative Characterizations of Hereditary History-Preserving Bisimilarity via Backward Ready Multisets
Behavioral and Spatial Observations in a Logic for the pi-Calculus
On the Integration of Observability and Reachability Concepts
Parameterized Synthesis for Fragments of First-Order Logic Over Data Words
Type Assignment for Intersections and Unions in Call-by-Value Languages
Synthesis with Privacy Against an Observer
Fibrational Induction Meets Effects
On Distributability of Petri Nets - (Extended Abstract)
Partial Derivatives for Context-Free Languages - From \mu -Regular Expressions to Pushdown Automata
Fast Matching of Regular Patterns with Synchronizing Counting
Separation Logic for Non-local Control Flow and Block Scope Variables
Foundations of Software Science and Computation Structures, 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, Proceedings
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
A Strong Logic Programming View for Static Embedded Implications
A Description of Iterative Reflections of Monads (Extended Abstract)
The Complexity of Synchronous Notions of Information Flow Security
Deciding Definability by Deterministic Regular Expressions
Expressivity of Coalgebraic Modal Logic: The Limits and Beyond
Learning Weighted Automata over Principal Ideal Domains
The Complexity of Model Checking Mobile Ambients
Axioms for Recursion in Call-by-Value
Is It a "Good" Encoding of Mixed Choice?
Preservation and Reflection of Bisimilarity via Invertible Steps
Checking History-Determinism is NP-hard for Parity Automata
Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings
Subtyping and Typing Algorithms for Mobile Ambients
Higher-Order Pushdown Trees Are Easy
Foundations of Differential Dataflow
Kleene Algebra with Hypotheses
Bisimulation on Speed: Lower Time Bounds
Deciding Properties for Message Sequence Charts
Semantical Analysis of Contextual Types
On the Mints Hierarchy in First-Order Intuitionistic Logic
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games
On Unique Decomposition of Processes in the Applied π-Calculus
Foundations of Software Science and Computation Structures - 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings
A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications
Nominal Equational Problems
The Appearance of Big Integers in Exact Real Arithmetic Based on Linear Fractional Transformations
The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies
Equational Properties of Mobile Ambients
Applicative Bisimulations for Delimited-Control Operators
On the Existence of an Effective and Complete Inference System for Cryptographic Protocols
Dependent Types and Fibred Computational Effects
Logics and Bisimulation Games for Concurrency, Causality and Conflict
Adequacy for Algebraic Effects
Branching-Time Model Checking of Parametric One-Counter Automata
Modular Bisimulation Theory for Computations and Values
Polynomial Constraints for Sets with Cardinality Bounds
A Light Modality for Recursion
Quantifier Elimination and Craig Interpolation: The Quantitative Way
Minimization of Graph Weighted Models over Circular Strings
Deep Induction: Induction Rules for (Truly) Nested Types
Guarded Dependent Type Theory with Coinductive Types
The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction
An Easy Completeness Proof for the Modal µ -Calculus on Finite Trees
BiGKAT: An Algebraic Framework for Relational Verification of Probabilistic Programs
Full Abstraction for Polymorphic Pi-Calculus
A Semantic Foundation for Hidden State
The State Explosion Problem from Trace to Bisimulation Equivalence
A Trace-Based View on Operating Guidelines
Component Refinement and CSC Solving for STG Decomposition
Generalizing Domain Theory
Class Analysis of Object-Oriented Programs through Abstract Interpretation
Quantitative Safety and Liveness
The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains
A Finite Model Construction for Coalgebraic Modal Logic
One-way Resynchronizability of Word Transducers
Cartesian Difference Categories
Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
Equational Theories and Monads from Polynomial Cayley Representations
Optimal Reachability in Divergent Weighted Timed Games
Uniform Guarded Fragments
Locality and Polyadicity in Asynchronous Name-Passing Calculi
Generalized Bounded Linear Logic and its Categorical Semantics
A Computational Model for Multi-variable Differential Calculus
On Basic Feasible Functionals and the Interpretation Method
Enriching Diagrams with Algebraic Operations
On Compositional Reasoning in the Spi-calculus
Decidability of Freshness, Undecidability of Revelation
A Game Approach to Determinize Timed Automata
What Else Is Decidable about Integer Arrays?
Estimation of the Length of Interactions in Arena Game Semantics
Multi-level Meta-reasoning with Higher-Order Abstract Syntax
Bigraphical Models of Context-Aware Systems
Similarity Quotients as Final Coalgebras
Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
The Rewriting Calculus as a Combinatory Reduction System
On the Modularity of Deciding Call-by-Need
Functor Categories and Two-Level Languages
Order-Sorted Rewriting and Congruence Closure
Comprehensive Parametric Polymorphism: Categorical Models and Type Theory
A Semantical and Operational Account of Call-by-Value Solvability
Parametricity for Primitive Nested Types
Foundations of Software Science and Computation Structures - 18th International Conference, FoSSaCS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings
The Computational Contents of Ramified Corecurrence
A Quantified Coalgebraic van Benthem Theorem
Complexity of Strongly Normalising λ -Terms via Non-idempotent Intersection Types
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Concurrency, sigma-Algebras, and Probabilistic Fairness
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
Preorders on Monads and Coalgebraic Simulations
Church Synthesis Problem for Noisy Input
Dynamic Complexity of the Dyck Reachability
Concurrent Games with Ordered Objectives
Quantifier Alternation for Infinite Words
Foundations of Software Science and Computational Structures, 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings
Towards a Structural Proof Theory of Probabilistic \mu -Calculi
On the Semantics of Intensionality
Fault Diagnosis Using Timed Automata
A Semantic Approach to Interpolation
Symbolic Semantics Revisited
On Recognizable Stable Trace Languages
Resource-Tracking Concurrent Games
Causality in Linear Logic - Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment)
Resource Reachability Games on Pushdown Graphs
Logics Admitting Final Semantics
Classical System of Martin-Löf's Inductive Definitions Is Not Equivalent to Cyclic Proof System
On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context
Linearly-Used Continuations in the Enriched Effect Calculus
On the Comparison of Discounted-Sum Automata with Multiple Discount Factors
Deterministic Rational Transducers and Random Sequences
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable
Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators
Model Checking Lossy Channels Systems Is Probably Decidable
Focused Proof-search in the Logic of Bunched Implications
Synchronous Game Semantics via Round Abstraction
Third-Order Idealized Algol with Iteration Is Decidable
An Operational Characterization of Strong Normalization
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
On the Relationship between Spatial Logics and Behavioral Simulations
Generalised Name Abstraction for Nominal Sets
A Game Semantics of Linearly Used Continuations
Checking Bisimilarity for Attributed Graph Transformation
An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic
On the µ -Calculus Augmented with Sabotage
Graphical Piecewise-Linear Algebra
A Syntactic View of Computational Adequacy
A Theory of Slicing for Probabilistic Control Flow Graphs
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
Cryptographic Protocol Composition via the Authentication Tests
Pointless Learning
Token Games and History-Deterministic Quantitative Automata
On probability-raising causality in Markov decision processes
A Behavioural Pseudometric for Continuous-Time Markov Processes
Formalising the pi -Calculus Using Nominal Logic
A Theory of Monitors - (Extended Abstract)
On Higher-Order Probabilistic Subrecursion
A String Diagrammatic Axiomatisation of Finite-State Automata
Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains
A Truly Concurrent Game Model of the Asynchronous \pi -Calculus
Composition and Decomposition in True-Concurrency
Classes of Tree Homomorphisms with Decidable Preservation of Regularity
Constructing Inductive-Inductive Types in Cubical Type Theory
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions
From Separation Logic to First-Order Logic
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages
Polymorphic Abstract Syntax via Grothendieck Construction
Norm Functions for Probabilistic Bisimulations with Delays
Theories for the Global Ubiquitous Computer
On Recognizable Timed Languages
When Ambients Cannot Be Opened
A new criterion for M , N -adhesivity, with an application to hierarchical graphs
Typing Weak MSOL Properties
On the Complexity of Parity Word Automata
Fair Refinement for Asynchronous Session Types
Separators in Continuous Petri Nets
Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings
Free-Algebra Models for the pi -Calculus
Linearity and Bisimulation
A Hierarchy of Scheduler Classes for Stochastic Automata
A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)
Combining Bialgebraic Semantics and Equations
A Semantic Basis for Local Reasoning
When Is a Type Refinement an Inductive Type?
Fab ous Interoperability for ML and a Linear Language
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi
Optimal Strategy Synthesis in Stochastic Müller Games
On the Complexity of Computing Probabilistic Bisimilarity
First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time
Trees in Partial Higher Dimensional Automata
Expanding the Cube
LogGAN: A Sequence-Based Generative Adversarial Network for Anomaly Detection Based on System Logs
Passive User Authentication Utilizing Consecutive Touch Action Features for IIoT Systems
Exhaustive Exploratory Analysis of Low Degree Maximum Period NLFSRs By Graph Analysis
Spear Phishing Email Detection with Multiple Reputation Features and Sample Enhancement
Multiplex PageRank in Multilayer Networks Considering Shunt
Scalable M+1st-Price Auction with Infinite Bidding Price
An Event-Based Parameter Switching Method for Controlling Cybersecurity Dynamics
VaultBox: Enhancing the Security and Effectiveness of Security Analytics
Protecting Data Privacy in Federated Learning Combining Differential Privacy and Weak Encryption
DWT-DQFT-Based Color Image Blind Watermark with QR Decomposition
Botnet Detection Based on Multilateral Attribute Graph
LogSHIELD: A Graph-Based Real-Time Anomaly Detection Framework Using Frequency Analysis
HINCDG: Multi-Meta-Path Graph Auto-Encoders for Mining of Weak Association Malicious Domains
Performance Evaluation of Lightweight Cryptographic Ciphers on ARM Processor for IoT Deployments
An Enhanced Firewall for IoT Security
MCVDSSE: Secure Multi-client Verifiable Dynamic Symmetric Searchable Encryption
Malware Classification Based on Semi-Supervised Learning
Automated Ransomware Behavior Analysis: Pattern Extraction and Early Detection
New Robustness Measures of Communication Networks Against Virus Attacks
Implementation of the Elliptic Curve Method
Density Peak Clustering Algorithm Based on Differential Privacy Preserving
Science of Cyber Security - 6th International Conference, SciSec 2024, Copenhagen, Denmark, August 14-16, 2024, Proceedings
Malware Detection Using Automated Generation of Yara Rules on Dynamic Features
Science of Cyber Security - 4th International Conference, SciSec 2022, Matsue, Japan, August 10-12, 2022, Revised Selected Papers
Influence of Clustering on Network Robustness Against Epidemic Propagation
Science of Cyber Security - Third International Conference, SciSec 2021, Virtual Event, August 13-15, 2021, Revised Selected Papers
Decompilation Based Deep Binary-Source Function Matching
SVFL: Secure Vertical Federated Learning on Linear Models
TraceDroid: A Robust Network Traffic Analysis Framework for Privacy Leakage in Android Apps
SeeStar: An Efficient Starlink Asset Detection Framework
A New Pairing-Free Certificateless Signature Scheme for Internet of Things