Resource bound certification

Crary, Karl; Weirich, Stephnie

doi:10.1145/325694.325716

Cited by 160 publications

(117 citation statements)

References 17 publications

Supporting

Mentioning

117

Contrasting

Order By: Relevance

“…Resource usage certification [24,14,18,7,8] has been proposed as a way to provide resource guarantees in the context of mobile code. Mobile code includes, for example running applets and/or plug-ins downloaded from the net in a web browser or a mobile phone.…”

Section: Resource Usage Certificationmentioning

confidence: 99%

A practical comparator of cost functions and its applications

Albert

Arenas

Genaim

et al. 2015

Science of Computer Programming

View full text Add to dashboard Cite

Automatic cost analysis has significantly advanced in the last few years. Nowadays, a number of cost analyzers exist which automatically produce upperand/or lower-bounds on the amount of resources required to execute a program. Cost analysis has a number of important applications such as resource-usage verification and program synthesis and optimization. For such applications to be successful, it is not sufficient to have automatic cost analysis. It is also required to have automated means for handling the analysis results, which are in the form of Cost Functions (CFs for short) i.e., non-recursive expressions composed of a relatively small number of types of basic expressions. In particular, we need automated means for comparing CFs in order to prove that a CF is smaller than or equal to another one for all input values of interest. General function comparison is a hard mathematical problem. Rather than attacking the general problem, in this work we focus on comparing CFs by exploiting their syntactic properties and we present, to the best of our knowledge, the first practical CF comparator which opens the door to fully automated applications of cost analysis. We have implemented the comparator and made its source code available online, so that any cost analyzer can use it.

show abstract

Section: Resource Usage Certificationmentioning

confidence: 99%

A practical comparator of cost functions and its applications

Albert

Arenas

Genaim

et al. 2015

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…The following table gives the breakdown of the proof effort measured in lines of proof scripts 5 . Fig.…”

Section: Correctness Proof In Coqmentioning

confidence: 99%

“…Crary and Weirich [5] define a logic for reasoning about resource consumption certificates of higher-order functions. The certificate of a function provides an overapproximation of the execution time of a call to the function.…”

Section: Related Workmentioning

confidence: 99%

Certified Memory Usage Analysis

Cachera

Jensen

Pichardie

et al. 2005

FM 2005: Formal Methods

View full text Add to dashboard Cite

Abstract. We present a certified algorithm for resource usage analysis, applicable to languages in the style of Java byte code. The algorithm verifies that a program executes in bounded memory. The algorithm is destined to be used in the development process of applets and for enhanced byte code verification on embedded devices. We have therefore aimed at a low-complexity algorithm derived from a loop detection algorithm for control flow graphs. The expression of the algorithm as a constraint-based static analysis of the program over simple lattices provides a link with abstract interpretation that allows to state and prove formally the correctness of the analysis with respect to an operational semantics of the program. The certification is based on an abstract interpretation framework implemented in the Coq proof assistant which has been used to provide a complete formalisation and formal verification of all correctness proofs.

show abstract

“…For instance, UBs are widely used to estimate the space and time requirements of programs execution and provide resource guarantees [8]. Lack of precision can make the system fail to prove the resource usage requirements imposed by the software client.…”

Section: Introductionmentioning

confidence: 99%

More Precise Yet Widely Applicable Cost Analysis

Albert

Genaim

Masud

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Cost analysis aims at determining the amount of resources required to run a program in terms of its input data sizes. Automatically inferring precise bounds, while at the same time being able to handle a wide class of programs, is a main challenge in cost analysis. (1) Existing methods which rely on computer algebra systems (CAS ) to solve the obtained cost recurrence equations (CR) are very precise when applicable, but handle a very restricted class of CR. (2) Specific solvers developed for CR tend to sacrifice accuracy for wider applicability. In this paper, we present a novel approach to inferring precise upper and lower bounds on CR which, when compared to (1), is strictly more widely applicable while precision is kept and when compared to (2), is in practice more precise (obtaining even tighter complexity orders), keeps wide applicability and, besides, can be applied to obtain useful lower bounds as well. The main novelty is that we are able to accurately bound the worst-case/best-case cost of each iteration of the program loops and, then, by summing the resulting sequences, we achieve very precise upper/lower bounds.

show abstract

Resource bound certification

Cited by 160 publications

References 17 publications

A practical comparator of cost functions and its applications

A practical comparator of cost functions and its applications

Certified Memory Usage Analysis

More Precise Yet Widely Applicable Cost Analysis

Contact Info

Product

Resources

About