Finding:

1. close

   Regular semantics

   Regular semantics is a term which describes the guarantees provided by a data register shared by several processors in a parallel machine or in a network of computers working together.
2. close

   Atomic semantics

   Atomic Semantics is a term which describes the guarantees provided by a data register shared by several processors in a parallel machine or in a network of computers working together. Atomic semantics are defined for a variable with a single writer but multiple readers.
3. close

   Safe semantics

   In computing and computer networking, safe semantics describes the guarantees provided by a data register shared by several processors in a parallel machine or in a network of computers working together. Safe semantics are defined formally in Lamport's "On Interprocess Communication", published in Distributed Computing 1, 2 (1986), 77–101.
4. close

   Semantics encoding

   A semantics encoding is a translation between formal languages. ... This preservation guarantees that both languages behave the same way.
5. close

   Denotational semantics

   In computer science, denotational semantics is an approach to formalizing the meanings of programming languages by constructing mathematical objects (called denotations) which describe the meanings of expressions from the languages. Other approaches to providing a formal semantics of programming languages include axiomatic semantics and operational semantics.
6. close

   Kripke semantics

   Kripke semantics (also known as relational semantics or frame semantics, and often confused with possible world semantics) is a formal semantics for non-classical logic systems created in the late 1950s and early 1960s by Saul Kripke, beginning when he was a teenager. It was first made for modal logics, and later adapted to intuitionistic logic and other non-classical systems.
7. close

   Symbolic combinatorics

   In mathematics, symbolic combinatorics is a technique of counting combinatorial objects by using the internal structure of the objects to derive formulas for their generating functions. ... Instead, we make use of a construction that guarantees there is no intersection (be careful, however; this affects the semantics of the operation as well).
8. close

   Denotational semantics of the Actor model

   The denotational semantics of the Actor model is the subject of denotational domain theory for Actors. The historical development of this subject is recounted in [Hewitt 2008b].
9. close

   Double-checked locking

   In software engineering, double-checked locking is a software design pattern also known as "double-checked locking optimization". ... Visual C++ 2005 guarantees that volatile variables will behave as fences, as in J2SE 5.0, preventing both compiler and CPU arrangement of reads and writes with acquire semantics (for reads) and release semantics (for writes).
10. close

    UML state machine

    UML state machine, known also as UML statechart, is an object-based variant of Harel statechart adapted and extended by the Unified Modeling Language . ... The semantics of exit actions guarantees that, regardless of the transition path, the heater will be disabled when the toaster is not in the “heating” state.

Explore the following pages on Powerset:

• Regular semantics,
• Atomic semantics,
• Safe semantics,
• Semantics encoding,
• Denotational semantics,
• Kripke semantics,
• Symbolic combinatorics,
• Denotational semantics of the Actor model,
• Double-checked locking,
• UML state machine

Try this on Bing Research

Bing