Summary: [12] D. Peled. Combining partial order reductions with on­the­fly model checking. Sixth Conference on Computer
Aided Verification, LNCS 818, 377--390, 1994.
[13] A. Pnueli. The temporal logic of programs. 18th Symposium on Foundations of Computer Science, 46--77,
1977.
[14] W. Penczek and R. Kuiper. Traces and logic. In V. Diekert, G. Rozenberg (eds.) The Book of Traces, World
Scientific, 307--390, 1995.
[15] W. Penczek. On undecidability of propositional temporal logics on trace systems. Information Processing
Letters 43, 147--153, 1992.
[16] D. Peled and A. Pnueli. Proving partial order properties. Theoretical Computer Science 126, 143--182, 1994.
[17] S. Pinter and P. Wolper. A temporal logic for reasoning about partially ordered computations. Third Symposium
on Principles of Distributed Computing, 28--37, 1984.
[18] V.R. Pratt. Modeling concurrency with partial orders. Intl. J. of Parallel Programming 15 (1), 33--71, 1986.
[19] P.S. Thiagarajan. A trace based extension of linear time temporal logic. Ninth Symposiumon Logic in Computer
Science, 1994.
[20] P.S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz
traces. 12th Symposium on Logic in Computer Science, 1997.
[21] A. Valmari. A Stubborn attack on state explosion. Proc. 2nd Conference on Computer­Aided Verification,
LNCS 531, 156--165, 1990.
[22] M.Y. Vardi and P. Wolper. An automata­theoretic approach to automatic program verification. First Symposium
on Logic in Computer Science, 332--344, 1986.

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

Collections: Computer Technologies and Information Sciences