Download Integer Set Library: Manual
Transcript
Bibliography Barthou, D., A. Cohen, and J.-F. Collard (2000). Maximal static expansion. Int. J. Parallel Program. 28(3), 213–243. [59] Beletska, A., D. Barthou, W. Bielecki, and A. Cohen (2009). Computing the transitive closure of a union of affine integer tuple relations. In COCOA ’09: Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications, Berlin, Heidelberg, pp. 98–109. Springer-Verlag. [52, 53, 58, 59, 60] Kelly, W., V. Maslov, W. Pugh, E. Rosser, T. Shpeisman, and D. Wonnacott (1996a, November). The Omega calculator and library. Technical report, University of Maryland. [58] Kelly, W., V. Maslov, W. Pugh, E. Rosser, T. Shpeisman, and D. Wonnacott (1996b, November). The Omega library. Technical report, University of Maryland. [62] Kelly, W., W. Pugh, E. Rosser, and T. Shpeisman (1996c). Transitive closure of infinite graphs and its applications. In C.-H. Huang, P. Sadayappan, U. Banerjee, D. Gelernter, A. Nicolau, and D. A. Padua (Eds.), Languages and Compilers for Parallel Computing, 8th International Workshop, LCPC’95, Columbus, Ohio, USA, August 10-12, 1995, Proceedings, Volume 1033 of Lecture Notes in Computer Science, pp. 126–140. Springer. [52, 56, 59, 61, 62, 63] Schrijver, A. (1986). Theory of Linear and Integer Programming. John Wiley & Sons. [55] Tarjan, R. (1972). Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2), 146–160. [56] Verdoolaege, S. (2009, April). An integer set library for program analysis. Advances in the Theory of Integer Linear Optimization and its Extensions,AMS 2009 Spring Western Section Meeting, San Francisco, California, 25-26 April 2009. [52] 64