Author of the publication

MU-CSeq 0.3: Sequentialization by Read-Implicit and Coarse-Grained Memory Unwindings - (Competition Contribution).

, , , , and . TACAS, volume 9035 of Lecture Notes in Computer Science, page 436-438. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Automata-based Representations for Infinite Graphs., and . ITA, 35 (4): 311-330 (2001)The Firing Squad Synchronization Problem on Squares, Toruses and Rings., , and . Int. J. Found. Comput. Sci., 18 (3): 637-654 (2007)Parallel Word Substitution., , and . Fundam. Inform., 27 (1): 27-36 (1996)Games, Automata, Logic, and Formal Verification (GandALF 2011)., and . Theor. Comput. Sci., (2013)Finite automata on timed omega-trees., and . Theor. Comput. Sci., 293 (3): 479-505 (2003)Parametric temporal logic for "model measuring"., , , and . ACM Trans. Comput. Log., 2 (3): 388-407 (2001)Optimal paths in weighted timed automata., , and . Theor. Comput. Sci., 318 (3): 297-322 (2004)Sequentializing Parameterized Programs, , and . FIT, volume 87 of EPTCS, page 34-47. (2012)Reducing Context-Bounded Concurrent Reachability to Sequential Reachability., , and . CAV, volume 5643 of Lecture Notes in Computer Science, page 477-492. Springer, (2009)Reasoning About Co-Büchi Tree Automata., and . ICTAC, volume 3407 of Lecture Notes in Computer Science, page 527-542. Springer, (2004)