Semantic analysis of shared-memory concurrent languages using abstract model-checking
Régis Cridlig · 1995
In this article we present a true-concurrent operational semantics of a Pascal-like language with a parallel operator and shared memory.This semantics is based on a hlgherdimensional transition system that is able to model the asynchronous execution of concurrent operations.We show how it can be usefully abstracted to finite automata via abstract interpretation using foldlng of states and appropriate widening operators.Then we compute static properties relevant to the standard concurrent execution of the program by means of modelchecking on the abstract automata that were previously derived; for instance, approximations of the values of shared variables and temporal prop erties about standard execution paths can be obtained effectively with a high degree of accuracy.