Abstract
We describe a version of the lazy sequentialization schema by La Torre, Madhusudan, and Parlato that is optimized for bounded programs, and avoids the re-computation of the local state of each process at each context switch. Lazy-CSeq implements this sequentialization schema for sequentially consistent C programs using POSIX threads. Experiments show that it is very competitive. © 2014 Springer-Verlag.
Cite
CITATION STYLE
Inverso, O., Tomasco, E., Fischer, B., La Torre, S., & Parlato, G. (2014). Lazy-CSeq: A lazy sequentialization tool for C (Competition contribution). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8413 LNCS, pp. 398–401). Springer Verlag. https://doi.org/10.1007/978-3-642-54862-8_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
