Abstract Modular Verification of Concurrent Assembly Code with Dynamic Thread Creation and.pdfVIP

Modular Verification of Concurrent Assembly Code with Dynamic Thread Creation and Termination Xinyu Feng and Zhong Shao Department of Computer Science, Yale University New Haven, CT 06520-8285, U.S.A. feng, shao@ Abstract systems use some form of concurrency in their core software. Cer- Proof-carrying code (PCC) is a general framework that can, in tifying low-level concurrent programs is an important task because principle, verify safety properties of arbitrary machine-language it helps increase the reliability of software infrastructure and is cru- programs. Existing PCC systems and typed assembly languages, cial for scaling the PCC and TAL technologies to realistic systems. however, can only handle sequential programs. This severely limits As an important first step, Yu and Shao [42]—at last year’s their applicability since many real-world systems use some form of ICFP—proposed a certified formal framework (known as CCAP) concurrency in their core software. Recently Yu and Shao proposed for specifying and reasoning about general properties of concur- a logic-based “type” system for verifying concurrent assembly pro- rent programs at the assembly level. They applied the “invariance grams. Their thread model, however, is rather restrictive in that no proof ” technique for verifying general safety properties and the threads can be created or terminated dynamically and no sharing of rely-guarantee methodology