Sequentialization Using Timestamps

DOI10.1007/978-3-319-55911-7_49zbMath1485.68047OpenAlexW2603146396MaRDI QIDQ2988861

K. Madhukar, Anand Yeolekar, Dipali Bhutada, R. Venkatesh

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_49

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• Cseq
• CBMC
• Lazy-CSeq
• MU-CSeq

Cites Work

• Reducing concurrent analysis under a context bound to sequential analysis
• Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
• Tools and Algorithms for the Construction and Analysis of Systems
• On interference abstractions
• Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions

This page was built for publication: Sequentialization Using Timestamps