| Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap
|
2020 |
Germane, the Kimball |
| Soundness Conditions for Big-Step Semantics
|
2020 |
Dagnino, Francesco |
| SMT-Friendly Formalization of the Solidity Memory Model
|
2020 |
Hajdu, Akos |
| Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems
|
2020 |
Krogh-Jespersen, Morten |
| Modular Inference of Linear Types for Multiplicity-Annotated Arrows
|
2020 |
Matsuda, Kazutaka |
| Mixed Sessions
|
2020 |
Vasconcelos, T. |
| Verifying Visibility-Based Weak Consistency
|
2020 |
Krishna, Siddharth |
| Continualization of Probabilistic Programs With Correction
|
2020 |
Laurel, Jacob |
| Connecting Higher-Order Separation Logic to a First-Order Outside World
|
2020 |
Mansky, William |
| ARMv8-A System Semantics: Instruction Fetch in Relaxed Architectures
|
2020 |
Simner, Ben |
| Trace-Relating Compiler Correctness and Secure Compilation
|
2020 |
Abate, Carmine |
| RustHorn: CHC-Based Verification for Rust Programs
|
2020 |
Matsushita, Yusuke |
| Proving the Safety of Highly-Available Distributed Objects
|
2020 |
Nair, Sreeja S. |
| Solving Program Sketches with Large Integer Values
|
2020 |
Pan, Rong |
| Modular Relaxed Dependencies in Weak Memory Concurrency
|
2020 |
Paviotti, Marco |
| On the Versatility of Open Logical Relations: Continuity, Automatic Differentiation, and a Containment Theorem
|
2020 |
Barthe, Gilles |
| Runners in Action
|
2020 |
Ahman, Danel |
| Constructive Game Logic
|
2020 |
Bohrer, Brandon |
| Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis
|
2020 |
Chatterjee, Krishnendu |
| Concise Read-Only Specifications for Better Synthesis of Programs with Pointers
|
2020 |
Costea, Andreea |
Tag hinzufügen