SAS 2018
25 papers
- A Reduced Product of Absolute and Relative Error Bounds for Floating-Point Analysis
- Abstract Interpretation of CTL Properties
- Abstract Interpretation of Stateful Networks
- An Efficient Abstract Domain for Not Necessarily Closed Polyhedra
- Block-Size Independence for GPU Programs
- Closing the Performance Gap Between Doubles and Rationals for Octagons
- Deductive Verification in Decidable Fragments with Ivy
- Efficiently Learning Safety Proofs from Appearance as well as Behaviours
- Experience Developing and Deploying Concurrency Analysis at Facebook
- Extending Constraint-Only Representation of Polyhedra with Boolean Constraints
- Fairness: A Formal-Methods Perspective
- Incremental Verification Using Trace Abstraction
- Inductive Termination Proofs with Transition Invariants and Their Relationship to the Size-Change Abstraction
- Interactive Verification of Distributed Protocols Using Decidable Logic
- Invertible Linear Transforms of Numerical Abstract Domains
- Modular Software Fault Isolation as Abstract Interpretation
- Modular Static Analysis of String Manipulations in C Programs
- New Applications of Software Synthesis: Verification of Configuration Files and Firewall Repair
- Numerical Invariants via Abstract Machines
- Process-Local Static Analysis of Synchronous Processes
- The Impact of Program Transformations on Static Program Analysis
- The MISRA C Coding Standard and its Role in the Development and Analysis of Safety- and Security-Critical Embedded Software
- Verifying Bounded Subset-Closed Hyperproperties
- Verifying Properties of Differentiable Programs
- Volume-Based Merge Heuristics for Disjunctive Numeric Domains