A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Fast, Flexible, and Minimal CTL Synthesis via SMT
[chapter]
2016
Lecture Notes in Computer Science
CTL synthesis [8] is a long-standing problem with applications to synthesising synchronization protocols and concurrent programs. We show how to formulate CTL model checking in terms of "monotonic theories", enabling us to use the SAT Modulo Monotonic Theories (SMMT) [5] framework to build an efficient SAT-modulo-CTL solver. This yields a powerful procedure for CTL synthesis, which is not only faster than previous techniques from the literature, but also scales to larger and more difficult
doi:10.1007/978-3-319-41528-4_8
fatcat:hqjdzwzaprgwtmoojkmbszhxqa