SIGN IN
SIGN UP
Modelling garbage collection algorithms using CCS and temporal logic (abstract)
Full Text:
PDF
Buy this Article
Authors:
Howard Bowman
Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK
John Derrick
Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK
Richard Jones
Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK
Published in:
· Proceeding
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Page 394
ACM
New York, NY
, USA
©1994
table of contents
ISBN:0-89791-654-9
doi>
10.1145/197917.198173
1994 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 3
· Downloads (cumulative): 114
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
algorithms
ccs
mathematical logic
processors
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