J. Field, D. Goyal, G. Ramalingam, and E. Yahav. Shallow finite state verification. Technical Report RC22673, IBM T.J. Watson Research Center, Dec. 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Typestate Verification: Abstraction Techniques and.. - Field Goyal Ramalingam (2003) (2 citations) Self-citation (Field Goyal Ramalingam Yahav) (Correct)
No context found.
J. Field, D. Goyal, G. Ramalingam, and E. Yahav. Shallow finite state verification. Technical Report RC22673, IBM T.J. Watson Research Center, Dec. 2002.
Typestate Verification: Abstraction Techniques and.. - Field, Goyal.. (2004) (2 citations) Self-citation (Field Goyal Ramalingam Yahav) (Correct)
No context found.
J. Field, D. Goyal, G. Ramalingam, and E. Yahav. Shallow finite state verification. Technical Report RC22673, IBM T.J. Watson Research Center, Dec. 2002.
Typestate Verification: Abstraction Techniques and.. - Field, Goyal.. (2003) (2 citations) Self-citation (Field Goyal Ramalingam Yahav) (Correct)
....enabling sequence property, but we use open ; read as the running example to contrast it with the omission closed property read # ; close. We show that verification of repeatable enabling sequence properties is PSPACEcomplete by reduction from the simultaneously false problem (see [20] [11]) Definition 12. Simultaneously False Problem) Given a program P with an initial assignment of values (0 or 1) to a set x1 , x2 , xn of boolean variables, where the program P contains only q 2 q 3 , Fig. 8. An automaton for the property open ; read. assignments (of constants ....
....from the entry point of P to a program point p such that x1 = 0, x2 = 0, xk = 0 when control reaches p Lemma 1. 1) The simultaneously false problem for acyclic programs is NP complete. 2) The simultaneously false problem for arbitrary programs is PSPACE complete. Proof. See [20] and [11]. be an automaton representing a repeatable enabling sequence property. We show that SVF is PSPACE hard by reduction from the simultaneously false problem. If #, #, # are such that sequences ## # are valid and sequence ## is invalid, then # and # must be non empty (although # may be ....
J. Field, D. Goyal, G. Ramalingam, and E. Yahav. Shallow finite state verification. Technical Report RC22673, IBM T.J. Watson Research Center, Dec. 2002.
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