We present a new approach for termination proofs that uses polynomial interpretations (with possibly negative coefficients) together with the “maximum” function. To obtain a powerful automatic method, we solve two main challenges: (1) We show how to adapt the latest developments in the dependency pair framework to our setting. (2) We show how to automate the search for such interpretations by i...

Conflict-driven learning, which is essential to the performance of sat and smt solvers, consists of a procedure that searches for a model of a formula, and refutation procedure for proving that no model exists. This paper shows that conflict-driven learning can improve the precision of a termination analysis based on abstract interpretation. We encode non-termination as satisfiability in a mona...

Rewriting is a computational process in which one term is derived from another by replacing a subterm with another subterm in accordance with a set of rules. If such a set of rules (rewrite system) has the property that no derivation can continue indefinitely, it is said to be terminating. Showing termination is an important component of theorem proving and of great interest in programming lang...

Background: There is no substitute to mother breastfeeding; on the one hand, mothers need all-out support, especially in the first days after delivery, which is one of the effective factors for women’s success in breastfeeding. Objectives: The aim of this study is to investigate the relationship between social support and early termination of breastfeeding. Methods: This retrospective study e...

Termination proving has traditionally been based on the search for (possibly lexicographic) ranking functions. In recent years, however, the discovery of termination proof techniques based on Ramsey’s theorem have led to new automation strategies, e.g. size-change, or iterative reductions from termination to safety. In this paper we revisit the decision to use Ramsey-based termination arguments...

RNA signals at the ends of the genes of respiratory syncytial (RS) virus direct polyadenylation and termination of viral transcription. These gene ends contain two conserved regions, a pentanucleotide and a tract of uridylate (U) residues, separated by an A/U-rich central region that is less well conserved. The U tract is thought to be the template for polyadenylation of viral mRNAs by reiterat...

Rho-dependent transcription terminators participate in sophisticated genetic regulatory mechanisms, in both bacteria and phages; they occur in regulatory regions preceding the coding sequences of genes and within coding sequences, as well as at the end of transcriptional units, to prevent readthrough transcription. Most Rho-dependent terminators have been found in enteric bacteria, but they als...

Numerous techniques have been used to improve the voltage handling capability of high voltage power devices with the aim to obtain the breakdown of a plane junction. In this work, a new concept of low cost, low surface and high efficiency junction termination for power devices is presented and experimentally validated. This termination is based on a large and deep trench filled by BCB (BenzoCyc...

We propose a logical framework for specifying and proving assertions about program termination and non-termination. Although program termination has been well studied, it is usually added as an external component to a specification logic. Here we propose to integrate termination requirements directly into our specification logic, as temporal constraints for each execution phase of every method....

We show how to automate termination proofs for recursive functions in (a first-order subset of) Isabelle/HOL by encoding them as term rewrite systems and invoking an external termination prover. Our link to the external prover includes full proof reconstruction, where all necessary properties are derived inside Isabelle/HOL without oracles. Apart from the certification of the imported proof, th...