Ed Harcourt, Pawel Paczkowski, and K.V.S. Prasad. A framework for representing parameterized processes. In preparation. 2 The ALF representation was well over 2300 plus imported theory 20 Department of Computing Science, Chalmers University of Technology, 1995. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A Machine Verified Distributed Sorting Algorithm - Andersen, Harcourt, Prasad (1996) Self-citation (Harcourt Prasad) (Correct)
....from ALF through lambda2 abstraction and function application. We no longer need to include the syntax and semantics of data expressions and we can borrow off the shelf lemmas about data domains (e.g. that multiplication is commutative) The correctness of the ALF representation is given in [HPP95]. 1.1 Outline of the paper In the rest of this section we explain, informally, the parallel sorting algorithm we verify and discuss what our specification of the sorter is. Section 2 presents, formally, the syntax and semantics of prioritized CBS and describes the parallel sorting algorithm in ....
Ed Harcourt, Pawel Paczkowski, and K.V.S. Prasad. A framework for representing parameterized processes. In preparation. 2 The ALF representation was well over 2300 plus imported theory 20 Department of Computing Science, Chalmers University of Technology, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC