Creating Transformations for Matrix Obfuscation
Abstract elided by the publisher.
783 papers · page 19 of 40
Invariant Checking for Programs with Procedure Calls
Abstract elided by the publisher.
Abstract Interpretation of FIFO Replacement
Abstract elided by the publisher.
Bottom-Up Shape Analysis
Abstract elided by the publisher.
Refinement of Trace Abstraction
Abstract elided by the publisher.
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized and optimized program. To achieve this goal, we present new proof rules for generating proof trees and…
Type Analysis for JavaScript
Abstract elided by the publisher.
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
Abstract elided by the publisher.
Algorithmic Verification of Systems Software Using SMT Solvers
Abstract elided by the publisher.
Abstract Interpretation from a Topological Perspective
Abstract elided by the publisher.
Abstraction Refinement for Quantified Array Assertions
Abstract elided by the publisher.
Region Analysis for Race Detection
Abstract elided by the publisher.
Optimizing Pointer Analysis Using Bisimilarity
Abstract elided by the publisher.
The Complexity of Andersen's Analysis in Practice
Abstract elided by the publisher.
Inter-program Properties
Abstract elided by the publisher.
The Causal Graph Revisited for Directed Model Checking
Abstract elided by the publisher.
Inferring Dataflow Properties of User Defined Table Processors
Abstract elided by the publisher.
Polymorphic Fractional Capabilities
Abstract elided by the publisher.
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
The classical approach to automatic cost analysis consists of two phases. Given a program and some measure of cost, we first produce recurrence relations(RRs) which capture the cost of our program in terms of the size of its input data. Second, we convert such RRs into closed for…
Inferring Min and Max Invariants Using Max-Plus Polyhedra
Abstract elided by the publisher.