1 / 6

Utah Verifier Group Research Overview

Utah Verifier Group Research Overview. Robert Palmer. b. / / pc=1 /a / pc’=2 / / pc=1 /b / pc’=3 / / pc=2 /b / pc’=1 / / pc=3 /a / pc’=1. 2. a. 1. b. 3. a. Modeling MPI. Find Deadlocks Guarantee Assertions Optimize Correctly.

ismael
Download Presentation

Utah Verifier Group Research Overview

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Utah Verifier GroupResearch Overview Robert Palmer

  2. b \/ /\ pc=1 /\a /\ pc’=2 \/ /\ pc=1 /\b /\ pc’=3 \/ /\ pc=2 /\b /\ pc’=1 \/ /\ pc=3 /\a /\ pc’=1 2 a 1 b 3 a Modeling MPI • Find Deadlocks • Guarantee Assertions • Optimize Correctly (Robert Palmer)

  3. Verification of MPI one-sided communication (Salman Pervez) • MPI one-sided communication • Implementation of shared memory in a message passing paradigm. • A process can make its memory space available for use by other processes. • Other processes can read/write from this memory space without explicit communication with the owner • Case Study: Byte-range-locks using MPI one-sided • One-sided uses a relaxed memory model which makes locking harder • Model checking can be used to detect deadlocks/livelocks in locking algorithms • Traditional testing not enough to uncover serious bugs

  4. Control Flow Model Extraction from Visual Studio (Geof Sawaya) • Uses VS Extensibility classes to extract code elements • Each function is analyzed with a parse engine (Gold Parser) and fed a grammar, producing a parse tree • The parse tree is used to generate a control flow graph

  5. Design a prototype protocol Build and verify each level of the hierarchy protocol separately Combine all level protocols into the full protocol afterwards Verify the hierarchical protocol Use various abstractions Use assume-guarantee reasoning Verifying Hierarchical Cache Coherence Protocols (Xiaofang Chen)

  6. Under-approximation Model Checking for Concurrent Programs (Yu Yang) • Testing Concurrent C Programs is still hard • Difficult to instrument the binary code • Don’t have infrastructure like JavaPathfinder whichprovides forward/roll-back for program execution • Our Method • Use external scheduler to control the program execution • Restart from beginning and choose a new interleaving trace Instrumented multithreaded program request /reply request /reply Instrumented multithreaded program scheduler request /reply Instrumented multithreaded program

More Related