Asynchronous programming, analysis and testing with state machines
Authors:
Open Access
- 3 June 2015
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 50 (6) , 154-164
Abstract
Programming efficient asynchronous systems is challenging because it can often be hard to express the design declaratively, or to defend against data races and interleaving-dependent assertion violations. Previous work has only addressed these challenges in isolation, by either designing a new declarative language, a new data race detection tool or a new testing technique. We present P#, a language for high-reliability asynchronous programming co-designed with a static data race analysis and systematic concurrency testing infrastructure. We describe our experience using P# to write several distributed protocols and port an industrial-scale system internal to Microsoft, showing that the combined techniques, by leveraging the design of P#, are effective in finding bugs.Keywords
This publication has 21 references indexed in Scilit:
- Systematic testing of asynchronous reactive systems2015
- Ownership-Based Isolation for Concurrent Actors on Multi-core MachinesLecture Notes in Computer Science, 2013
- Capabilities for Uniqueness and Borrowing2010
- Evaluating Ordering Heuristics for Dynamic Partial-Order Reduction TechniquesLecture Notes in Computer Science, 2010
- Paxos made live2007
- Automated Systematic Testing of Open Distributed Programs2006
- Zing: A Model Checker for Concurrent Software2004
- Programming dynamically reconfigurable open systems with SALSAACM SIGPLAN Notices, 2001
- The part-time parliamentACM Transactions on Computer Systems, 1998
- Notes on data base operating systems1978