Conferences · eligible papers
LICS
2021–2025 確定版
Programming Languages & Formal Methods
2022 · 63 papers
このEditionに反映済みのmain full research papersのみ掲載しています。著者リンクは日本の大学への著者別所属根拠がある場合に限ります。
- A Functorial Excursion Between Algebraic Geometry and Linear Logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Type Theory for Strictly Unital ∞-Categories
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A direct computational interpretation of second-order arithmetic via update recursion
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A first-order completeness result about characteristic Boolean algebras in classical realizability
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Active learning for sound negotiations✱
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Bouncing Threads for Circular and Non-Wellfounded Proofs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Choiceless Polynomial Time with Witnessed Symmetric Choice
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Complexity of Modular Circuits
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Computable PAC Learning of Continuous Features
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Computing the Density of the Positivity Set for Linear Recurrence Sequences
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Concrete categories and higher-order recursion
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Curry and Howard Meet Borel
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Cyclic Implicit Complexity
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Deciding Hyperproperties Combined with Functional Specifications
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Efficient Construction of Reversible Transducers from Regular Transducer Expressions
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Geometric decision procedures and the VC dimension of linear arithmetic theories
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Graded Monads and Behavioural Equivalence Games
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Identity Testing for Radical Expressions
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Linear-Algebraic Models of Linear Logic as Categories of Modules over Σ-Semirings✱
- Logical Foundations of Quantitative Equality
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Milner’s Proof System for Regular Expressions Modulo Bisimilarity is Complete
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Monoidal Streams for Dataflow Programming
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Normalization for Multimodal Type Theory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On the Satisfiability of Context-free String Constraints with Subword-Ordering
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On the Skolem Problem and the Skolem Conjecture
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Partitions and Ewens Distributions in element-free Probability Theory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Probabilistic Verification Beyond Context-Freeness
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Probability monads with submonads of deterministic states
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Quantum Expectation Transformers for Cost Analysis
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Reasonable Space for the λ-Calculus, Logarithmically
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Reasoning on Data Words over Numeric Domains
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Resource approximation for the λμ-calculus
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Semantics for two-dimensional type theory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Separating LREC from LFP
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Size measures and alphabetic equivalence in the μ-calculus
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Smooth approximations and CSPs over finitely bounded homogeneous structures
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Solvability of orbit-finite systems of linear equations
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Stable graphs of bounded twin-width
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Stochastic Games with Synchronizing Objectives
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Syllepsis in Homotopy Type Theory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Temporal Team Semantics Revisited
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Complexity of Bidirected Reachability in Valence Systems
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Pebble-Relation Comonad in Finite Model Theory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Regular Languages of First-Order Logic with One Alternation
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The amazing mixed polynomial closure and its applications to two-variable first-order logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The boundedness and zero isolation problems for weighted automata over nonnegative rationals
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The complexity of soundness in workflow nets
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Treelike Decompositions for Transductions of Sparse Graphs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Varieties of Quantitative Algebras and Their Monads
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- When Locality Meets Preservation
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Zigzag normalisation for associative n-categories
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)