A Complete Method for the Synthesis of Linear Ranking Functions-Reference-Cited by-同舟云学术

A Complete Method for the Synthesis of Linear Ranking Functions

Published:2004 Issue: Volume: Page:239-251
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Podelski Andreas,Rybalchenko Andrey

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24622-0_20

Reference18 articles.

1. Bjørner, N., Browne, A., Manna, Z.: Automatic generation of invariants and intermediate assertions. Theoretical Computer Science 173(1), 49–87 (1997)

2. Burkart, O., Steffen, B.: Model checking the full modal mucalculus for infinite sequential processes. Theoretical Computer Science 221, 251–270 (1999)

3. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proc. of POPL 1978: Symp. on Principles of Programming Languages, pp. 84–97. ACM Press, New York (1978)

4. Lecture Notes in Computer Science;M. Colon,2001

5. Lecture Notes in Computer Science;M. Colon,2002

Cited by 203 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mostly Automated Verification of Liveness Properties for Distributed Protocols with Ranking Functions;Proceedings of the ACM on Programming Languages;2024-01-05

2. Termination of triangular polynomial loops;Formal Methods in System Design;2023-12-04

3. Asparagus: Automated Synthesis of Parametric Gas Upper-Bounds for Smart Contracts;Proceedings of the ACM on Programming Languages;2023-10-16

4. Solving Recurrence Relations using Machine Learning, with Application to Cost Analysis;Electronic Proceedings in Theoretical Computer Science;2023-09-12

5. Automated Expected Value Analysis of Recursive Programs;Proceedings of the ACM on Programming Languages;2023-06-06