Abstract
Data reification is generalized, allowing “abstract” data to be implemented by parallel processes. He Jifeng and Hoare’s [He Jifeng] approach to integrate theories for ’’programs as predicates” and’’ programs as predicate transformers”, is generalized to parallel processes and is used to formulate syntactic verification conditions to check the correctness of reification by means of processes.
Cite
CITATION STYLE
Zwiers, J. (1990). Predicates, predicate transformers and refinement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 430 LNCS, pp. 759–776). Springer Verlag. https://doi.org/10.1007/3-540-52559-9_86
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
