Conferences · eligible papers
LICS
2021–2025 確定版
Programming Languages & Formal Methods
2023 · 63 papers
このEditionに反映済みのmain full research papersのみ掲載しています。著者リンクは日本の大学への著者別所属根拠がある場合に限ります。
- A Complete Equational Theory for Quantum Circuits
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Higher-Order Indistinguishability Logic for Cryptographic Reasoning
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Metalanguage for Cost-Aware Denotational Semantics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A categorical account of composition methods in logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Allegories of Symbolic Manipulations
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Automatic Amortized Resource Analysis with Regular Recursive Types
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Boolean symmetric vs. functional PCSP dichotomy
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Cartesian Coherent Differential Categories
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Complete Graphical Language for Hermiticity-Preserving Superoperators
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Computational expressivity of (circular) proofs with fixed points
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Cut-Restriction: From Cuts to Analytic Cuts
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Deterministic stream-sampling for probabilistic programming: semantics and verification
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Distal Combinatorial Tools for Graphs of Bounded Twin-Width
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Embedded Finite Models beyond Restricted Quantifier Collapse
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Evidential Decision Theory via Partial Markov Categories
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations
Programming Languages & Formal Methods
日本大学: 東京科学大学
- Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Extensional and Non-extensional Functions as Processes
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Fixed Point Logics on Hemimetric Spaces
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Fixpoint operators for 2-categorical structures
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Folding interpretations
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Formalizing π4(S3) ≅Z/2Z and Computing a Brunerie Number in Cubical Agda
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- From Thin Concurrent Games to Generalized Species of Structures
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Fully Abstract Normal Form Bisimulation for Call-by-Value PCF
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Group Separation Strikes Back
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Higher-Dimensional Subdiagram Matching
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Intuitionistic S4 is decidable
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Making Concurrency Functional
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Minimization of Dynamical Systems over Monoids
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Multiplicity Problems on Algebraic Series and Context-Free Grammars
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On Exact Sampling in the Two-Variable Fragment of First-Order Logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On the Growth Rates of Polyregular Functions
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Operational Algorithmic Game Semantics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Orbit-finite linear programming
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Pseudorandom Finite Models
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Quantifying Over Trees in Monadic Second-Order Logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Reachability in Injective Piecewise Affine Maps
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Revisiting Membership Problems in Subclasses of Rational Relations
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Semi-Simplicial Set Models for Distributed Knowledge
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Set-Theoretic and Type-Theoretic Ordinals Coincide
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Simulating Logspace-Recursion with Logarithmic Quantifier Depth
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Stochastic Best-Effort Strategies for Borel Goals
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Taylor Expansion as a Monad in Models of DiLL
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Cartesian Closed Bicategory of Thin Spans of Groupoids
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Descriptive Complexity of Graph Neural Networks
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Identity Problem in the special affine group of Z2
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Iteration Number of the Weisfeiler-Leman Algorithm
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Logic of Prefixes and Suffixes is Elementary under Homogeneity*
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Power of Positivity
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Probabilistic Rabin Tree Theorem*
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Verifying linear temporal specifications of constant-rate multi-mode systems
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Weak Similarity in Higher-Order Mathematical Operational Semantics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- ℤ-polyregular functions
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)