Axiomatic Concurrency Model
ConceptAn axiomatic concurrency model specifies the legal behaviors of concurrent memory operations on an instruction set architecture (ISA) as a set of constraints over candidate executions (typically relations such as program order, reads-from, and coherence order), rather than as an executable operational simulation. In the hardware-formal-methods literature, axiomatic concurrency models are central to specifying relaxed-memory behavior of real architectures such as ARMv8, POWER, and x86, and to integrating full-scale ISA semantics with memory-model checking tools.
WIKI
Axiomatic Concurrency Model
Overview
An axiomatic concurrency model is a declarative specification of the concurrent behavior of an instruction set architecture. Instead of describing how a processor executes step by step (as in an operational model), an axiomatic model characterizes which candidate executions of a program are allowed by defining relations—such as program order (po), reads-from (rf), coherence order (co), from-reads (fr), and memory order—and stating constraints that these relations must satisfy.
NEIGHBORHOOD
No graph connections found for this entity yet. It may appear in future ingestion runs.
explore full graph →