DOCSLIB.ORG

Termination Checking with Types Strong Normalization for Mendler-Style Course-Of-Value Recursion

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Termination Checking with Types Strong Normalization for Mendler-Style Course-Of-Value Recursion Termination Checking with Types Strong Normalization for Mendler-Style Course-Of-Value Recursion Andreas Abel ? Department of Computer Science University of Munich Oettingenstr. 67 80538 M¨unchen, Germany [email protected] Abstract. Gim´enez’type system for structural recursion in the Calcu- lus of Constructions is adapted to typed functional programming. As core language, the λ-calculus with inductive types, subtyping and bounded quantification is introduced. Decorated type variables, which represent approximations of inductive types, enable the type system to track the size of arguments to recursive functions and the size of the result of func- tion calls. Novel are an algorithm for type checking and proofs of type preservation and strong normalization. 1 Introduction The process of verifying a program can be separated into two parts: As the first step, partial correctness is established by verifying that a program matches its specification; then, termination is shown to obtain full correctness. For practical purposes, a complete verification is too tedious in most cases since it requires a huge amount of interactive theorem proving. But verification of certain program properties slowly makes its way into professional software development. Modern programming languages allow the specification of invariants which are verified statically and fully automatically by the compiler. These invariants effectively help uncover programming errors at compile-time. One very basic invariant is typing and type preservation which has been incor- porated into many modern programming languages, e.g. the widely used JAVA, as Nipkow and von Oheimb proved for a considerable subset [26]. Other interest- ing invariants are termination, and, even stronger, termination independent of the internal evaluation strategy, i.e. strong normalization. We aim at developing fully automatic, verified termination checking. For now, we restrict to declarative programming. To be suitable for practical programming, we claim that termination check- ing has to obey the following principles: First, the criteria on which the checker ? Research supported by the Graduiertenkolleg Logik in der Informatik (PhD Program Logic in Computer Science) of the Deutsche Forschungsgemeinschaft (DFG) decides acceptance must be simple enough for the user to comprehend. He should be able to obtain a model of which program is accepted and which is rejected without much difficulty. A good example here is again typing: In typed func- tional languages, e.g., SML [25], it is easy to write well-typed programs and to comprehend type errors. Secondly—this is strongly connected with the first principle—it must be possible for the compiler to give a good error message and point to the expression which makes the program fail the termination check. Otherwise, termination checking will most probably result in a loss rather than a gain of productivity. Traditionally, termination has been investigated in the context of term rewrit- ing systems. Research has focused on developing more and more powerful algo- rithms which accepted more and more programs as terminating. To this end, increasingly strong term orderings have been described (cf. Dershowitz [16], Steinbach [32], Giesl and Arts [7]). The methods of term rewriting are transferable to functional and logic pro- gramming as follows: The given (untyped) program is translated into a term rewriting system which then is checked for termination. The advantage of this procedure is that the full arsenal of methods developed for term rewriting sys- tems is available. However, due to the translation, termination checking will appear obscure to the user. We believe that, in general, it will be very hard to produce helpful error messages and expose the program location which fails ter- mination. Consequently, we focus on methods which directly deal with functional or logic programs. In the area of functional and logic programming, most termination checkers follow methods from term rewriting and rely on term orderings. Some examples: In previous work [1], we used the subterm ordering extended to higher-order functions to capture the class of structurally recursive functions over strictly positive inductive datatypes. For polynomial inductive types, a greater class of functions is accepted in Telford & Turner’s ESFP [34]. Their termination checker also incorporates a limited form of size-change and dataflow analysis which recognizes certain functions as reducers or preservers. Functions in these classes—first described by Walther [35]—have the property that the size of their output is bound by the size of some input argument (strictly smaller in the case of reducers). Finally, Pientka [29] has implemented termination and reduction checking for higher-order logic programs based on the subterm ordering. Unfortunately, the subterm ordering has some drawbacks. As we will see in an example (Sect. 3), it does not capture the notion of size well enough. Furthermore, as Gim´enezpointed out [18], the usual formulations make it hard to prove strong normalization. To my knowledge, no proof has been published so far. An alternative to subterm calculi is the introduction of type variables to keep track of the relation of the input argument of a function with the argument in the recursive call. This technique was first introduced by Mendler [24] for the restricted case of primitive recursion. His ideas were refined by Gim´enez [18], who proposed an extension of the Calculus of Constructions by a notion of subtyping and bounded quantification to type recursive functions over inductive 2 and coinductive datatypes. So far however, he has not shown that his system is sound, that is, proven of type preservation1 and strong normalization. We adopt Gim´enez’ idea for typed functional programming and propose a method of termination checking by type checking. In this paper, we present a core functional programming language Mini-MLµ≤ with higher-order functions and (non-strictly) positive inductive types. The types come with a lean and decidable subtyping calculus. Recursive functions can be written in a natural way as it is common practice in functional languages. Termination and size information are encoded in the types in a natural way and can be checked fully automated. Our main contribution are proofs of type preservation and strong normalization of our language. 1.1 Comparison with Xi’s Work Recently, Hongwei Xi has presented a method of termination verification which relies on dependent types. His approach seems powerful, practical and rather general, which raises the question whether it encompasses our system. This is not the case, for the following reason: To maintain decidability of type-checking, Xi’s types may only be indexed by integer expressions. In his system, we can construct a type list(n) of lists of length n. Then, we can write a recursive function on list(n) which only calls itself with arguments in list(n−1). Xi’s type system recognizes such a function as terminating. However, for some higher-order datatypes like infinitely branching trees, the height of a structure can no longer be described by a natural number; ordinals are required. Thus, recursive functions on such data structures cannot be shown terminating only with integer constraints. We see another potential problem in Xi’s setting, regarding error messages. To check dependent types, constraints have to be solved. If the constraint solver fails, a given expression is not of the ascribed type. In this case it is hard to ex- plain to the user exactly what caused the problem. In the simply typed setting however, type checking is rather straight-forward and type errors are compre- hensible. 1.2 Overview Besides specification of the language and type-checking (in Sect. 4), the proof of type preservation (Sect. 5) and strong normalization (Sect. 6), this paper contains an introduction to inductive types (Sect. 2), an informal description of our method with examples (Sect. 3), possible applications (Sect. 7) and a discussion of related and further work (Sect. 8). 2 Inductive Types We consider termination in the setting of simply-typed functional programming with inductive datatypes. Table 1 shows the core language Mini-MLµ most con- 1 alternative term: subject reduction 3 Types: ρ, σ, τ ::= X | 1 | σ + τ | σ × τ | σ → τ | µX.ρ (where X appears only positively in ρ) Terms: M, N ::= x | λx.M | M1 M2 | inl M | inr M | (case M of inl x1 ⇒ M1 | inr x2 ⇒ M2) | () | (M1,M2) | fst M | snd M | fold M | unfold M | fix g(x).M Contexts (all variables distinct): Γ ::= · | Γ, x: τ Typing (τ and all types in Γ closed): Γ ` M : τ Lambda-calculus: x: τ ∈ Γ Γ, x: σ ` M : τ Γ ` M1 : σ → τ Γ ` M2 : σ Γ ` x : τ Γ ` λx.M : σ → τ Γ ` M1 M2 : τ Sum types: Γ ` M : σ Γ ` M : τ Γ ` M : σ + τ Γ, x1 : σ ` M1 : ρ Γ, x2 : τ ` M2 : ρ Γ ` inl M : σ + τ Γ ` inr M : σ + τ Γ ` case M of inl x1 ⇒ M1 | inr x2 ⇒ M2 : ρ Product types: Γ ` M1 : σ Γ ` M2 : τ Γ ` M : σ × τ Γ ` M : σ × τ Γ ` () : 1 Γ ` (M1,M2): σ × τ Γ ` fst M : σ Γ ` snd M : τ Inductive types and recursion: Γ ` M : σ(µX.σ) Γ ` M : µX.σ Γ, g : σ → τ, x : σ ` M : τ Γ ` fold M : µX.σ Γ ` unfold M : σ(µX.σ) Γ ` fix g(x).M : σ → τ Notational definitions: 0 ≡ µX.X abort ≡ fix g(x).g(unfold x) : 0 → τ Table 1. The core functional language Mini-MLµ. structs of which are well-known. Note that fix g(x).M bind the two variables g and x in M. Some significant subset of a functional language like SML can be translated to Mini-MLµ. For example, consider the following SML program: datatype Nat = Zero | Succ of Nat datatype ListN = Nil | Cons of Nat * ListN fun sum (Nil) = Zero | sum (Cons (n, l)) = sum’ (n, l) and sum’ (Zero, l) = sum l | sum’ (Succ n, l) = Succ (sum’ (n, l)) 4 In Mini-MLµ, the defined datatypes are represented by the type expressions Nat := µX.1 + X and ListN := µY.1 + Nat × Y .
Load more

Recommended publications
  • Formal Verification of Termination Criteria for First-Order Recursive Functions
    Formal Verification of Termination Criteria for First-Order Recursive Functions Cesar A. Muñoz £ Mauricio Ayala-Rincón £ NASA Langley Research Center, Hampton, VA, Departments of Computer Science and Mathem- USA atics, Universidade de Brasília, Brazil Mariano M. Moscato £ Aaron M. Dutle £ National Institute of Aerospace, Hampton, VA, NASA Langley Research Center, Hampton, VA, USA USA Anthony J. Narkawicz Ariane Alves Almeida £ USA Department of Computer Science, Universidade de Brasília, Brazil Andréia B. Avelar da Silva Thiago M. Ferreira Ramos £ Faculdade de Planaltina, Universidade de Brasília, Department of Computer Science, Universidade Brazil de Brasília, Brazil Abstract This paper presents a formalization of several termination criteria for first-order recursive functions. The formalization, which is developed in the Prototype Verification System (PVS), includes the specification and proof of equivalence of semantic termination, Turing termination, sizechange principle, calling context graphs, and matrix-weighted graphs. These termination criteria are defined on a computational model that consists of a basic functional language called PVS0, which is an embedding of recursive first-order functions. Through this embedding, the native mechanism for checking termination of recursive functions in PVS could be soundly extended with semi-automatic termination criteria such as calling contexts graphs. 2012 ACM Subject Classification Theory of computation → Models of computation; Software and its engineering → Software verification; Computing methodologies → Theorem proving algorithms Keywords and phrases Formal Verification, Termination, Calling Context Graph, PVS Digital Object Identifier 10.4230/LIPIcs.ITP.2021.26 Supplementary Material Other (NASA PVS Library): https://github.com/nasa/pvslib Funding Mariano M. Moscato: corresponding author; research supported by the National Aeronaut- ics and Space Administration under NASA/NIA Cooperative Agreement NNL09AA00A.
    [Show full text]
  • Synthesising Interprocedural Bit-Precise Termination Proofs
    Synthesising Interprocedural Bit-Precise Termination Proofs Hong-Yi Chen, Cristina David, Daniel Kroening, Peter Schrammel and Bjorn¨ Wachter Department of Computer Science, University of Oxford, fi[email protected] Abstract—Proving program termination is key to guaranteeing does terminate with mathematical integers, but does not ter- absence of undesirable behaviour, such as hanging programs and minate with machine integers if n equals the largest unsigned even security vulnerabilities such as denial-of-service attacks. To integer. On the other hand, the following code: make termination checks scale to large systems, interprocedural termination analysis seems essential, which is a largely unex- void foo2 ( unsigned x ) f while ( x>=10) x ++; g plored area of research in termination analysis, where most effort has focussed on difficult single-procedure problems. We present does not terminate with mathematical integers, but terminates a modular termination analysis for C programs using template- with machine integers because unsigned machine integers based interprocedural summarisation. Our analysis combines a wrap around. context-sensitive, over-approximating forward analysis with the A second challenge is to make termination analysis scale to inference of under-approximating preconditions for termination. Bit-precise termination arguments are synthesised over lexico- larger programs. The yearly Software Verification Competition graphic linear ranking function templates. Our experimental (SV-COMP) [6] includes a division in termination analysis, results show that our tool 2LS outperforms state-of-the-art alter- which reflects a representative picture of the state-of-the-art. natives, and demonstrate the clear advantage of interprocedural The SV-COMP’15 termination benchmarks contain challeng- reasoning over monolithic analysis in terms of efficiency, while ing termination problems on smaller programs with at most retaining comparable precision.
    [Show full text]
  • Practical Reflection and Metaprogramming for Dependent
    Practical Reflection and Metaprogramming for Dependent Types David Raymond Christiansen Advisor: Peter Sestoft Submitted: November 2, 2015 i Abstract Embedded domain-specific languages are special-purpose pro- gramming languages that are implemented within existing general- purpose programming languages. Dependent type systems allow strong invariants to be encoded in representations of domain-specific languages, but it can also make it difficult to program in these em- bedded languages. Interpreters and compilers must always take these invariants into account at each stage, and authors of embedded languages must work hard to relieve users of the burden of proving these properties. Idris is a dependently typed functional programming language whose semantics are given by elaboration to a core dependent type theory through a tactic language. This dissertation introduces elabo- rator reflection, in which the core operators of the elaborator are real- ized as a type of computations that are executed during the elab- oration process of Idris itself, along with a rich API for reflection. Elaborator reflection allows domain-specific languages to be imple- mented using the same elaboration technology as Idris itself, and it gives them additional means of interacting with native Idris code. It also allows Idris to be used as its own metalanguage, making it into a programmable programming language and allowing code re-use across all three stages: elaboration, type checking, and execution. Beyond elaborator reflection, other forms of compile-time reflec- tion have proven useful for embedded languages. This dissertation also describes error reflection, in which Idris code can rewrite DSL er- ror messages before presenting domain-specific messages to users, as well as a means for integrating quasiquotation into a tactic-based elaborator so that high-level syntax can be used for low-level reflected terms.
    [Show full text]
  • Unfailing Haskell
    The University of York Department of Computer Science Programming Languages and Systems Group Unfailing Haskell Qualifying Dissertation 30th June 2005 Neil Mitchell 2 Abstract Programs written in Haskell may fail at runtime with either a pattern match error, or with non-termination. Both of these can be thought of as giving the value ⊥ as a result. Other forms of failure, for example heap exhaustion, are not considered. The first section of this document reviews previous work, including total functional programming and sized types. Attention is paid to termination checkers for both Prolog and various functional languages. The main result from work so far is a static checker for pattern match errors that allows non-exhaustive patterns to exist, yet ensures that a pattern match error does not occur. It includes a constraint language that can be used to reason about pattern matches, along with mechanisms to propagate these constraints between program components. The proposal deals with future work to be done. It gives an approximate timetable for the design and implementation of a static checker for termination and pattern match errors. 1 Contents 1 Introduction 4 1.1 Total Programming . 4 1.2 Benefits of Totality . 4 1.3 Drawbacks of Totality . 5 1.4 A Totality Checker . 5 2 Field Survey and Review 6 2.1 Background . 6 2.1.1 Bottom ⊥ ........................................... 6 2.1.2 Normal Form . 7 2.1.3 Laziness . 7 2.1.4 Higher Order . 8 2.1.5 Peano Numbers . 8 2.2 Static Analysis . 8 2.2.1 Data Flow Analysis . 9 2.2.2 Constraint Based Analysis .
    [Show full text]
  • Termination Analysis with Compositional Transition Invariants*
    Termination Analysis with Compositional Transition Invariants? Daniel Kroening1, Natasha Sharygina2;4, Aliaksei Tsitovich2, and Christoph M. Wintersteiger3 1 Oxford University, Computing Laboratory, UK 2 Formal Verification and Security Group, University of Lugano, Switzerland 3 Computer Systems Institute, ETH Zurich, Switzerland 4 School of Computer Science, Carnegie Mellon University, USA Abstract. Modern termination provers rely on a safety checker to con- struct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the procedure. We present an alter- native algorithm that uses a light-weight check based on transitivity of ranking relations to prove program termination. We provide an exper- imental evaluation over a set of 87 Windows drivers, and demonstrate that our algorithm is often able to conclude termination by examining only a small fraction of the program. As a consequence, our algorithm is able to outperform known approaches by multiple orders of magnitude. 1 Introduction Automated termination analysis of systems code has advanced to a level that permits industrial application of termination provers. One possible way to obtain a formal argument for termination of a program is to rank all states of the pro- gram with natural numbers such that for any pair of consecutive states si; si+1 the rank is decreasing, i.e., rank(si+1) < rank(si). In other words, a program is terminating if there exists a ranking function for every program execution. Substantial progress towards the applicability of procedures that compute ranking arguments to industrial code was achieved by an algorithm called Binary Reachability Analysis (BRA), proposed by Cook, Podelski, and Rybalchenko [1].
    [Show full text]
  • A Flexible Approach to Termination with General Recursion
    Termination Casts: A Flexible Approach to Termination with General Recursion Aaron Stump Vilhelm Sj¨oberg Stephanie Weirich Computer Science Computer and Information Science Computer and Information Science The University of Iowa University of Pennsylvania University of Pennsylvania [email protected] [email protected] [email protected] This paper proposes a type-and-effect system called Teq↓, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambda calculus with general recursion and equality types. The central idea is to include a primitive type-form “Terminates t”, expressing that term t is terminating; and then allow terms t to be coerced from possibly diverging to total, using a proof of Terminates t. We call such coercions termination casts, and show how to implement terminating recursion using them. For the meta-theory of the system, we describe a translation from Teq↓ to a logical theory of termination for general recursive, simply typed functions. Every typing judgment of Teq↓ is translated to a theorem expressing the appropriate termination property of the computational part of the Teq↓ term. 1 Introduction Soundly combining general recursion and dependent types is a significant current challenge in the design of dependently typed programming languages. The two main difficulties raised by this combination are (1) type-equivalence checking with dependent types usually depends on term reduction, which may fail to terminate in the presence of general recursion; and (2) under the Curry-Howard isomorphism, non- terminating recursions are interpreted as unsound inductive proofs, and hence we lose soundness of the type system as a logic.
    [Show full text]
  • Proving Conditional Termination
    Proving Conditional Termination Byron Cook1, Sumit Gulwani1, Tal Lev-Ami2,?, Andrey Rybalchenko3,??, and Mooly Sagiv2 1 Microsoft Research 2 Tel Aviv University 3 MPI-SWS Abstract. We describe a method for synthesizing reasonable underap- proximations to weakest preconditions for termination—a long-standing open problem. The paper provides experimental evidence to demonstrate the usefulness of the new procedure. 1 Introduction Termination analysis is critical to the process of ensuring the stability and us- ability of software systems, as liveness properties such “Will Decode() always return back to its call sites?” or “Is every call to Acquire() eventually followed by a call to Release()?” can be reduced to a question of program termina- tion [8,22]. Automatic methods for proving such properties are now well studied in the literature, e.g. [1,4,6,9,16]. But what about the cases in which code only terminates for some inputs? What are the preconditions under which the code is still safe to call, and how can we automatically synthesize these conditions? We refer to these questions as the conditional termination problem. This paper describes a method for proving conditional termination. Our method is based on the discovery of potential ranking functions—functions over program states that are bounded but not necessarily decreasing—and then finding preconditions that promote the potential ranking functions into valid ranking functions. We describe two procedures based on this idea: PreSynth, which finds preconditions to termination, and PreSynthPhase, which extends PreSynth with the ability to identify the phases necessary to prove the termi- nation of phase-transition programs [3].
    [Show full text]
  • Automated Termination Proofs for Haskell by Term Rewriting
    Automated Termination Proofs for Haskell by Term Rewriting J¨urgen Giesl, RWTH Aachen University, Germany Matthias Raffelsieper, TU Eindhoven, The Netherlands Peter Schneider-Kamp, University of Southern Denmark, Odense, Denmark Stephan Swiderski, RWTH Aachen University, Germany Ren´eThiemann, University of Innsbruck, Austria There are many powerful techniques for automated termination analysis of term rewriting. How- ever, up to now they have hardly been used for real programming languages. We present a new approach which permits the application of existing techniques from term rewriting to prove ter- mination of most functions defined in Haskell programs. In particular, we show how termination techniques for ordinary rewriting can be used to handle those features of Haskell which are miss- ing in term rewriting (e.g., lazy evaluation, polymorphic types, and higher-order functions). We implemented our results in the termination prover AProVE and successfully evaluated them on existing Haskell-libraries. Categories and Subject Descriptors: F.3.1 [Logic and Meanings of Programs]: Specifying and Verifying and Reasoning about Programs—Mechanical verification; D.1.1 [Programming Techniques]: Applicative (Functional) Programming; I.2.2 [Artificial Intelligence]: Automatic Programming—Automatic analysis of algorithms; I.2.3 [Artificial Intelligence]: Deduction and Theorem Proving General Terms: Languages, Theory, Verification Additional Key Words and Phrases: functional programming, Haskell, termination analysis, term rewriting, dependency pairs Supported by the Deutsche Forschungsgsmeinschaft DFG under grant GI 274/5-2 and the DFG Research Training Group 1298 (AlgoSyn). Authors’ addresses: J¨urgen Giesl, Stephan Swiderski, LuFG Informatik 2, RWTH Aachen University, Ahornstr. 55, 52074 Aachen, Germany, {giesl,swiderski}@informatik.rwth-aachen.de Matthias Raffelsieper, Dept.
    [Show full text]
  • A Predicative Analysis of Structural Recursion
    Under consideration for publication in J. Functional Programming 1 A Predicative Analysis of Structural Recursion ANDREAS ABEL ∗ Department of Computer Science, University of Munich, 80538 Munich, Germany (e-mail: [email protected]) THORSTEN ALTENKIRCH School of Computer Science & Information Technology, University of Nottingham, Nottingham, NG8 1BB, UK (e-mail: [email protected]) Abstract We introduce a language based upon lambda calculus with products, coproducts and strictly positive inductive types that allows the definition of recursive terms. We present the implementation (foetus) of a syntactical check that ensures that all such terms are structurally recursive, i.e., recursive calls appear only with arguments structurally smaller than the input parameters of terms considered. To ensure the correctness of the termina- tion checker, we show that all structurally recursive terms are normalizing with respect to a given operational semantics. To this end, we define a semantics on all types and a structural ordering on the values in this semantics and prove that all values are accessible with regard to this ordering. Finally, we point out how to do this proof predicatively using set based operators. 1 Introduction In lambda calculi with inductive types the standard means to construct a function over an inductive type is the recursor, which corresponds to induction. This method, however, has several drawbacks, as discussed in (Coquand, 1992). One of them is that programs are hard to understand intuitively. E.g., the \division by 2"-function may be coded with recursors over natural numbers RN and booleans RB as follows: RN : σ (N σ σ) N σ ! ! ! ! ! RB : σ σ B σ !N !N !B N B N B half = λn :R (λx : 0) (λx λf ! :R (f true) (1 + (f false))) n false Alternatively, in the presence of products, it can be implemented involving an aux- iliary function returning a pair.
    [Show full text]
  • Distilling Programs to Prove Termination
    Distilling Programs to Prove Termination G.W. Hamilton School of Computing Dublin City University Ireland [email protected] The problem of determining whether or not any program terminates was shown to be undecidable by Turing, but recent advances in the area have allowed this information to be determined for a large class of programs. The classic method for deciding whether a program terminates dates back to Turing himself and involves finding a ranking function that maps a program state to a well-order, and then proving that the result of this function decreases for every possible program transition. More recent approaches to proving termination have involved moving away from the search for a single ranking function and toward a search for a set of ranking functions; this set is a choice of ranking functions and a disjunctive termination argument is used. In this paper, we describe a new technique for determining whether programs terminate. Our technique is applied to the output of the distillation program transformation that converts programs into a simplified form called distilled form. Programs in distilled form are converted into a corresponding labelled transition system and termination can be demonstrated by showing that all possible infinite traces through this labelled transition system would result in an infinite descent of well-founded data values. We demonstrate our technique on a number of examples, and compare it to previous work. 1 Introduction The program termination problem, or halting problem, can be defined as follows: using only a finite amount of time, determine whether a given program will always finish running or could execute for- ever.
    [Show full text]
  • Termination Analysis with Recursive Calling Graphs
    Journal of Network and Computer Applications 59 (2016) 109–116 Contents lists available at ScienceDirect Journal of Network and Computer Applications journal homepage: www.elsevier.com/locate/jnca Termination analysis with recursive calling graphs Teng Long a,b,n, Wenhui Zhang b a School of Information Engineering, China University of Geosciences (Beijing), 29#, Xueyuan Road, Haidian District, Beijing, PR China b State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, 4#, South Fourth Street of Zhongguancun, Haidian District, Beijing, PR China article info abstract Available online 16 July 2015 As one of the significant aspects for green software systems, termination analysis is related to the fi Keywords: optimization of the resource utilization. The approach for size-change termination principle was rst Termination analysis proposed by Lee, Jones and Ben-Amram in 2001, which is an effective method for automatic termination Green software programs analysis. According to its abstracted constructs (size-change graphs), the principle ignores the condition and Size-change termination principle return values for function call. In this paper, we devise a new construct including the ignoring features to extend the set of programs that are size-change terminating in real life. The main contribution of our paper is twofold: firstly, it supports the analysis of functions in which the returned values are relevant to termination. Secondly, it gains more accuracy for oscillating value change in termination analysis. & 2015 Elsevier Ltd. All rights reserved. 1. Introduction analysis is unrelated to the order of the variables which is decided in SCT. Therefore, it is one of the approaches which are success- With the development of information and communication fully applied in a large class of programs for termination analysis.
    [Show full text]
  • Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions
    Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions Christophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord, Cl´ement Quinson To cite this version: Christophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord, Cl´ement Quinson. Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions. [Research Report] 2009, pp.31. <inria-00434037> HAL Id: inria-00434037 https://hal.inria.fr/inria-00434037 Submitted on 20 Nov 2009 HAL is a multi-disciplinary open access L'archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destin´eeau d´ep^otet `ala diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publi´esou non, lished or not. The documents may come from ´emanant des ´etablissements d'enseignement et de teaching and research institutions in France or recherche fran¸caisou ´etrangers,des laboratoires abroad, or from public or private research centers. publics ou priv´es. INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions Christophe Alias — Alain Darte — Paul Feautrier — Laure Gonnord — Clément Quinson N° 7037 Novembre 2009 apport de recherche ISSN 0249-6399 ISRN INRIA/RR--7037--FR+ENG Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions Christophe Alias∗, Alain Darte †, Paul Feautrier ‡, Laure Gonnord §, Clément Quinson ¶ Thème : Architecture et compilation Équipe-Projet Compsys Rapport de recherche n° 7037 — Novembre 2009 — 31 pages Abstract: A standard method for proving the termination of a flowchart program is to exhibit a ranking function, i.e., a function from the program states to a well-founded set, which strictly decreases at each program step.
    [Show full text]