Predicates are predicate transformers: a unified compositional theory for concurrency

He Jifeng and Hoare’s [He Jifeng] approach to integrate theories for “program8 as predicates” and “programs as predicate transformers” in sequential setting i generalieed to a compositional verification theory for concurrency, using idea8 of Zwiers’ [Zwiers]. Due to the generality of the approach, a variety of parallel composition operators, based on shared variables, communication events, interleaving, maximal progress and the like, can be expressed as derived operations.

[1]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[2]  D. Park,et al.  Induction Rules and Termination Proofs , 1972, ICALP.

[3]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[4]  J. Schwarz,et al.  Generic Commands - A Tool for Partial Correctness Formalisms , 1977, Comput. J..

[5]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[6]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[7]  Dirk van Dalen,et al.  Logic and structure , 1980 .

[8]  Edmund M. Clarke,et al.  Characterizing Correctness Properties of Parallel Programs Using Fixpoints , 1980, ICALP.

[9]  Willem P. de Roever,et al.  A Proof System for Communicating Sequential Processes , 1980, ACM Trans. Program. Lang. Syst..

[10]  C. A. R. Hoare,et al.  Specification-Oriented Semantics for Communicating Processes , 1983, ICALP.

[11]  C.A.R. Hoare,et al.  A More Complete Model of Communicating Processes , 1983, Theor. Comput. Sci..

[12]  Ernst-Rüdiger Olderog,et al.  On the Notion of Expressiveness and the Rule of Adaption , 1983, Theor. Comput. Sci..

[13]  Amir Pnueli,et al.  Now you may compose temporal logic specifications , 1984, STOC '84.

[14]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[15]  Eric C. R. Hehner,et al.  Predicative programming Part I , 1984, CACM.

[16]  Leslie Lamport.  An Axiomatic Semantics of Concurrent Programming Languages , 1984, Logics and Models of Concurrent Systems.

[17]  Neelam Soundararajan,et al.  Axiomatic semantics of communicating sequential processes , 1984, ACM Trans. Program. Lang. Syst..

[18]  J. C. Shepherdson,et al.  Mathematical Logic and Programming Languages , 1985 .

[19]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[20]  Van Nguyen,et al.  A model and temporal proof system for networks of processes , 1985, POPL '85.

[21]  Amir Pnueli,et al.  A really abstract concurrent model and its temporal logic , 1986, POPL '86.

[22]  Ernst-Rüdiger Olderog,et al.  Process Theory: Semantics, Specification and Verification , 1986, Current Trends in Concurrency.

[23]  C. A. R. Hoare,et al.  The Weakest Prespecification , 1987, Information Processing Letters.

[24]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[25]  Job Zwiers,et al.  Compositionality, Concurrency and Partial Correctness , 1989, Lecture Notes in Computer Science.