Speeding up Polyhedral Analysis by Identifying Common Constraints-Reference-Cited by-同舟云学术

Speeding up Polyhedral Analysis by Identifying Common Constraints

Published:2010-10 Issue:1 Volume:267 Page:127-138
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Simon Axel

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference15 articles.

1. A Linear Algebra Framework for Static High Performance Fortran Code Distribution;Ancourt;Scientific Programming,1997

2. Not Necessarily Closed Convex Polyhedra and the Double Description Method;Bagnara;Formal Aspects of Computing,2005

3. Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems;Balas;J. on Algebraic and Discrete Methods,1985

4. Benoy, F., “Polyhedral Domains for Abstract Interpretation in Logic Programming,” Ph.D. thesis, Computing Lab., University of Kent, Canterbury, UK (2002).

5. Cousot, P. and N. Halbwachs, Automatic Discovery of Linear Constraints among Variables of a Program, in: Principles of Programming Languages (1978), pp. 84–97.

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

1. Combining Static and Dynamic Analysis to Query Characteristics of HPC Applications;2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2021-06

2. A practical construction for decomposing numerical abstract domains;Proceedings of the ACM on Programming Languages;2018-01

3. Fast polyhedra abstract domain;ACM SIGPLAN Notices;2017-05-11

4. Fast polyhedra abstract domain;Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages;2017-01