A semantics-based approach to analyzing concurrent programs

Abstract

Concurrent programs are analyzed by deriving constraints on the feasible SYN-sequences of a concurrent program according to the programs's syntactic and semantic information. These constraints, called feasibility constraints, show restrictions on the ordering of synchronization events allowed by the program. By using feasibility constraints, one can obtain a better approximation of the feasibility set of a concurrent program and improve the effectiveness of error detection by static analysis.<>