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. 1 2 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. ACM, USA. 25 (1): 51–52. doi:10.1145/340855.340889. S2CID 11950673.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.