No label defined (Q3746872)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3982501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3982501 |
Statements
1986
0 references
programming language
0 references
abstract interpreter for ADA concurrency constructs
0 references
program graph
0 references
graph grammar
0 references
nondeterminism
0 references
operational semantics specification
0 references
synchronization
0 references
0.7337794899940491
0 references
0.7272723913192749
0 references
We elaborate an abstract interpreter for ADA concurrency constructs. This interpreter accepts ADA programs, the abstract syntax of which is given in a graph form called program graph. The state transitions of the interpreter are formally defined by a graph grammar. To cope with concurrency, we introduce a mixed derivation rule, which is an intermediate form between sequential and parallel graph rewriting. It is shown, that these tools basically cover the intrinsic problems of specifying semantics with nondeterminism and concurrency. The underlying graphtheoretic concepts are adequate for a full operational semantics specification of ADA, though the work is restricted to the ''hard kernel'' of concurrency and synchronization.
0 references