SAS 2025
16 papers
- A Programming Language for Feasible Solutions
- AURA: Precise Abstract Interpretation of Probabilistic Programs with Interval Data Uncertainty
- Abstracting Concolic Execution for Soft Contract Verification
- Automated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic Data Types
- Bounded-Exhaustive Subspace Diversification for SMT Solver Testing
- Comparing the Precision of Abstract Operators in the eBPF Verifier Using Differential Synthesis
- Contextual Equality Saturation
- Delta Store Semantics: Abstract Garbage Collection for Abstract Definitional Interpreters
- Ductape: Optimizing Dynamically Typed Programs Using Ahead-of-Time Compilation and Data-Flow Analysis
- Enhancing Neural Network Robustness via Synthesis of Repair Programs
- Formal Analysis of Networked PLC Controllers Interacting with Physical Environments
- Monarch: A Modular Framework for Abstract Definitional Interpreters in Haskell
- On a Simple Problem Due to Yves Bertot
- Relating Distances and Abstractions - An Abstract Interpretation Perspective
- Specifying and Verifying Future Conditions
- Verifying Neural Networks with PyRAT