How Formal Dynamic Verification Tools Facilitate Novel Concurrency Visualizations

  • Authors:
  • Sriram Aananthakrishnan;Michael Delisi;Sarvani Vakkalanka;Anh Vo;Ganesh Gopalakrishnan;Robert M. Kirby;Rajeev Thakur

  • Affiliations:
  • School of Computing, Univ. of Utah, Salt Lake City, USA 84112;School of Computing, Univ. of Utah, Salt Lake City, USA 84112;School of Computing, Univ. of Utah, Salt Lake City, USA 84112;School of Computing, Univ. of Utah, Salt Lake City, USA 84112;School of Computing, Univ. of Utah, Salt Lake City, USA 84112;School of Computing, Univ. of Utah, Salt Lake City, USA 84112;Math. and Comp. Sci. Div., Argonne Nat. Lab., Argonne, USA 60439

  • Venue:
  • Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the exploding scale of concurrency, presenting valuable pieces of information collected by formal verification tools intuitively and graphically can greatly enhance concurrent system debugging. Traditional MPI program debuggers present trace views of MPI program executions. Such views are redundant, often containing equivalent traces that permute independent MPI calls. In our ISP formal dynamic verifier for MPI programs, we present a collection of alternate views made possible by the use of formal dynamic verification. Some of ISP's views help pinpoint errors, some facilitate discerning errors by eliminating redundancy, while others help understand the program better by displaying concurrent even orderings that must be respected by all MPI implementations, in the form of completes-before graphs. In this paper, we describe ISP's graphical user interface (GUI) capabilities in all these areas which are currently supported by a portable Java based GUI, a Microsoft Visual Studio GUI, and an Eclipse based GUI whose development is in progress.