Abstract
This case study applies techniques of formal program development by specification refinement and composition to the problem of concurrent garbage collection. The specification formalism is mainly based on declarative programming paradigms, the imperative aspect is dealt with by using monads. We also sketch the use of temporal logic in connection with monadic specifications. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Pavlovic, D., Pepper, P., & Smith, D. (2004). Colimits for concurrent collectors. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2772, 568–597. https://doi.org/10.1007/978-3-540-39910-0_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
