Jump to content

Hidden algebra

Edit links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Spinningspark (talk | contribs) at 09:53, 23 October 2013 (Changing my mind about notability. Covered in books by multiple authors.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.[1][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.

References

  1. ^ a b Goguen, Joseph. "Hidden Algebra Homepage". University of California, San Diego, USA. Retrieved September 26, 2011.
  2. ^ Malcolm, Grant (July 31, 2006). "Hidden Algebra: Behavioural specification and proof for systems with state". University of London, UK. Retrieved September 26, 2011.
  3. ^ Goguen, Joseph (January 2000). "Hidden algebra and concurrent distributed software". ACM SIGSOFT Software Engineering Notes. 25 (1). ACM, USA. doi:10.1145/340855.340889. Retrieved September 26, 2011.
Stub icon

This software-engineering-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Hidden_algebra&oldid=578383503"