APLAS 2020
19 papers
- A Counterexample-Guided Debugger for Non-recursive Datalog
- A New Refinement Type System for Automated $\nu \text {HFL}_\mathbb {Z}$ Validity Checking
- A Set-Based Context Model for Program Analysis
- A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving
- Algebraic and Coalgebraic Perspectives on Interaction Laws
- An Abstract Machine for Strong Call by Value
- Automatically Generating Descriptive Texts in Logging Statements: How Far Are We?
- Banyan: Coordination-Free Distributed Transactions over Mergeable Types
- Behavioural Types for Memory and Method Safety in a Core Object-Oriented Language
- Certified Semantics for Relational Programming
- Declarative Stream Runtime Verification (hLola)
- Formal Verification of Atomicity Requirements for Smart Contracts
- Neural Networks, Secure by Construction - An Exploration of Refinement Types
- P3: A Profiler Suite for Parallel Applications on the Java Virtual Machine
- Parameterized Synthesis with Safety Properties
- REFINITY to Model and Prove Program Transformation Rules
- Relational Synthesis for Pattern Matching
- Stack-Driven Program Generation of WebAssembly
- Syntactically Restricting Bounded Polymorphism for Decidable Subtyping