Academic
Academic
Home
News
Courses
Publications
Students
Contact
Light
Dark
Automatic
Abstract Interpretation
Verification of C11 Concurrency
Verification of parallel systems is a complex exercise. The large state spaces created due to thread interleavings complicates the verification of such parallel systems. The problem becomes even harder in case of parallel programs executed under relaxed memory models.
Sanjana Singh
,
Divyanjali
,
Subodh Sharma
Cite
×