Presburger Arithmetic and Its Use in Verification

More documents

Recommendations

Info

REFERENCES [12] Tuukka Haapasalo. Multicore Programming: Implicit Parallelism. http:// www.cs.hut.fi/~tlilja/multicore, 2009. [13] Youssef Hamadi and Lakhdar Sais. ManySAT: a parallel SAT solver. Journal on Satisfiability, Boolean Modeling and Computation (JSAT, 2009. [14] Michael R. Hansen. Duration Calculus. Technical report, Informatics and Mathematical Modelling Technical University of Denmark, 2010. [15] Michael R. Hansen and Aske Wiid Brekling. On Tool Support for Duration Calculus on the basis of Presburger Arithmetic. In TIME 2011 (to be appeared), 2011. [16] Mark D. Hill and Michael R. Marty. Amdahl’s Law in the Multicore Era. Computer, July2008. [17] Predrag Janicic, Ian Green, and Alan Bundy. A comparison of decision procedures in Presburger arithmetic. In University of Novi Sad, 1997. [18] Daniel Kroening and Ofer Strichman. Decision Procedures: An Algorithmic Point of View. SpringerPublishingCompany,Incorporated,2008. [19] Chris Lyon. Server, Workstation and Concurrent GC. MSDN, 2004. [20] David C.J. Matthews and Makarius Wenzel. Efficient parallel programming in Poly/ML and Isabelle/ML. In Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming, DAMP’10.ACM,2010. [21] Timothy Mattson, Beverly Sanders, and Berna Massingill. Patterns for Parallel Programming. Addison-WesleyProfessional,2004. [22] Michael Norrish. Complete integer decision procedures as derived rules in HOL. In Theorem Proving in Higher Order Logics, TPHOLs 2003, volume 2758 of Lect. Notes in Comp. Sci. Springer-Verlag,2003. [23] Derek C. Oppen. Elementary bounds for presburger arithmetic. In Proceedings of the fifth annual ACM symposium on Theory of computing, pages 34–37. ACM, 1973. [24] Derek C. Oppen. A 222pn upper bound on the complexity of Presburger Arithmetic. Journal of Computer and System Sciences, 1978. [25] Igor Ostrovsky. Parallel Programming in .NET 4: Coding Guidelines, 2011. [26] Harald Prokop. Cache-Oblivious Algorithms, 1999. [27] William Pugh. The Omega test: a fast and practical integer programming algorithm for dependence analysis. In Proceedings of the 1991 ACM/IEEE conference on Supercomputing. ACM,1991. 64
[28] C. R. Reddy and D. W. Loveland. Presburger arithmetic with bounded quantifier alternation. In Proceedings of the tenth annual ACM symposium on Theory of computing. ACM,1978. [29] Microsoft Research. Practical Parallel and Concurrent Programming: Course Overview. http://ppcp.codeplex.com/, 2011. [30] Robert E. Shostak. On the SUP-INF Method for Proving Presburger Formulas. J. ACM, October1977. [31] Ryan Stansifer. Presburgerś Article on Integer Airthmetic: Remarks and Translation. Technical report, Cornell University, Computer Science Department, September 1984. [32] Herb Sutter. The Free Lunch Is Over: A Fundamental Turn Toward Concurrency in Software. Dr. Dobb’s Journal, 30,2005. 65
Page 1 and 2:
Presburger Arithmetic and Its Use i
Page 3 and 4:
Abstract Today, when every computer
Page 5 and 6:
Preface The thesis is a part of the
Page 7:
List of Abbreviations CPU DAG DC DN
Page 10 and 11:
5.2 Simplification of Presburger fo
Page 12 and 13:
CHAPTER 1. INTRODUCTION functional
Page 15 and 16:
Chapter 2 Multicore parallelism on
Page 17 and 18:
2.1. MULTICORE PARALLELISM: A BRIEF
Page 19 and 20:
2.2. MULTICORE PARALLELISM ON .NET
Page 21 and 22:
2.2. MULTICORE PARALLELISM ON .NET
Page 23 and 24: 2.2. MULTICORE PARALLELISM ON .NET
Page 29 and 30: Chapter 3 Functional paradigm and m
Page 31 and 32: 3.1. PARALLEL FUNCTIONAL ALGORITHMS
Page 33 and 34: 3.2. SOME PITFALLS OF FUNCTIONAL PA
Page 35 and 36: 3.2. SOME PITFALLS OF FUNCTIONAL PA
Page 37 and 38: Chapter 4 Theory of Presburger Arit
Page 39 and 40: 4.2. DECISION PROCEDURES FOR PRESBU
Page 45 and 46: Chapter 5 Duration Calculus and Pre
Page 47 and 48: 5.1. DURATION CALCULUS AND SIDE-CON
Page 49 and 50: 5.2. SIMPLIFICATION OF PRESBURGER F
Page 51: 5.3. SUMMARY occur in equation do n
Page 54 and 55: CHAPTER 6. EXPERIMENTS ON PRESBURGE
Page 56 and 57: CHAPTER 6. EXPERIMENTS ON PRESBURGE
Page 59 and 60: Chapter 7 Parallel execution of dec
Page 61 and 62: 7.1. A PARALLEL VERSION OF COOPER
Page 63 and 64: 7.1. A PARALLEL VERSION OF COOPER
Page 65 and 66: 7.2. A PARALLEL VERSION OF THE OMEG
Page 71 and 72: Chapter 8 Conclusions In this work,
Page 73: References [1] Nikolaj Bjørner. Li
Page 78 and 79: APPENDIX A. EXAMPLES OF MULTICORE P
Page 80 and 81: APPENDIX A. EXAMPLES OF MULTICORE P
Page 82 and 83: APPENDIX B. SOURCE CODE OF EXPERIME
Page 100: TRITA-CSC-E 2011:108 ISRN-KTH/CSC/E
show all

Presburger Arithmetic and Its Use in Verification

Create successful ePaper yourself

Delete template?

Save as template?