FAQ

Safe semantics

Known as: Safe register 
Safe semantics is a consistency model that describes one type of guarantee a data register provides when it is shared by several processors in a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2002-2010
01220022010

Related topics

Related topics

7 relations
Atomic semanticsCentral processing unitConsistency modelParallel computing
(More)

Broader (1)

Concurrency control

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Safe semantics
Parallel computing
Central processing unit
Processor register
Concurrency control
Consistency model

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Executing Petri net based system model
Implementation in a low-level language exposes problems with the system modeling, but involves considerable development and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2010
2010
An Abstract memory model describing the interaction between thread and memory with debugger tools
-This paper describe the multithreaded execution and data race detectors which are commonly viewed as debugging tools.The C… (More)
Is this relevant?
2009
2009
Simple thread semantics require race detection
Data race detectors are commonly viewed as debugging tools. We argue that if we knew how to make them both fully accurate and… (More)
Is this relevant?
2008
2008
SWI-Prolog and the web
Prolog is an excellent tool for representing and manipulating data written in formal languages as well as natural language. Its… (More)
  • figure 1
  • figure 4
  • figure 6
  • figure 7
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
FLIPS: Hybrid Adaptive Intrusion Prevention
Intrusion detection systems are fundamentally passive and fail–open. Because their primary task is classification, they do… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2004
2004
Brief announcement: efficient implementation of a byzantine data storage system
We study the problem of implementing a replicated data store in an asynchronous system with an unbounded number of clients in… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Minimal Byzantine Storage
Byzantine fault-tolerant storage systems can provide high availability in hazardous environments, but the redundant servers they… (More)
Is this relevant?