Simulation Refinement for Concurrency Verification | Zendy

Wim H. Hesselink | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Simulation Refinement for Concurrency Verification

Author(s) -

Wim H. Hesselink

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.06.002

Subject(s) - concurrency , computer science , sketch , completeness (order theory) , programming language , theoretical computer science , algorithm , mathematics , mathematical analysis

In recent years, we extended the theory of Abadi and Lamport (1991) on the existence of refinement mappings. The present paper gives an overview of several extensions of the theory and of a number of recent applications to practical verifications. It concludes with a sketch of the results on semantic completeness, and a discussion of the relationship between semantic completeness and methodological convenience

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research