A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Boolean Abstraction for Temporal Logic Satisfiability
[chapter]
Computer Aided Verification
Preserved Fulltext
Motivation 2 ⇒ Property-based system design (PROSYD): work at the level of requirements. ⇒ In model checking, focus is on dealing with complexity in the model. ⇒ Satisfiability of large temporal formulas can be hard. (e.g., [Rozier, Vardi (SPIN'07)])
doi:10.1007/978-3-540-73368-3_53
dblp:conf/cav/CimattiRST07
fatcat:b7p6a3qd5rhfxp2ylomjawsqaa