Abstract
This tutorial will introduce the attendees to analysis and proof techniques for programs using parallelism and multi-threading. There are no specific prerequisites, but a familiarity with the notions of preconditions and postconditions, aliasing, race conditions, and deadlocks would be of value. The examples will be based on the threading and parallelism models of Java, Ada, and two new parallel languages, one called ParaSail [4] and another, inspired by the verifiable SPARK[1][2] subset of Ada, called Sparkel[3]. We will introduce the distinction between safety and liveness properties, and then focus primarily on techniques for the verification of safety properties, including the absence of race conditions and deadlocks. We will also discuss the issue of determinism vs. non-determinism in parallel and multi-threaded programs.
- Chapman, R., Industrial experience with SPARK, Ada Letters. XX(4), 64--68 (2000). Google Scholar
Digital Library
- SPARK Team, SPARK Examiner, The SPARK Ravenscar Profile, Praxis, 2008, available at: http://intelligent-systems.altran.com/fileadmin/medias/0.commons/documents/Technology_documents/examiner_ravenscar.pdf (retrieved 8/2013).Google Scholar
- Sparkel web site, http://www.sparkel.org.Google Scholar
- Taft, S. Tucker, ParaSail: Less is More with Multicore, www.embedded.com, 2012, available at http://www.embedded.com/design/other/4375616/ParaSail-Less-is-more-with-multicore (retrieved 9/23/2013).Google Scholar
Index Terms
Tutorial: proving safety of parallel / multi-threaded programs
Recommendations
Tutorial: proving safety of parallel / multi-threaded programs
HILT '13: Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technologyThis tutorial will introduce the attendees to analysis and proof techniques for programs using parallelism and multi-threading. There are no specific prerequisites, but a familiarity with the notions of preconditions and postconditions, aliasing, race ...
Scrider: Using Single Critical Sections to Avoid Deadlocks
IMCCC '14: Proceedings of the 2014 Fourth International Conference on Instrumentation and Measurement, Computer, Communication and ControlWe propose a method, called Scrider, to avoid dead-locks before they manifest themselves. When running it togeth-er with a multithreaded program, Scrider interferes in thread scheduling to ensure that at any time there is only one thread in the critical ...
Dreadlocks: efficient deadlock detection
SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architecturesWe present Dreadlocks, an efficient new shared-memory spin lock that actively detects deadlocks. Instead of spinning on a Boolean value, each thread spins on the lock owner's per-thread digest, a compact representation of a portion of the lock's waits-...







Comments