A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In POPL'00, Cousot and Cousot showed that the classical state-based model checking of a very general temporal language called µ -calculus is an incomplete abstract interpretation of its trace-based semantics. In ESOP'01, Ranzato showed that the least refinement of the state-based model checking semantics of the µ -calculus which is complete w.r.t. its trace-based semantics exists, and it is essentially the tracebased semantics itself. The analogous problem in the opposite direction is solved bydoi:10.1007/3-540-45789-5_32 fatcat:mn7rsnqalzdn7fwbpmfwbojhwa