Sciweavers

40 search results - page 1 / 8
» Automatic Inference of Frame Axioms Using Static Analysis
Sort
View
KBSE
2008
IEEE
13 years 11 months ago
Automatic Inference of Frame Axioms Using Static Analysis
Many approaches to software verification are currently semi-automatic: a human must provide key logical insights — e.g., loop invariants, class invariants, and frame axioms tha...
Zvonimir Rakamaric, Alan J. Hu
ESOP
2010
Springer
14 years 1 months ago
Amortized Resource Analysis with Polynomial Potential - A Static Inference of Polynomial Bounds for Functional Programs
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
Jan Hoffmann and Martin Hofmann
APLAS
2005
ACM
13 years 10 months ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
ISSTA
2012
ACM
11 years 7 months ago
Static detection of brittle parameter typing
To avoid receiving incorrect arguments, a method specifies the expected type of each formal parameter. However, some parameter types are too general and have subtypes that the me...
Michael Pradel, Severin Heiniger, Thomas R. Gross
VMCAI
2004
Springer
13 years 10 months ago
Type Inference for Parameterized Race-Free Java
Abstract. We study the type system introduced by Boyapati and Rinard in their paper “A Parameterized Type System for Race-Free Java Programs” and try to infer the type annotati...
Rahul Agarwal, Scott D. Stoller