Conferences · eligible papers
LICS
2021–2025 確定版
Programming Languages & Formal Methods
2021 · 91 papers
このEditionに反映済みのmain full research papersのみ掲載しています。著者リンクは日本の大学への著者別所属根拠がある場合に限ります。
- A Bunched Logic for Conditional Independence
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Compositional Cost Model for the λ-calculus
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Constructive Logic with Classical Proofs and Refutations
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Logic for Locally Complete Abstract Interpretations
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Quantum Interpretation of Bunched Logic & Quantum Separation Logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Relational Theory of Monadic Rewriting Systems, Part I
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A distributed operational view of Reversible Prime Event Structures
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Alignment Completeness for Relational Hoare Logics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- An Algebraic Characterisation of First-Order Logic with Neighbour
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Asynchronous Extensions of HyperLTL
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Asynchronous Template Games and the Gray Tensor Product of 2-Categories
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Axiomatizations and Computability of Weighted Monadic Second-Order Logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Behavioural Preorders via Graded Monads
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Categorical models of Linear Logic with fixed points of formulas
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Categories of Nets
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Combinatorial Proofs and Decomposition Theorems for First-order Logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Commutative Monads for Probabilistic Programming Languages
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Comonadic semantics for guarded fragments
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Compositional Semantics for Probabilistic Programs with Exact Conditioning
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Compositional relational reasoning via operational game semantics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Constraint Satisfaction Problems over Finite Structures
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Continuous One-Counter Automata
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Evidenced Frames: A Unifying Framework Broadening Realizability Models
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation
Programming Languages & Formal Methods
日本大学: 総合研究大学院大学
- Finite Model Theory of the Triguarded Fragment and Related Logics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- First-Order Reasoning and Efficient Semi-Algebraic Proofs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Fixed-Points for Quantitative Equational Logics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Forbidden Induced Subgraphs and the Łoś–Tarski Theorem
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- From Multisets over Distributions to Distributions over Multisets
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Fusible numbers and Peano Arithmetic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Global Optimisation with Constructive Reals
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Higher Lenses
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Inapproximability of Unique Games in Fixed-Point Logic with Counting
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Internal ∞-Categorical Models of Dependent Type Theory : Towards 2LTT Eating HoTT
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Intersection Type Distributors
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Lovász-Type Theorems and Game Comonads
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Monomial size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Multi-Structural Games and Number of Quantifiers
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- No-Rainbow Problem and the Surjective Constraint Satisfaction Problem
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Normalization for Cubical Type Theory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On Generalized Metric Spaces for the Simply Typed Lambda-Calculus
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On Logics and Homomorphism Closure
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On sequentiality and well-bracketing in the π-calculus
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On the Expressive Power of Homomorphism Counts
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On the logical structure of choice and bar induction principles
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- PTAS for Sparse General-Valued CSPs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Parameterized Complexity of Elimination Distance to First-Order Logic Properties
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Parametricity and Semi-Cubical Types
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Parikh’s theorem for infinite alphabets
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Perspective Multi-Player Games
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Positive First-order Logic on Words
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Quantitative and Approximate Monitoring
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Responsibility and verification: Importance value in temporal logics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- SD-Regular Transducer Expressions for Aperiodic Transformations
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Separating Rank Logic from Polynomial Time
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Session Logical Relations for Noninterference
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Smart Choices and the Selection Monad
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Some constructive variants of S4 with the finite model property
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Stochastic Processes with Expected Stopping Time
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Strong Call-by-Value is Reasonable, Implosively
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Supermartingales, Ranking Functions and Probabilistic Lambda Calculus
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Symbolic Time and Space Tradeoffs for Probabilistic Verification
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Laplace Mechanism has optimal utility for differential privacy over continuous queries
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Smash Product of Monoidal Theories
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Space of Interaction
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Topological Mu-Calculus: completeness and decidability
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Undecidability of System F Typability and Type Checking for Reductionists
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Towards a more efficient approach for the satisfiability of two-variable logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Types Are Internal ∞-Groupoids
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Universal Semantics for the Stochastic λ-Calculus
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Universal Skolem Sets
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Verifying higher-order concurrency with data automata
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)