Hidden algebra
Jump to navigation
Jump to search
 | This article provides insufficient context for those unfamiliar with the subject. (July 2013) |
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
[edit | edit source]- ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
External links
[edit | edit source]
 | This software-engineering-related article is a stub. You can help Wikipedia by expanding it. |