Computing the Transitive Closure of a Union of Affine Integer Tuple Relations-Reference-Cited by-同舟云学术

Computing the Transitive Closure of a Union of Affine Integer Tuple Relations

Published:2009 Issue: Volume: Page:98-109
ISSN:0302-9743
Container-title:Combinatorial Optimization and Applications
language:
Short-container-title:

Author:

Beletska Anna,Barthou Denis,Bielecki Wlodzimierz,Cohen Albert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02026-1_9

Reference11 articles.

1. Lecture Notes in Computer Science;C. Alias,2005

2. Lecture Notes in Computer Science;D. Barthou,2002

3. Beletska, A., Bielecki, W., San Pietro, P.: Extracting coarse-grained parallelism in program loops with the slicing framework. In: ISPDC 2007: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing, p. 29. IEEE Computer Society Press, Washington (2007)

4. Bielecki, W., Klimek, T., Trifunovic, K.: Calculating exact transitive closure for a normalized affine integer tuple relation. Journal of Electronic Notes in Discrete Mathematics 33, 7–14 (2009)

5. Boigelot, B.: Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, Université de Liège (1998)

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

1. Abstract acceleration in linear relation analysis;Science of Computer Programming;2014-11

2. Using basis dependence distance vectors in the modified Floyd–Warshall algorithm;Journal of Combinatorial Optimization;2014-04-30

3. Transitive Closure of a Union of Dependence Relations for Parameterized Perfectly-Nested Loops;Lecture Notes in Computer Science;2013

4. Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm;Combinatorial Optimization and Applications;2013

5. Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach;Electronic Notes in Theoretical Computer Science;2012-12