Skip to main content
Conference ProceedingsOPEN ACCESS

MU-CSeq: Sequentialization of C programs by shared memory unwindings (Competition contribution)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8413 LNCS 402-404
DOI: 10.1007/978-3-642-54862-8_30
14Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We implement a new sequentialization algorithm for multi-threaded C programs with dynamic thread creation as a new CSeq module. The novel basic idea of this algorithm is to fix (by a nondeterministic guess) the sequence of write operations in the shared memory and then simulate the behavior of the program according to any scheduling that respects this choice. Simulation is done thread-by-thread and the thread creation mechanism is replaced by function calls. © 2014 Springer-Verlag.

Cite

CITATION STYLE

APA

Tomasco, E., Inverso, O., Fischer, B., La Torre, S., & Parlato, G. (2014). MU-CSeq: Sequentialization of C programs by shared memory unwindings (Competition contribution). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8413 LNCS, pp. 402–404). Springer Verlag. https://doi.org/10.1007/978-3-642-54862-8_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free