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
Lecture Notes in Computer Science
This paper presents a symbolic model checking algorithm for Fixpoint Logic with Chop, an extension of the modal µ-calculus capable of defining non-regular properties. Some empirical data about running times of a naive implementation of this algorithm are given as well.doi:10.1007/978-3-540-27813-9_7 fatcat:gizk33jb3jghdndfjrebkx25iu