DocumentCode
2844515
Title
A semantics-based approach to analyzing concurrent programs
Author
Carver, Richard H. ; Tai, Kuo-Chung
Author_Institution
North Carolina State Univ., Raleigh, NC, USA
fYear
1988
fDate
19-21 Jul 1988
Firstpage
132
Lastpage
133
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
Keywords
parallel programming; program diagnostics; synchronisation; concurrent programs; error detection; feasibility constraints; feasible SYN-sequences; semantic information; static analysis; synchronization; syntactic information; Computer science; Concurrent computing; Error analysis; Event detection; Formal specifications; Information analysis; Packaging; System recovery; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Testing, Verification, and Analysis, 1988., Proceedings of the Second Workshop on
Conference_Location
Banff, Alta.
Print_ISBN
0-8186-0868-4
Type
conf
DOI
10.1109/WST.1988.5365
Filename
5365
Link To Document