Conferences · eligible papers
POPL
2022–2026 LIVE
Programming Languages & Formal Methods
2022 · 65 papers
このEditionに反映済みのmain full research papersのみ掲載しています。著者リンクは日本の大学への著者別所属根拠がある場合に限ります。
- A Quantum interpretation of separating conjunction for local reasoning of Quantum programs based on separation logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A cost-aware logical framework
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A dual number abstraction for static analysis of Clarke Jacobians
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A fine-grained computational interpretation of Girard’s intuitionistic proof-nets
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A formal foundation for symbolic evaluation with merging
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A relational theory of effects and coeffects
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A separation logic for heap space under garbage collection
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A separation logic for negative dependence
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Bottom-up synthesis of recursive functional programs using angelic execution
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Certifying derivation of state machines from coroutines
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Concurrent incorrectness separation logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Connectivity graphs: a method for proving deadlock freedom based on separation logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Context-bounded verification of thread pools
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Dependently-typed data plane programming
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Effectful program distancing
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Efficient algorithms for dynamic bidirected Dyck-reachability
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Extending Intel-x86 consistency and persistency: formalising the semantics of Intel-x86 memory types and non-temporal stores
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Fair termination of binary sessions
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Formal metatheory of second-order abstract syntax
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- From enhanced coinduction towards enhanced induction
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Fully abstract models for effectful λ-calculi via category-theoretic logical relations
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Induction duality: primal-dual search for invariants
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Interval universal approximation for neural networks
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Isolation without taxation: near-zero-cost transitions for WebAssembly and SFI
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Layered and object-based game semantics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Learning formulas in finite variable logics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Linked visualisations via Galois dependencies
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Logarithm and program testing
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Mœbius: metaprogramming using contextual types: the stage where system f can pattern match on itself
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Oblivious algebraic data types
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Observational equality: now for good
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On incorrectness logic and Kleene algebra with top and tests
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On type-cases, union elimination, and occurrence typing
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- One polynomial approximation to produce correctly rounded results of an elementary function for multiple representations and rounding modes
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- PRIMA: general and precise neural network certification via scalable convex hull approximations
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Partial (In)Completeness in abstract interpretation: limiting the imprecision in program analysis
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Pirouette: higher-order typed functional choreographies
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Profile inference revisited
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Property-directed reachability as abstract interpretation in the monotone theory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Quantum information effects
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Reasoning about “reasoning about reasoning”: semantics and contextual equivalence for probabilistic programs with nested queries and recursion
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Relational e-matching
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Return of CFA: call-site sensitivity can be superior to object sensitivity even for object-oriented programs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Safe, modular packet pipeline programming
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Semantics for variational Quantum programming
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Simuliris: a separation logic framework for verifying concurrent program optimizations
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Software model-checking as cyclic-proof search
- SolType: refinement types for arithmetic overflow in solidity
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Solving constrained Horn clauses modulo algebraic data types and recursive functions
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Solving string constraints with Regex-dependent functions through transducers with priorities and variables
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Staging with class: a specification for typed template Haskell
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Static prediction of parallel computation graphs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Subcubic certificates for CFL reachability
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Symmetries in reversible programming: from symmetric rig groupoids to reversible programming languages
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The decidability and complexity of interleaved bidirected Dyck reachability
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Truly stateless, optimal dynamic partial order reduction
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Twist: sound reasoning for purity and entanglement in Quantum programs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Type-level programming with match types
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- VIP: verifying real-world C idioms with integer-pointer casts
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Verified compilation of C programs with a nominal memory model
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Verified tensor-program optimization via high-level scheduling rewrites
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Visibility reasoning for concurrent snapshot algorithms
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- What’s decidable about linear loops?
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)