Presburger Arithmetic and Its Use in Verification
Presburger Arithmetic and Its Use in Verification
Presburger Arithmetic and Its Use in Verification
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
REFERENCES<br />
[12] Tuukka Haapasalo. Multicore Programm<strong>in</strong>g: Implicit Parallelism. http://<br />
www.cs.hut.fi/~tlilja/multicore, 2009.<br />
[13] Youssef Hamadi <strong>and</strong> Lakhdar Sais. ManySAT: a parallel SAT solver. Journal<br />
on Satisfiability, Boolean Model<strong>in</strong>g <strong>and</strong> Computation (JSAT, 2009.<br />
[14] Michael R. Hansen. Duration Calculus. Technical report, Informatics <strong>and</strong><br />
Mathematical Modell<strong>in</strong>g Technical University of Denmark, 2010.<br />
[15] Michael R. Hansen <strong>and</strong> Aske Wiid Brekl<strong>in</strong>g. On Tool Support for Duration<br />
Calculus on the basis of <strong>Presburger</strong> <strong>Arithmetic</strong>. In TIME 2011 (to be appeared),<br />
2011.<br />
[16] Mark D. Hill <strong>and</strong> Michael R. Marty. Amdahl’s Law <strong>in</strong> the Multicore Era.<br />
Computer, July2008.<br />
[17] Predrag Janicic, Ian Green, <strong>and</strong> Alan Bundy. A comparison of decision procedures<br />
<strong>in</strong> <strong>Presburger</strong> arithmetic. In University of Novi Sad, 1997.<br />
[18] Daniel Kroen<strong>in</strong>g <strong>and</strong> Ofer Strichman. Decision Procedures: An Algorithmic<br />
Po<strong>in</strong>t of View. Spr<strong>in</strong>gerPublish<strong>in</strong>gCompany,Incorporated,2008.<br />
[19] Chris Lyon. Server, Workstation <strong>and</strong> Concurrent GC. MSDN, 2004.<br />
[20] David C.J. Matthews <strong>and</strong> Makarius Wenzel. Efficient parallel programm<strong>in</strong>g <strong>in</strong><br />
Poly/ML <strong>and</strong> Isabelle/ML. In Proceed<strong>in</strong>gs of the 5th ACM SIGPLAN workshop<br />
on Declarative aspects of multicore programm<strong>in</strong>g, DAMP’10.ACM,2010.<br />
[21] Timothy Mattson, Beverly S<strong>and</strong>ers, <strong>and</strong> Berna Mass<strong>in</strong>gill. Patterns for Parallel<br />
Programm<strong>in</strong>g. Addison-WesleyProfessional,2004.<br />
[22] Michael Norrish. Complete <strong>in</strong>teger decision procedures as derived rules <strong>in</strong> HOL.<br />
In Theorem Prov<strong>in</strong>g <strong>in</strong> Higher Order Logics, TPHOLs 2003, volume 2758 of<br />
Lect. Notes <strong>in</strong> Comp. Sci. Spr<strong>in</strong>ger-Verlag,2003.<br />
[23] Derek C. Oppen. Elementary bounds for presburger arithmetic. In Proceed<strong>in</strong>gs<br />
of the fifth annual ACM symposium on Theory of comput<strong>in</strong>g, pages 34–37.<br />
ACM, 1973.<br />
[24] Derek C. Oppen. A 222pn upper bound on the complexity of <strong>Presburger</strong> <strong>Arithmetic</strong>.<br />
Journal of Computer <strong>and</strong> System Sciences, 1978.<br />
[25] Igor Ostrovsky. Parallel Programm<strong>in</strong>g <strong>in</strong> .NET 4: Cod<strong>in</strong>g Guidel<strong>in</strong>es, 2011.<br />
[26] Harald Prokop. Cache-Oblivious Algorithms, 1999.<br />
[27] William Pugh. The Omega test: a fast <strong>and</strong> practical <strong>in</strong>teger programm<strong>in</strong>g<br />
algorithm for dependence analysis. In Proceed<strong>in</strong>gs of the 1991 ACM/IEEE<br />
conference on Supercomput<strong>in</strong>g. ACM,1991.<br />
64
Change language