See this document in CiteSeerX!

Two Finite Specifications of a Queue Marc Bezem  (Make Corrections)  
Alban Ponse Utrecht University, Department of Philosophy Heidelberglaan 8,...



  Home/Search   Context   Related

 
View or download:
info.science.uva.nl/pub/pr...P9424.ps.Z
Cached:  PS.gz  PS   PDF  Image  Update  Help

From:  info.science.uva.nl/pub/progra... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Two finite specifications of a queue in ACP with abstraction are proven correct relative to a standard specification of a queue that employs an infinite data type for representing its contents. The proofs are given in the proof theory of CRL, and the only ` -laws' used are x = x and x((y+z)+y) = x(y+z). (Update)

Similar documents (at the sentence level):
69.1%:   Two Finite Specifications of a Queue - Bezem, Ponse   (Correct)

Active bibliography (related documents):   More   All
0.5:   A formal axiomatization for alphabet reasoning with.. - Korver, Sellink (1997)   (Correct)
0.3:   The Parallel Composition of Uniform Processes with Data - Groote, van Wamel (2001)   (Correct)
0.3:   A Verification of the Bakery Protocol Combining Algebraic.. - Brovedani, Klusener (1996)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ utrecht-two,
  author = "Alban Ponse Utrecht",
  title = "Two Finite Specifications of a Queue Marc Bezem",
  url = "citeseer.ist.psu.edu/766679.html" }
Citations (may not include all citations):
2732   Communicating Sequential Processes (context) - Hoare - 1985
447   Prentice Hall International (context) - Milner, Concurrency - 1989
266   Cambridge Tracts in Theoretical Computer Science (context) - Baeten, Weijland - 1990
155   Algebra of communicating processes with abstraction (context) - Bergstra, Klop - 1985
108   Communications of the ACM (context) - Hoare, Hayes et al. - 1987
78   Branching time and abstraction in bisimulation semantics (context) - van Glabbeek, Weijland - 1991
50   To appear - Groote, Ponse et al. - 1994
49   Process algebra with iteration and nesting (context) - Bergstra, Bethke et al. - 1994
38   Proof theory for CRL: a language for processes with data (context) - Groote, Ponse - 1994
22   Process algebra: specification and verification in bisimulat.. (context) - Bergstra, Klop - 1986
10   From data structure to process structure (context) - Brinksma, Kars - 1991
7   Process algebra with combinators - Bergstra, Bethke et al. - 1994
5   Protocol Verification in CRL (context) - Korver - 1994
4   Refinement in branching time semantics (context) - van Glabbeek, Weijland - 1989
4   Modular specifications (context) - van Glabbeek, Vaandrager - 1989
4   Computable processes and bisimulation equivalence (context) - Ponse
3   Proof theory for CRL - Groote, Ponse - 1991

Documents on the same site (http://info.science.uva.nl/pub/programming-research/reports/1994/):   More
Using Filters for the Disambiguation - Of Context-Free Grammars   (Correct)
Inductive Proofs with Sets, and some Applications in Process.. - van Wamel   (Correct)
A Real Time µCRL Specification of a System for Traffic.. - Koens, Oei   (Correct)

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