Titlebook: Logics and Models of Concurrent Systems; Krzysztof R. Apt Conference proceedings 1985 Springer-Verlag Heidelberg 1985 Invariant.Programm.S

neuron

到婚嫁年齡

In Transition From Global to Modular Temporal Reasoning about ProgramsThe role of Temporal Logic as a feasible approach to the specification and verification of concurrent systems is now widely accepted. A companion paper in this volume ([HP]) defines more precisely the area of applicability of Temporal Logic as that of . systems.

撫慰

Correctness Proofs of Distributed Termination AlgorithmsThe problem of correctness of the solutions to the distributed termination problem of Francez [F] is addressed. Correctness criteria are formalized in the customary framework for program correctness. A very simple proof method is proposed and applied to show correctness of a solution to the problem.

瘋狂

Theoretical Foundations for Non-Monotonic Reasoning in Expert SystemsSuppose we are given some collection of confirmed data items (information). We can assume that the information is represented as a set . of propositions of predicate logic. We look at . and try to use some sort of inference mechanism to extract more information out of ..

傳授知識(shí)

0258-1248 change between disjoint processes, as opposed to the interference freedom test [Owicki & Gries], being the proof theoretical analogue of concurrent communication by means of interference through jointly shared variables. Some authors ([Levin & Gries, Lamport & Schneider, Schlichting and Schneider])

Derogate

Script: A Communication Abstraction Mechanism and its Verificationof scripts to the languages CSP and Ada, and to a shared-variable language with monitors. Proof rules are presented for proving partial correctness and freedom from deadlock in concurrent programs using scripts.

Terrace

Conflagration

剝削

placebo

A Paradigm for Detecting Quiescent Properties in Distributed Computationscomputation. This paper presents a simple (almost trivial) algorithm to detect ., an important class of stable properties including those mentioned above. Distributed snapshots [7] may be used to derive algorithms for these problems. However our approach in this paper is different and results in simpler algorithms.