CGCExplorer: A semi-automated search procedure for provably correct concurrent collectors

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2007, Pages 456-467

  Vechev, Martin T ^a   Yahav, Eran ^b   Bacon, David F ^b   Rinetzky, Noam ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b IBM RESEARCH   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Concurrent algorithms; Concurrent garbage collection; Synthesis; Verification

Indexed keywords

CONCURRENT ALGORITHMS; CONCURRENT GARBAGE COLLECTION; GARBAGE COLLECTORS;

ABSTRACTING; ALGORITHMS; SYNCHRONIZATION; VERIFICATION;

CONCURRENT ENGINEERING;

EID: 35448963440     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250734.1250787     Document Type: Conference Paper

References (25)

1. BAR-DAVID, Y, AND TAUBENFELD, G. Automatic discovery of mutual exclusion algorithms. In Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing (2003).
2. BARABASH, K., OSSIA, Y., AND PETRANK, E. Mostly concurrent garbage collection revisited. In Proceedings of the 18th ACM conference on Object-oriented programing, systems, languages, and applications (2003).
3. BEN-ARI, M. Algorithms for on-the-fly garbage collection. ACM Trans. Program. Lang. Syst. 6, 3 (1984).
4. BIRKEDAL, L., TORP-SMITH, N., AND REYNOLDS, J. C. Local reasoning about a copying garbage collector. In Proceedings of the 31st ACM Symposium on Principles of Programming Languages (2004).
5. BOWMAN, H., DERRICK, J., AND JONES, R. E. Modelling garbage collection algorithms. In Proceedings of International Computing Symposium (1994).
6. BURDY, L. B VS. Coq to prove a garbage collector. In the 14th International Conference on Theorem Proving in Higher Order Logics: Supplemental Proceedings (2001).
7. DAS, M., LERNER, S., AND SEIGLE, M. ESP: Path-sensitive program, verification in polynomial time. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (2002).
8. DEMMERS, A., WEISER, M., HAYES, B., BOEHM, H., BOBROW, D., AND SHENKER, S. Combining generational and conservative garbage collection: framework and implementations. In Proceedings of the 17th ACM symposium on Principles of programming languages (1990).
9. DEWAR, R. B. K., SHIRAR, M., AND WEIXELBAUM, E. Transformational derivation of a garbage collection algorithm. ACM Trans. Program. Lang. Syst. 4, 4 (1982).
10. DIJKSTRA, E. W., LAMPORT, L., MARTIN, A. J., SCHOLTEN, C. S., AND STEFFENS, E. F. M. On-the-fly garbage collection: an exercise in cooperation. Commun. ACM 21, 11 (1978).
11. GRIES, D. An exercise in proving parallel programs correct. Commun. ACM 20, 12 (1977).
12. GRIES, D. Corrigendum. Commun. ACM 21, 12 (December 1978), 1048.
13. HACKETT, B., AND RUGINA, R. Region-based shape analysis with tracked locations. In Proceedings of the 32nd ACM Symposium on Principles of Programming Languages (2005), ACM.
14. H AVELUND, K. Mechanical verification of a garbage collector. In Fourth International Workshop on Formal Methods for Parallel Programming: Theory and Applications (1999).
15. JACKSON, P. B. Verifying a garbage collection algorithm. In Theorem Proving in Higher Order Logics, 11th International Conference (1998).
16. MASSALIN, H. Superoptimizer: a look at the smallest program. In the 2nd International Conference on Architectural Support for Programming Languages and Operating Systems (1987).
17. PAULSON, L. Isabelle: A Generic Theorem Prover, vol. 828 of Lecture Notes in Computer Science. 1994.
18. PRENSA NIETO, L., AND ESPARZA, J. Verifying single and multimutator garbage collectors with Owicki/Gries in Isabelle/HOL. In Mathematical Foundations of Computer Science (2000).
19. RUSSINOFF, D. M. A mechanically verified incremental garbage collector. Formal Aspects of Computing 6, 4 (1994).
20. SAGIV, M., REPS, T., AND WILHELM, R. Parametric shape analysis via 3-valued logic. ACM Trans, on Prog. Lang, and Systems 24, 3 (2002).
21. SOLAR-LEZAMA, A., RABBAH, R. M., BODÍK, R., AND EBCIOGLU, K. Programming by sketching for bit-streaming programs. In Proceedings of the ACM Conference on Programming Language Design and Implementation (2005).
22. TAKAHASHI, K. Abstraction and Search in Verification by State Exploration. PhD thesis, University of Tokyo, Jan. 2002.
23. VECHEV, M. Derivation And Evaluation Of Concurrent Collectors. PhD thesis, University of Cambridge, 2007.
24. VECHEV, M. T., YAHAV, E., AND BACON, D. F. Correctness-preserving derivation of concurrent garbage collection algorithms. In Proceedings of the ACM Conference on Programming Language Design and Implementation (2006).
25. YAHAV, E., AND RAMALINGAM, G. Verifying safety properties using separation and heterogeneous abstractions. In Proceedings of the ACM conference on Programming language design and implementation (2004).