Titlebook: Computer Aided Verification; Fourth International Gregor Bochmann,David Karl Probst Conference proceedings 1993 Springer-Verlag Berlin Heid

PTCA635

Modular abstractions for verifying real-time distributed systems,

GEM

Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits,

大漩涡

神刊

Verifying timed behavior automata with nonbinary delay constraints, questions of graph connectivity become questions of constraint graph satisfaction that are computed by optimized linear-time shortest-path algorithms. In the generalized TBA model, nondeterministic input choice is process-scheduled testing of an environment-controlled state predicate; the generaliz

畸形

Timing verification by successive approximation,sion question..We first construct .., the composition of the .. ignoring the delay constraints, and try to prove the language inclusion .. If this succeeds, then .. If this fails, we can find . of the form x = .′ σ.. We give an algorithm to check for consistency of x with respect to the delay bounds

你不公正

BRIBE

Layering techniques for development of parallel systems,re particularly interesting for the . of concurrent systems. One of these is an algebraic formulation of the communication closed layers principle by [EF82]. These laws suffice to rewrite process terms that avoid specification of temporal ordering into a unique normal form. Other transformations all

冲突

Palliation

Using a theorem prover for reasoning about concurrent algorithms,Logic of Actions (TLA). Using this formalisation, the proof rules of TLA are proved as theorems in the HOL system. The use of HOL in reasoning about algorithms in TLA is illustrated by two examples: a proof of a program property and an implementation proof.

dandruff