src/HOL/UNITY/README.html
author paulson
Fri Apr 03 12:34:33 1998 +0200 (1998-04-03)
changeset 4776 1f9362e769c1
child 5461 6376d5cbb6ac
permissions -rw-r--r--
New UNITY theory
paulson@4776
     1
<!-- $Id$ -->
paulson@4776
     2
<HTML><HEAD><TITLE>HOL/UNITY/README</TITLE></HEAD><BODY>
paulson@4776
     3
paulson@4776
     4
<H2>UNITY--Chandy and Misra's UNITY formalism</H2>
paulson@4776
     5
paulson@4776
     6
<P>The book <EM>Parallel Program Design: A Foundation</EM> by Chandy and Misra
paulson@4776
     7
(Addison-Wesley, 1988) presents UNITY, which consists of an abstract
paulson@4776
     8
programming language of guarded assignments and an associated calculus.
paulson@4776
     9
Misra's 1994 paper "A Logic for Concurrent Programming" presents "New UNITY",
paulson@4776
    10
giving more elegant foundations for a more general class of languages.
paulson@4776
    11
paulson@4776
    12
<P> This directory is a preliminary formalization of New UNITY.  The Isabelle
paulson@4776
    13
examples may not represent the most natural treatment of UNITY style.  Hand
paulson@4776
    14
UNITY proofs tend to be written in the forwards direction, as in informal
paulson@4776
    15
mathematics, while Isabelle works best in a backwards (goal-directed) style.
paulson@4776
    16
paulson@4776
    17
<P>
paulson@4776
    18
The syntax, also, is rather unnatural.   Programs are expressed as sets of 
paulson@4776
    19
commands, where each command is a relation on states.  Quantification over 
paulson@4776
    20
commands using [] is easily expressed.  At present, there are no examples of
paulson@4776
    21
quantification using ||.
paulson@4776
    22
paulson@4776
    23
<P>
paulson@4776
    24
The directory presents a few small examples, mostly taken from Misra's 1994
paulson@4776
    25
paper:
paulson@4776
    26
<UL>
paulson@4776
    27
<LI>common meeting time
paulson@4776
    28
paulson@4776
    29
<LI>the token ring
paulson@4776
    30
paulson@4776
    31
<LI>the communication network
paulson@4776
    32
paulson@4776
    33
<LI><EM>n</EM>-process deadlock
paulson@4776
    34
paulson@4776
    35
<LI>unordered channel
paulson@4776
    36
paulson@4776
    37
<LI>reachability in directed graphs (section 6.4 of the book)
paulson@4776
    38
</UL>
paulson@4776
    39
paulson@4776
    40
<P> Safety proofs (invariants) are often proved automatically.  Progress
paulson@4776
    41
proofs involving ENSURES can sometimes be proved automatically.  The
paulson@4776
    42
level of automation appears to be about the same as in HOL-UNITY by Flemming
paulson@4776
    43
Andersen et al.
paulson@4776
    44
paulson@4776
    45
<HR>
paulson@4776
    46
<P>Last modified on $Date$
paulson@4776
    47
paulson@4776
    48
<ADDRESS>
paulson@4776
    49
<A NAME="lcp@cl.cam.ac.uk" HREF="mailto:lcp@cl.cam.ac.uk">lcp@cl.cam.ac.uk</A>
paulson@4776
    50
</ADDRESS>
paulson@4776
    51
</BODY></HTML>