Hidden algebra explained

Hidden algebra provides a formal semantics for use in the field of software engineering, especially for concurrent distributed object systems.[1] It supports correctness proofs.[2]

Hidden algebra was studied by Joseph Goguen.[3] It handles features of large software-based systems, including concurrency, distribution, nondeterminism, and local states. It also handled object-oriented features like classes, subclasses (inheritance), attributes, and methods. Hidden algebra generalizes process algebra and transition system approaches.

External links

Notes and References

  1. Web site: Hidden Algebra Homepage . University of California, San Diego, USA . September 26, 2011 . Joseph Goguen . Joseph . Goguen .
  2. Web site: Hidden Algebra: Behavioural specification and proof for systems with state . University of London, UK . July 31, 2006 . September 26, 2011 . Malcolm, Grant.
  3. Hidden algebra and concurrent distributed software . ACM, USA . . 25 . 51–52 . 1 . January 2000 . 10.1145/340855.340889 . Joseph Goguen . Joseph . Goguen . 11950673 . free .

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Hidden algebra".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.