The tupling transformation strategy can be used to merge loops together by combining recursive calls and also eliminate redundant for a class of programs. clever (and difficult) step this is find an appropriate tuple calls, called the eureka tuple, which would allow each set computed recursively from its previous set. In many cases, produce super-linear speedup.

Conventional specifications for object-oriented (OO) programs must adhere to behavioral subtyping in support of class inheritance and method overriding. However, this requirement inherently weakens the overridden methods superclasses, leading imprecision during program reasoning. To address this, we advocate a fresh approach OO verification that focuses on distinction relation between cater calls with static dispatching from those dynamic dispatching. We formulate novel specification...

Techniques for proving termination and non-termination of imperative programs are usually considered as orthogonal mechanisms. In this paper, we propose a novel mechanism that analyzes proves both program at the same time. We first introduce concept second-order constraints accumulate set relational assumptions on them via Hoare-style verification. then solve these with case analysis to determine (conditional) non- scenarios expressed in some specification logic form. contrast current...

Large functional programs are often constructed by decomposing each big task into smaller tasks which can be performed simpler functions. This hierarchical style of developing has been found to improve programmers' productivity because functions easier construct and reuse. However, written in this way tend less efficient. Unnecessary intermediate data structures may created. More function invocations required.

Embedded systems are becoming more widely used but these often resource constrained. Programming models for should take into formal consideration resources such as stack and heap. In this paper, we show how memory bounds can be inferred assembly-level programs. Our inference process captures the needs of each method in terms symbolic values its parameters. For better precision, infer path-sensitive information through a novel guarded expression format. current proposal relies on Presburger...

Many program optimisations and analyses, such as array-bound checking, termination analysis, etc, depend on knowing the size of a function's input output. However, information can be difficult to compute. Firstly, accurate computation requires detecting relation between different inputs function. Secondly, analyses may require slightly information, thus computation. Literature in has mainly concentrated instead inferencing. In this paper, we provide generic framework which variants expressed...

The problems involved in developing efficient parallel programs have proved harder than those sequential ones, both for programmers and compilers. Although program calculation has been found to be a promising way solve these the world, we believe that it needs much more effort study its effective use world. In this paper, propose calculational framework derivation of with two main innovations:. -We novel inductive synthesis lemma based on which an elementary but powerful parallelization...

Abstract Large functional programs are often constructed by decomposing each big task into smaller tasks which can be performed simpler functions. This hierarchical style of developing has been found to improve programmers' productivity because functions easier construct and reuse. However, written in this way tend less efficient. Unnecessary intermediate data structures may created. More function invocations required. To reduce such performance penalties, Phil Wadler proposed a...

Region-based memory management offers several important potential advantages over garbage collection, including real-time performance, better data locality, and more efficient use of limited memory. Researchers have advocated the regions for functional, imperative, object-oriented languages. Lexically scoped are now a core feature Real-Time Specification Java (RTSJ)[5].Recent research in region-based programming has focused on region checking, which requires manual effort to augment program...

The symbolic-heap fragment of separation logic has been actively developed and advocated for verifying the memory-safety property computer programs. At present, one its biggest challenges is to effectively prove entailments containing inductive heap predicates. These are usually proof obligations generated when programs that manipulate complex data structures like linked lists, trees, or graphs. To assist in proving such entailments, this paper introduces a lemma synthesis framework, which...

Many software properties can be analysed through a relational size analysis on each function's inputs and outputs. Such (through form of dependent typing) has been successfully applied to declarative programs, restricted imperative programs; but it elusive for object-based programs. The main challenge is that objects may mutate they aliased. In this paper, we show how safety policies programs by tracking enforced objects' invariants the preconditions methods. We propose several new ideas...