Titlebook: Mathematics of Program Construction; Third International Bernhard M?ller Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 199

避開

欺騙世家

四海為家的人

A compositional proof system for asynchronously communicating processes,formalism serves well as a basis for refinement and top-down development of distributed systems composed of asynchronously communicating processes. Moreover, we show that the first-order logic underlying the interface-specification language is decidable, which makes (semi-) automated verification more feasible.

條街道往前推

Prosaic

,Angelic termination in Dijkstra’s calculus,on proposal, the semantics are given by monotonic predicate transformers and monotonic operations on them. In this way the semantics of recursion is completely standard. The paper concludes with proof rules for recursive procedures and a small example of their applications.

STERN

預(yù)感

Conference proceedings 1995missions. The general theme is the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software and hardware; among the topics addressed are program transformation, program analysis, program verification, as well as convincing case studies.

Valves

Towards automatic parallelization of logic programs,gram by generating the appropriate delay declarations, so that correctness is maintained and deadlock avoided. To this end we identify the crucial properties that the original Prolog program should satisfy and analyze which aspects of the parallelization process and of the correctness proof could be automated.

把手

A simple, efficient, and flexible implementation of flexible arrays,without affecting time complexities. The standard flexible array operations take .(log . time, where . is the size of the flexible array. Additional operations, such as minimum and maximum take .(1) time.

注入

An action system specification of the caltech asynchronous microprocessor,ecification. We propose a specification strategy that is based on the idea of . of the program variable space. Applying this strategy we give a completely formal derivation of a high level specification for the Caltech microprocessor. We also demonstrate the suitability of action systems and the stepwise refinement paradigm for ..