Philippe Schnoebelen. Oracle circuits for branching-time model checking. In Proc. 30th Int. Coll. Automata, Languages, and Programming (ICALP'2003), Eindhoven, NL, July 2003, volume 2719 of Lecture Notes in Computer Science. Springer, 2001. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Past is for Free: on the Complexity of Verifying Linear Temporal.. - Markey (2004) (5 citations) (Correct)
No context found.
Philippe Schnoebelen. Oracle circuits for branching-time model checking. In Proc. 30th Int. Coll. Automata, Languages, and Programming (ICALP'2003), Eindhoven, NL, July 2003, volume 2719 of Lecture Notes in Computer Science. Springer, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC