229,334 Hits in 4.5 sec

Alternation for Termination [chapter]

William R. Harris, Akash Lal, Aditya V. Nori, Sriram K. Rajamani
2010 Lecture Notes in Computer Science  
In order to prove termination, TREX maintains an over-approximation of the set of states that can be reached at the head of the loop.  ...  We present a new algorithm, TREX, that determines if a sequential program terminates on all inputs.  ...  TREX analyzes loops in the program one at a time.  ... 
doi:10.1007/978-3-642-15769-1_19 fatcat:kumxtbddgzgmvl4fcc67wt6qwa

A Region Graph Based Approach to Termination Proofs [chapter]

Stefan Leue, Wei Wei
2006 Lecture Notes in Computer Science  
values that have different effects on loop termination.  ...  Given a loop, a region is a set of vectors of variable values such that -all the vectors in the region satisfy the loop condition.  ...  We thank Alin Stefanescu for his beneficial and helpful comments on our work and Daniel Butnaru for his assistance in programming the PONES prototype.  ... 
doi:10.1007/11691372_21 fatcat:csq2btrctzbjheo2i7hyx7kjue

Termination analysis for GPU kernels

Jeroen Ketema, Alastair F. Donaldson
2017 Science of Computer Programming  
We describe a thread-modular technique for proving termination of massively parallel GPU kernels.  ...  The technique reduces the termination problem for these kernels to a sequential termination problem by abstracting the shared state, and as such allows us to leverage termination analysis techniques for  ...  The authors wish to thank Adam Betts, Nathan Chong, and Stephan Falke for feedback on the paper.  ... 
doi:10.1016/j.scico.2017.04.009 fatcat:7ccotbwpvzerhojras3hpv7lae

Termination and Cost Analysis of Loops with Concurrent Interleavings [chapter]

Elvira Albert, Antonio Flores-Montoya, Samir Genaim, Enrique Martin-Martin
2013 Lecture Notes in Computer Science  
"shared-data that is involved in the termination proof of the loop is modified a finite number of times".  ...  By following a rely-guarantee style of reasoning, we present a novel termination analysis for concurrent programs that, in order to prove termination of a considered loop, makes the assumption that the  ...  objects which assumes a property on the global state in order to prove termination of a loop and, then, proves that this property holds.  ... 
doi:10.1007/978-3-319-02444-8_25 fatcat:ubo2mgaa6bblfo6icj7nvg5nua

Proving Lock-Freedom Easily and Automatically

Xiao Jia, Wei Li, Viktor Vafeiadis
2015 Proceedings of the 2015 Conference on Certified Programs and Proofs - CPP '15  
It ensures that at any point at least one thread is making progress towards termination; so the system as a whole makes progress.  ...  By introducing simple loop depth counters into the programs, we can reduce proving lock-freedom to checking simple local properties on those counters.  ...  If C, σ, P is safe at loop depth d and d C, σ, P → C , σ , P , then C , σ , P is also safe at d. We move on to the metric we use to prove termination.  ... 
doi:10.1145/2676724.2693179 dblp:conf/cpp/JiaLV15 fatcat:iu3xg3ndfvewhb27n2px6wjhie

Loopster: static loop termination analysis

Xiaofei Xie, Bihuan Chen, Liang Zou, Shang-Wei Lin, Yang Liu, Xiaohong Li
2017 Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2017  
Loop termination is an important problem for proving the correctness of a system and ensuring that the system always reacts.  ...  In this paper, we present a novel approach, named Loopster, which performs an efficient static analysis to decide the termination for loops based on path termination analysis and path dependency reasoning  ...  Termination Proving Existing research on termination proving mainly focuses on the synthesis of termination arguments.  ... 
doi:10.1145/3106237.3106260 dblp:conf/sigsoft/XieCZLLL17 fatcat:hlqpcso6ubdshd7ssrpc3k6kce

Retrospective and Prospective for Unifying Theories of Programming [chapter]

Eric Hehner
2006 Lecture Notes in Computer Science  
It also speculates on consequences the work will have for all of computer science. Retrospective and Prospective for Unifying Theories of Programming 2  ...  This paper presents a personal account of developments leading to Unifying Theories of Programming, and some opinions about the direction the work should take in the future.  ...  Perhaps more disturbingly, we can also prove t<∞ ⇒ t′<∞ ⇐ (t:= t+1; t<∞ ⇒ t′<∞) which seems to say that if the computation starts at a finite time, it will end at a finite time.  ... 
doi:10.1007/11768173_1 fatcat:pjk7kzzyqjbhhc3w2656rjjxoy

2LS: Memory Safety and Non-termination [chapter]

Viktor Malík, Štefan Martiček, Peter Schrammel, Mandayam Srivas, Tomáš Vojnar, Johanan Wahlang
2018 Lecture Notes in Computer Science  
New features in this year's version are improved handling of heapallocated data structures using a template domain for shape analysis and two approaches to prove program non-termination.  ...  2LS is a C program analyser built upon the CPROVER infrastructure. 2LS is bit-precise and it can verify and refute program assertions and termination. 2LS implements template-based synthesis techniques  ...  All loops are unfolded k times (with k being incrementally increased), followed by a check whether there is some loop L and a program configuration that can be reached at the head of L after both k and  ... 
doi:10.1007/978-3-319-89963-3_24 fatcat:npxjj6yqubbazdmi7qn3umu2g4

Termination proofs from tests

Aditya V. Nori, Rahul Sharma
2013 Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2013  
In particular, we describe an algorithm TpT for proving termination of a program based on information derived from testing it.  ...  On the other hand, if all loop bounds are valid, then we have a proof of termination. We also describe a simple extension to our approach that allows us to infer polynomial loop bounds automatically.  ...  A shows that TpT was able to prove the termination of all loops in the benchmark program. A × shows that TpT found a true non-termination bug.  ... 
doi:10.1145/2491411.2491413 dblp:conf/sigsoft/Nori013 fatcat:qi5iybfmgnck7cdg7hfzweaduq

Soundness of a Logic-Based Verification Method for Imperative Loops

Madalina Erascu, Tudor Jebelean
2012 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing  
We present a logic-based verification method for imperative loops (including ones with abrupt termination) and the automatic proof of its soundness.  ...  The verification method consists in generating verification conditions for total correctness of an imperative loop annotated with an invariant.  ...  We prove the soundness of the method for loops with abrupt termination by transforming the loop into a normal terminating one (Section III-B).  ... 
doi:10.1109/synasc.2012.63 dblp:conf/synasc/ErascuJ12 fatcat:dq4bas2yijg67eipennt2rlnuq

Finding and Certifying Loops [chapter]

Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp
2010 Lecture Notes in Computer Science  
The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems.  ...  We encode rewrite sequences as propositional formulas such that a loop can be extracted from a satisfying assignment. Alternatively, loops can be found by enumerating forward closures.  ...  We would like to thank René Thiemann for exploring the code-generation facilities of Isabelle and Johannes Waldmann for helpful comments and providing a version of Matchbox'07 specialized to nontermination  ... 
doi:10.1007/978-3-642-11266-9_63 fatcat:a6itkddbr5cyjg7uoey36vc7f4

Word-length optimization beyond straight line code

David P. Boland, George A. Constantinides
2013 Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays - FPGA '13  
To achieve this, we build on ideas emanating from the software verification community to prove program termination.  ...  Our idea is to apply word-length optimization techniques to find the minimum precision required to guarantee that a loop with data dependent exit conditions will terminate.  ...  While it is possible to analyze a single loop iteration, one cannot compute the bound on relative error seen at the final output because any errors will be amplified by feedback [3] .  ... 
doi:10.1145/2435264.2435285 dblp:conf/fpga/BolandC13 fatcat:3jeivxd2fvgjjizk7j7rylle7y

Modular Product Programs [chapter]

Marco Eilers, Peter Müller, Samuel Hitz
2018 Lecture Notes in Computer Science  
Alternatively, constructions such as selfcomposition represent multiple executions of a program by one product program, thereby reducing hyperproperties of the original program to trace properties of the  ...  We demonstrate its expressiveness by applying it to information flow security with advanced features such as declassification and termination-sensitivity.  ...  Timing channels can occur in combination with observable events; the time at which an event occurs may depend on a secret even if the overall execution time of a program does not.  ... 
doi:10.1007/978-3-319-89884-1_18 fatcat:k4igyx4enjhnrod7wuwpflzb4a

Syntax-Guided Termination Analysis [chapter]

Grigory Fedyukovich, Yueling Zhang, Aarti Gupta
2018 Lecture Notes in Computer Science  
Importantly, FreqTerm is competitive with state-of-the-art on a wide range of terminating and non-terminating benchmarks, and it significantly outperforms state-of-the-art on proving non-termination of  ...  We present new algorithms for proving program termination and non-termination using syntax-guided synthesis.  ...  on the number of loop iterations, and applied tools to prove termination 9 (shown in Table 2 ).  ... 
doi:10.1007/978-3-319-96145-3_7 fatcat:ouq6ryb2vfda3c7dfuebrprvzm

Loop Summarization and Termination Analysis [chapter]

Aliaksei Tsitovich, Natasha Sharygina, Christoph M. Wintersteiger, Daniel Kroening
2011 Lecture Notes in Computer Science  
We present a technique for program termination analysis based on loop summarization. The algorithm relies on a library of abstract domains to discover well-founded transition invariants.  ...  In contrast to state-of-the-art methods it aims to construct a complete ranking argument for all paths through a loop at once, thus avoiding expensive enumeration of individual paths.  ...  In practice, termination analysis is at a point where industrial application of termination proving tools is feasible.  ... 
doi:10.1007/978-3-642-19835-9_9 fatcat:kfa6ag3pp5bdnfuzdk23ispgsq
« Previous Showing results 1 — 15 out of 229,334 results