Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs-Reference-Cited by-同舟云学术

Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs

Published:2010 Issue: Volume: Page:117-133
ISSN:0302-9743
Container-title:Static Analysis
language:
Short-container-title:

Author:

Alias Christophe,Darte Alain,Feautrier Paul,Gonnord Laure

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15769-1_8.pdf

Reference33 articles.

1. Alias, C., Darte, A., Feautrier, P., Gonnord, L.: Bounding the computational complexity of flowchart programs with multi-dimensional rankings. Research Report 7235, INRIA (March 2010)

2. Alias, C., Darte, A., Feautrier, P., Gonnord, L., Quinson, C.: Program termination and worst-time complexity with multi-dimensional affine ranking functions. Research Report 7037, INRIA (November 2009)

3. Lecture Notes in Computer Science;H. Anderson,2003

4. Ben-Amram, A.M.: Size-change termination with difference constraints. ACM Transactions on Programming Languages and Systems (TOPLAS) 30(3), 1–31 (2008)

5. Lecture Notes in Computer Science;A.M. Ben-Amram,2009

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

1. Program Analysis for Adaptive Data Analysis;Proceedings of the ACM on Programming Languages;2024-06-20

2. Quantitative Bounds on Resource Usage of Probabilistic Programs;Proceedings of the ACM on Programming Languages;2024-04-29

3. Lexicographic Ranking Supermartingales with Lazy Lower Bounds;Lecture Notes in Computer Science;2024

4. Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper);Lecture Notes in Computer Science;2024

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