- Atomic semantics
**Atomic Semantics**is a term which describes the guarantees provided by adata register shared by several processors in aparallel machine or in a network of computers working together.Atomic semantics are defined for a variable with a single writer but multiple readers. Thesesemantics are very strong: they guarantee that the read and write operations to the variable behave exactly as if they happened instantaneously in some point in time which is within the actual time where the operation took place.

**References**Atomic semantics are defined formally in Lamport's "On Interprocess Communication" Distributed Computing 1, 2 (1986), 77-101. (Also appeared as SRC Research Report 8).

**ee also***

Regular semantics

*Safe semantics

*Wikimedia Foundation.
2010.*

### Look at other dictionaries:

**semantics**— semanticist /si man teuh sist/, semantician /see man tish euhn/, n. /si man tiks/, n. (used with a sing. v.) 1. Ling. a. the study of meaning. b. the study of linguistic development by classifying and examining changes in meaning and form. 2.… … Universalium**Semantics of Business Vocabulary and Business Rules**— The Semantics of Business Vocabulary and Business Rules (SBVR) is an adopted standard of the Object Management Group (OMG) intended to be the basis for a formal and detailed natural language declarative description of a complex entity, such as a… … Wikipedia**Atomic operation**— An atomic operation in computer science refers to a set of operations that can be combined so that they appear to the rest of the system to be a single operation with only two possible outcomes: success or failure.ConditionsTo accomplish this,… … Wikipedia**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. Overview Definition Regular semantics are defined formally in Lamport s On… … Wikipedia**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… … Wikipedia**Truth-value semantics**— In formal semantics, truth value semantics is an alternative to Tarskian semantics. It has been primarily championed by Ruth Barcan Marcus, H. Leblanc, and M. Dunn and N. Belnap. It is also called the substitution interpretation (of the… … Wikipedia**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. It was first made for modal… … Wikipedia**Relational Model/Tasmania**— (RM/T) was published by E.F. Codd in 1979 and is the name given to a number of extensions to his original relational model (RM) published in 1970. The overall goal of the RM/T was to define some fundamental semantic units, at atomic and molecular … Wikipedia**First-order logic**— is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia**Description logic**— (DL) is a family of formal knowledge representation languages. It is more expressive than propositional logic but has more efficient decision problems than first order predicate logic. DL is used in artificial intelligence for formal reasoning on … Wikipedia