Internet Archive Scholar
Filters
























3 Hits in 1.9 sec

Termination and non-termination specification inference

Ton Chanh Le, Shengchao Qin, Wei-Ngan Chin
2015 Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (702.5 kB)
https://web.archive.org/web/20170922005501/http://tees.openrepository.com/tees/bitstream/10149/594423/2/594423.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

We first introduce the concept of second-order termination constraints and accumulate a set of relational assumptions on them via a Hoare-style verification.  ...  In this paper, we propose a novel mechanism that analyzes and proves both program termination and non-termination at the same time.  ...  Pham, Quang-Trung Ta, Quang Loc Le, Andreea Costea and Zhuohong Cai for their help in preparing HIPTNT+ for the SV-COMP 2015 competition.  ... 
doi:10.1145/2737924.2737993 dblp:conf/pldi/LeQC15 fatcat:zu2xncazjrdkfbrkyj2td6ylxi
Citation

Ton Chanh Le, Shengchao Qin, Wei-Ngan Chin. "Termination and non-termination specification inference." Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015 (2015) 489-498

Termination and non-termination specification inference

Ton Chanh Le, Shengchao Qin, Wei-Ngan Chin
2015 SIGPLAN notices  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (702.5 kB)
https://web.archive.org/web/20170922005501/http://tees.openrepository.com/tees/bitstream/10149/594423/2/594423.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

We first introduce the concept of second-order termination constraints and accumulate a set of relational assumptions on them via a Hoare-style verification.  ...  In this paper, we propose a novel mechanism that analyzes and proves both program termination and non-termination at the same time.  ...  Pham, Quang-Trung Ta, Quang Loc Le, Andreea Costea and Zhuohong Cai for their help in preparing HIPTNT+ for the SV-COMP 2015 competition.  ... 
doi:10.1145/2813885.2737993 fatcat:htl4zgci5vafrkb6eoq63i7zbu
Citation

Ton Chanh Le, Shengchao Qin, Wei-Ngan Chin. "Termination and non-termination specification inference." SIGPLAN notices 50.6 (2015) 489-498

Bit-Precise Procedure-Modular Termination Analysis

Hong-Yi Chen, Cristina David, Daniel Kroening, Peter Schrammel, Björn Wachter, Apollo-University Of Cambridge Repository, Apollo-University Of Cambridge Repository
2019

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (527.8 kB)
https://web.archive.org/web/20220119141833/https://www.repository.cam.ac.uk/bitstream/handle/1810/294332/paper.pdf;jsessionid=FB9A21AEC85152612D1B52C12AE25644?sequence=3

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL. The file type is application/pdf.

Non-termination is the root cause of a variety of program bugs, such as hanging programs and denial-ofservice vulnerabilities.  ...  We present a modular termination analysis for C programs using template-based interprocedural summarisation.  ...  to safety proving and Le et al. [2015] use bi-abduction to construct summaries of terminating and non-terminating behaviours for each method.  ... 
doi:10.17863/cam.41431 fatcat:dhy4ameacveyvmdaorxfj6wiui
Citation

Hong-Yi Chen, Cristina David, Daniel Kroening, Peter Schrammel, Björn Wachter, Apollo-University Of Cambridge Repository, Apollo-University Of Cambridge Repository. "Bit-Precise Procedure-Modular Termination Analysis." (2019)