In Machine Intelligence 4. 463--502. Mokkedem, A., and M'ery, D. 1994. A Stuttering Closed Temporal Logic for Modular Reasoning about Concurrent Programs. In Proceedings of the 1st International Conference on Temporal Logic (ICTL-94), 382--397. Springer.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
Deduction-based Refinement Planning - Werner Stephan, Susanne Biundo (1996)   (8 citations)  Self-citation (Intelligence)   (Correct)

....abstract operation has to be implemented by sequences of operations from the lower level. In order to enable such a refinement we have to allow for certain additional steps on the abstract level, thereby extending the set of possible computations. To this end, we adopt a method known as stuttering (Lamport 1994; Mokkedem M ery 1994). It allows for the insertion of additional steps which however do not affect the facts we are interested in on the abstract level so that we are still able to prove useful facts about the abstract solution. Stuttering versions of abstract operations still exhibit essentially the same behavior ....

In Machine Intelligence 4. 463--502. Mokkedem, A., and M'ery, D. 1994. A Stuttering Closed Temporal Logic for Modular Reasoning about Concurrent Programs. In Proceedings of the 1st International Conference on Temporal Logic (ICTL-94), 382--397. Springer.

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