Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Temporal logics need their clocks
Sain I. Theoretical Computer Science95 (1):75-95,1992.Type:Article
Date Reviewed: Mar 1 1993

Sain investigates soundness and completeness issues in first-order temporal logics. The focus of the paper is on nonstandard characterizations of the power of temporal proof systems. (In a nonstandard result, time is not necessarily assumed to be isomorphic to the natural numbers; transfinite times are possible.)

Some time ago, I had obtained soundness and completeness results that relied on the definition and use of a formal notion of “clocks.” Roughly, those results assume the existence of a variable that keeps changing values, like a clock. This paper proves that these clocks are in fact needed for completeness. It also addresses other difficult open problems in the area and corrects an unfortunate mistake I had made. The proofs are clever and puzzling at times, as is often the case in nonstandard studies. Therefore, the paper is challenging, but it should be of interest to researchers in the foundations of verification methods.

Reviewer:  M. Abadi Review #: CR116949
Bookmark and Share
 
Logics Of Programs (F.3.1 ... )
 
 
Mechanical Verification (F.3.1 ... )
 
 
Model Theory (F.4.1 ... )
 
 
Proof Theory (F.4.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Logics Of Programs": Date
Weak logic theory
Holden M. Theoretical Computer Science 79(2): 295-321, 1991. Type: Article
Mar 1 1992
Completing the temporal picture
Manna Z., Pnueli A. (ed) Theoretical Computer Science 83(1): 97-130, 1991. Type: Article
Apr 1 1992
Partial correctness: the term-wise approach
Sokolowski S. Science of Computer Programming 4(2): 141-157, 1984. Type: Article
Mar 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy