Fast Computation of Arbitrary Control Dependencies-Reference-Cited by-同舟云学术

Fast Computation of Arbitrary Control Dependencies

Published:2018 Issue: Volume: Page:207-224
ISSN:0302-9743
Container-title:Fundamental Approaches to Software Engineering
language:
Short-container-title:

Author:

Léchenet Jean-Christophe^ORCID,Kosmatov Nikolai^ORCID,Le Gall Pascale

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-89363-1_12

Reference27 articles.

1. Why3, a tool for deductive program verification, GNU LGPL 2.1, development version, January 2018. http://why3.lri.fr

2. Amtoft, T.: Slicing for modern program structures: a theory for eliminating irrelevant loops. Inf. Process. Lett. 106(2), 45–51 (2008)

3. Amtoft, T., Androutsopoulos, K., Clark, D.: Correctness of slicing finite state machines. Technical report RN/13/22. University College London, December 2013

4. Lecture Notes in Computer Science;T Amtoft,2016

5. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-662-07964-5

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

1. Efficient computation of arbitrary control dependencies;Theoretical Computer Science;2023-08

2. The Duality in Computing SSA Programs and Control Dependency;IEEE Transactions on Software Engineering;2023-04-01

3. On the computation of interprocedural weak control closure;Proceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction;2022-03-18

4. Efficient computation of minimal weak and strong control closure;Journal of Systems and Software;2022-02

5. Fast and Incremental Computation of Weak Control Closure;Static Analysis;2022