Subject
General Computer Science,Theoretical Computer Science
Reference29 articles.
1. A control-flow normalization algorithm and its complexity;Ammarguellat;IEEE Trans. Software Eng.,1992
2. A modular static analysis approach to affine loop invariants detection;Ancourt;Electr. Notes Theor. Comput. Sci.,2010
3. Anna Beletska, Denis Barthou, Wlodzimierz Bielecki, and Albert Cohen. Computing the transitive closure of a union of affine integer tuple relations. In COCOA, pages 98–109, 2009.
4. Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, and Andrey Rybalchenko. Path invariants. In PLDI, pages 300–309, 2007.
5. Abstract interpretation by dynamic partitioning;Bourdoncle;J. Funct. Program.,1992
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Disjunctive Relational Abstract Interpretation for Interprocedural Program Analysis;Lecture Notes in Computer Science;2019
2. A guess-and-assume approach to loop fusion for program verification;Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM '18;2018
3. A guess-and-assume approach to loop fusion for program verification;Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation;2017-12-25
4. Programs from Proofs;ACM Transactions on Programming Languages and Systems;2017-05-29
5. Computing Invariants with Transformers: Experimental Scalability and Accuracy;Electronic Notes in Theoretical Computer Science;2014-09