|
Hidden Algebra
Hidden algebra provides a formal semantics of programming languages, formal semantics for use in the field of software engineering, especially for concurrent distributed object systems. It supports Bayes error rate, correctness proofs. Hidden algebra was studied by Joseph Goguen. It handles features of large software-based systems, including Concurrency (computer science), concurrency, Distributed system, distribution, nondeterministic algorithm, nondeterminism, and local states. It also handled Object-oriented programming, object-oriented features like class (computer programming), classes, Subclass (computer science), subclasses (Inheritance (object-oriented programming), inheritance), Attribute (computing), attributes, and Method (computer programming), methods. Hidden algebra generalizes process algebra and transition system approaches. References External links Hidden Algebra Tutorial Abstract algebra Universal algebra Logical calculi Concurrent computing Distributed co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Formal Semantics Of Programming Languages
In programming language theory, semantics is the rigorous mathematical study of the meaning of programming languages. Semantics assigns computational meaning to valid string (computer science), strings in a programming language syntax. It is closely related to, and often crosses over with, the Semantics of logic, semantics of mathematical proofs. Semantics describes the processes a computer follows when Execution (computing), executing a program in that specific language. This can be done by describing the relationship between the input and output of a program, or giving an explanation of how the program will be executed on a certain computer platform, platform, thereby creating a model of computation. History In 1967, Robert W. Floyd published the paper ''Assigning meanings to programs''; his chief aim was "a rigorous standard for proofs about computer programs, including formal verification, proofs of correctness, equivalence, and termination". Floyd further wrote: A semant ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |