Recognizing safety and liveness
暂无分享,去创建一个
[1] Leslie Lamport,et al. What Good is Temporal Logic? , 1983, IFIP Congress.
[2] Zohar Manna,et al. Verification of concurrent programs, Part I: The temporal framework , 1981 .
[3] Bowen Alpern,et al. Proving Boolean Combinations of Deterministic Properties , 1987, Logic in Computer Science.
[4] Zohar Manna,et al. Specification and verification of concurrent programs by A∀automata , 1987, POPL '87.
[5] Bowen Alpern,et al. Safety Without Stuttering , 1986, Inf. Process. Lett..
[6] Jørgen Staunstrup. Specification and Verification of Concurrent Programs , 1979 .
[7] Moshe Y. Vardi. Verification of Concurrent Programs: The Automata-Theoretic Framework , 1991, Ann. Pure Appl. Log..
[8] Bowen Lewis Alpern. Proving temporal properties of concurrent programs: a non-temporal approach , 1986 .
[9] Bowen Alpern,et al. Verifying Temporal Properties without using Temporal Logic , 2001 .
[10] Bowen Alpern,et al. Defining Liveness , 1984, Inf. Process. Lett..
[11] Pierre Wolper,et al. The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract) , 1985, ICALP.
[12] Pierre Wolper. Temporal Logic Can Be More Expressive , 1983, Inf. Control..
[13] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[14] Leslie Lamport,et al. Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.
[15] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.
[16] A. Prasad Sistla,et al. On characterization of safety and liveness properties in temporal logic , 1985, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.
[17] Amir Pnueli,et al. The Glory of the Past , 1985, Logic of Programs.