Rank Predicates vs. Progress Measures in Concurrent-Program Verification
نویسنده
چکیده
This note describes a direct relationship between rank predicates and progress measures in concurrent-program verification.
منابع مشابه
Verification of Protocols Using Presburger Array Theory
One of the verification methods of programs is to show certain predicates about program variables to be invariant. In general, it is undecidable whether or not a given predicate is invariant. In this paper, a class of concurrent program systems which include array variables is introduced, and a class of predicates about program variables is defined. The invariance problem for a predicate in the...
متن کاملImpredicative Concurrent Abstract Predicates
We present impredicative concurrent abstract predicates – iCAP – a program logic for modular reasoning about concurrent, higherorder, reentrant, imperative code. Building on earlier work, iCAP uses protocols to reason about shared mutable state. A key novel feature of iCAP is the ability to define impredicative protocols; protocols that are parameterized on arbitrary predicates, including predi...
متن کاملInvestigating Optimal Progress Measures for Verification of the WebSocket Protocol
The sweep-line method is a state space reduction technique for memory-efficient on-the-fly verification of concurrent systems. The method relies on a progress measure capturing inherent progress in the system under verification to store only fragments of the state space in memory at a time and thereby reduce peak memory usage. The sweepline method has been applied to many concurrent systems, bu...
متن کاملShape Predicates Allow Unbounded Verification of Linearizability Using Canonical Abstraction
Canonical abstraction is a static analysis technique that represents states as 3-valued logical structures, and is able to construct finite representations of systems with infinite statespaces for verification. The granularity of the abstraction can be altered by the definition of instrumentation predicates, which derive their meaning from other predicates. We introduce shape predicates for pre...
متن کاملA Program Logic for Contextual Refinement of Concurrent Objects under Fair Scheduling
Existing program logics on concurrent object verification either ignore progress properties, or aim for non-blocking progress (e.g., lock-freedom and wait-freedom), which cannot be applied to blocking algorithms that progress only under fair scheduling. In this paper we propose a new program logic for compositional verification of contextual refinement of concurrent objects under fair schedulin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Chicago J. Theor. Comput. Sci.
دوره 1996 شماره
صفحات -
تاریخ انتشار 1996