SIGN IN
SIGN UP
Algorithmic verification of asynchronous programs
Full Text:
PDF
Buy this Article
Authors:
Pierre Ganty
IMDEA Software, Madrid, Spain
Rupak Majumdar
MPI-SWS, Kaiserslautern, Germany
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 34 Issue 1, April 2012
Article No. 6
ACM
New York, NY
, USA
table of contents
doi>
10.1145/2160910.2160915
2012 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 12
· Downloads (12 Months): 262
· Downloads (cumulative): 262
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
asynchronous programming
fair termination
languages
liveness
petri nets
reliability
software/program verification
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder