Conferences · eligible papers
POPL
2021–2025 確定版
Programming Languages & Formal Methods
2021 · 61 papers
このEditionに反映済みのmain full research papersのみ掲載しています。著者リンクは日本の大学への著者別所属根拠がある場合に限ります。
- A computational interpretation of compact closed categories: reversible programming with negative and fractional types
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A graded dependent type system with a usage-aware semantics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A practical mode system for recursive definitions
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A pre-expectation calculus for probabilistic sensitivity
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A separation logic for effect handlers
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A unifying type-theory for higher-order (amortized) cost analysis
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A verified optimizer for Quantum circuits
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Abstracting gradual typing moving forward: precise and space-efficient
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- An abstract interpretation for SPMD divergence on reducible control flow graphs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- An approach to generate correctly rounded math libraries for new floating point variants
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Asynchronous effects
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Automata and fixpoints for asynchronous hyperproperties
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Automatic differentiation in PCF
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Automatically eliminating speculative leaks from cryptographic code with blade
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Combining the top-down propagation and bottom-up enumeration for inductive program synthesis
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Context-bounded verification of liveness properties for multithreaded shared-memory programs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Corpse reviver: sound and efficient gradual typing via contract verification
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Cyclic proofs, system t, and the power of contraction
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Data flow refinement type inference
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Deciding accuracy of differential privacy schemes
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Deciding reachability under persistent x86-TSO
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Deciding ω-regular properties on linear recurrence sequences
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Diamonds are not forever: liveness in reactive programming with guarded recursion
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Dijkstra monads forever: termination-sensitive specifications for interaction trees
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Distributed causal memory: modular specification and verification in higher-order distributed separation logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Efficient and provable local capability revocation using uninitialized capabilities
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Formally verified speculation and deoptimization in a JIT compiler
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Fully abstract from static to gradual
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Functorial semantics for partial theories
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Generating collection transformations from proofs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Giving semantics to program-counter labels via secure effects
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Intensional datatype refinement: with application to scalable verification of pattern-match safety
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Internalizing representation independence with univalence
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Intersection types and (positive) almost-sure termination
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Intrinsically typed compilation with nameless labels
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Learning the boundary of inductive invariants
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Mechanized logical relations for termination-insensitive noninterference
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Modeling and analyzing evaluation cost of CUDA kernels
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On algebraic abstractions for concurrent separation logics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On the complexity of bidirected interleaved Dyck-reachability
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On the semantic expressiveness of recursive types
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Optimal prediction of synchronization-preserving races
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Paradoxes of probabilistic programming: and how to condition on events of measure zero with infinitesimal probabilities
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- PerSeVerE: persistency semantics for verification under ext4
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Petr4: formal foundations for p4 data planes
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Precise subtyping for asynchronous multiparty sessions
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Probabilistic programming semantics for name generation
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Provably space-efficient parallel functional programming
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Semantics-guided synthesis
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Simplifying dependent reductions in the polyhedral model
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Taming x86-TSO persistency
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The (In)Efficiency of interaction
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The fine-grained and parallel complexity of andersen’s pointer analysis
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The taming of the rew: a type theory with computational assumptions
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Transfinite step-indexing for termination
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Verified code generation for the polyhedral model
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Verifying correct usage of context-free API protocols
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Verifying observational robustness against a c11-style memory model
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- egg: Fast and extensible equality saturation
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- 𝜆ₛ: computable semantics for differentiable programming with higher-order functions and datatypes
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)