TY - GEN
T1 - CGCExplorer
T2 - PLDI'07: 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation
AU - Vechev, Martin T.
AU - Yahav, Eran
AU - Bacon, David F.
AU - Rinetzky, Noam
PY - 2007
Y1 - 2007
N2 - Concurrent garbage collectors are notoriously hard to design, implement, and verify. We present a framework for the automatic exploration of a space of concurrent mark-and-sweep collectors. In our framework, the designer specifies a set of "building blocks" from which algorithms can be constructed. These blocks reflect the designer's insights about the coordination between the collector and the mutator. Given a set of building blocks, our framework automatically explores a space of algorithms, using model checking with abstraction to verify algorithms in the space. We capture the intuition behind some common mark-and-sweep algorithms using a set of building blocks. We utilize our framework to automatically explore a space of more than 1,600,000 algorithms built from these blocks, and derive over 100 correct fine-grained algorithms with various space, synchronization, and precision tradeoffs.
AB - Concurrent garbage collectors are notoriously hard to design, implement, and verify. We present a framework for the automatic exploration of a space of concurrent mark-and-sweep collectors. In our framework, the designer specifies a set of "building blocks" from which algorithms can be constructed. These blocks reflect the designer's insights about the coordination between the collector and the mutator. Given a set of building blocks, our framework automatically explores a space of algorithms, using model checking with abstraction to verify algorithms in the space. We capture the intuition behind some common mark-and-sweep algorithms using a set of building blocks. We utilize our framework to automatically explore a space of more than 1,600,000 algorithms built from these blocks, and derive over 100 correct fine-grained algorithms with various space, synchronization, and precision tradeoffs.
KW - Concurrent algorithms
KW - Concurrent garbage collection
KW - Synthesis
KW - Verification
UR - http://www.scopus.com/inward/record.url?scp=35448963440&partnerID=8YFLogxK
U2 - 10.1145/1250734.1250787
DO - 10.1145/1250734.1250787
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:35448963440
SN - 1595936335
SN - 9781595936332
T3 - Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
SP - 456
EP - 467
BT - PLDI'07
Y2 - 10 June 2007 through 13 June 2007
ER -