Practically Applicable Formal Methods

Fulara, Jędrzej; Jakubczyk, Krzysztof

doi:10.1007/978-3-642-11266-9_34

Cited by 5 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A survey was presented in 2010 for effect of formal methods in software industry. The satisfaction level with automated tools is greater than 80% shown in Figure 1 [8].…”

Section: Formal Methods Maximize Automation With Automated Toolsmentioning

confidence: 87%

See 1 more Smart Citation

Formal Methods for Commercial Applications Issues vs. Solutions

Bibi¹,

Mazhar²,

Minhas³

et al. 2014

JSEA

View full text Add to dashboard Cite

It was advocated that in 21st century, most of software will be developed with benefits of formal methods. The benefits include faults found in earlier stage of software development, automating, checking the certain properties and minimizing rework. In spite of their recognition in academic world and these claimed advantages, formal methods are still not widely used by commercial software industry. The purpose of this research is to promote formal methods for commercial software industry. In this paper we have identified issues in use of formal methods for commercial applications and devised strategies to overcome these difficulties which will provide motivations to use formal methods for commercial applications.

show abstract

“…A survey was presented in 2010 for effect of formal methods in software industry. The satisfaction level with automated tools is greater than 80% shown in Figure 1 [8].…”

Section: Formal Methods Maximize Automation With Automated Toolsmentioning

confidence: 87%

“…Business managers have faith that formal methods can enhance the software quality, but formal methods are not widely used because these methods are considered costly and unfeasible [8].…”

Section: Issue-2: Expensivementioning

confidence: 99%

Formal Methods for Commercial Applications Issues vs. Solutions

Bibi¹,

Mazhar²,

Minhas³

et al. 2014

JSEA

View full text Add to dashboard Cite

show abstract

“…Several syntactical methods are discussed [13,15], that will be more efficient for simple cases, but less general. Our procedure can be seen as complementary to those methods.…”

Section: Loop-bound Analysismentioning

confidence: 99%

Making resource analysis practical for real-time Java

Kersten

Shkaravska

Gastel

et al. 2012

Proceedings of the 10th International Workshop on Java Technologies for Real-Time and Embedded Systems

View full text Add to dashboard Cite

For real-time and embedded systems limiting the consumption of time and memory resources is often an important part of the requirements. Being able to predict bounds on the consumption of these resources during the development process of the code can be of great value.Recent research results have advanced the state of the art of resource consumption analysis. In this paper we present a tool that makes it possible to apply these research results in practice for real-time systems enabling Java developers to analyse loop bounds, bounds on heap size and bounds on stack size. We describe which theoretical additions were needed in order to achieve this.We give an overview of the capabilities of the tool ResAna that is the result of this effort. The tool can not only perform generally applicable analyses, but it also contains a part of the analysis which is dedicated to the developers' (real-time) virtual machine, such that the results apply directly to the actual development environment that is used in practice.

show abstract

“…In [8], pattern-matching on abstract syntax trees (ASTs) is used by Fulara et al to select one of several syntax-based schemes for generating decreases-clauses. If the AST matches a given pattern, then parameters from this pattern can be used to form a decreases-clause.…”

Section: Related Workmentioning

confidence: 99%

Test-based inference of polynomial loop-bound functions

Shkaravska

Kersten

Eekelen

2010

Proceedings of the 8th International Conference on the Principles and Practice of Programming in Java

View full text Add to dashboard Cite

This paper presents an interpolation-based method of inferring arbitrary degree loop-bound functions for Java programs. Given a loop, by its "loop-bound function" we mean a function with the numeric program variables as its parameters, that is used to bound the number of loop-iterations. Using our analysis, loopbound functions that are polynomials with natural, rational or real coefficients can be found.Analysis of loop bounds is important in several different areas, including worst-case execution time (WCET) and heap consumption analysis, optimising compilers and termination-analysis. While several other methods exist to infer numerical loop bounds, we know of no other research on the inference of non-linear loopbound functions. Additionally, the inferred bounds are provable using external tools, e.g. KeY.To infer a loop-bound function for a given loop it is instrumented with a counter and executed on a well-chosen set of values of the numerical program variables. By well-chosen we mean that using these test values and the corresponding values of the counter, one can construct a unique interpolating polynomial. The uniqueness and the existence of the interpolating polynomial is guaranteed if the input values are in the so-called NCA-configuration, known from multivariate-polynomial interpolation theory. The constructed interpolating polynomial presumably bounds the dependency of the number of loop iterations on arbitrary values of the program variables. This hypothesis is verified by a third-party proof assistant.A prototype tool has been developed which implements this method. This prototype can infer piecewise polynomial loop-bound functions for a large class of loops in Java programs. Applicability of the prototype has been tested on a series of safety-critical case studies. For most of the loops in the case studies, loop-bound functions could be inferred (and verified using a proof assistant).

show abstract

Practically Applicable Formal Methods

Cited by 5 publications

References 16 publications

Formal Methods for Commercial Applications Issues vs. Solutions

Formal Methods for Commercial Applications Issues vs. Solutions

Making resource analysis practical for real-time Java

Test-based inference of polynomial loop-bound functions

Contact Info

Product

Resources

About