Katz S, Peled D. An efficient verification method for parallel and distributed programs. In: deBakker, et al., eds. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Springer; 1988:. LNCS.

Kesten Y, Pnueli A. A complete axiomatization of qptl. In: Proc. 10th Ann. IEEE Symp. on Logic in Computer Science (LICS '95). 1995:2–12.

Kimura S. Residue BDD and its application to the verification of arithmetic circuits. In: Proc. 32nd Int. Design Automation Conference (DAC '95). 1995.

Kindred D, Wing JM. Fast, automatic checking of security protocols. In: USENIX 2nd Workshop on Electronic Commerce. 1996.

Kozen D. Results on the propositional µ-calculus. Theoretical Computer Science. 1983;27:333–354.

Kozen D, Parikh ...

Get Handbook of Automated Reasoning now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial