Invariant-based specification, synthesis, and verification of synchronization in concurrent programs

Deng, Xianghua; Dwyer, Matthew B.; Hatcliff, John; Mizuno, Masaaki

doi:10.1145/581339.581394

Cited by 59 publications

(38 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is achieved by deleting transitions from the state-space based on observational equivalence between states, and inspecting if the resulting program satisfies the specification and is implementable. [4] allows users to specify synchronization patterns for critical sections, which are used to infer appropriate synchronization for each of the user-identified region. Vechev et al [20] address the problem of automatically deriving linearizable objects with fine-grained concurrency, using hardware primitives to achieve atomicity.…”

Section: Related Workmentioning

confidence: 99%

Logical Concurrency Control from Sequential Proofs

Deshmukh

Ramalingam

Ranganath

et al. 2010

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. We are interested in identifying and enforcing the isolation requirements of a concurrent program, i.e., concurrency control that ensures that the program meets its specification. The thesis of this paper is that this can be done systematically starting from a sequential proof, i.e., a proof of correctness of the program in the absence of concurrent interleavings. We illustrate our thesis by presenting a solution to the problem of making a sequential library thread-safe for concurrent clients. We consider a sequential library annotated with assertions along with a proof that these assertions hold in a sequential execution. We show how we can use the proof to derive concurrency control that ensures that any execution of the library methods, when invoked by concurrent clients, satisfies the same assertions. We also present an extension to guarantee that the library is linearizable with respect to its sequential specification.

show abstract

Section: Related Workmentioning

confidence: 99%

Logical Concurrency Control from Sequential Proofs

Deshmukh

Ramalingam

Ranganath

et al. 2010

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…The separation and automatic programming of synchronization concerns serves as the motivation for many concurrent programming frameworks, including D [16], concurrency controllers [6], SyncGen [10], Szumo [3,25], and Java transactions [13,14]. Separating the synchronization logic from the "business logic" is intended to simplify programming both concerns by virtue of not needing to "mix" the two.…”

Section: Approaches To Separation and Automatic Programming Of Synchrmentioning

confidence: 99%

“…However, the operations might implement complex collaborations with other controllers to acquire a set of resources while avoiding deadlock. Approaches that employ this pattern include SyncGen, which generates them from declarative region invariants [10], the system of Betin-Can and Bultan, which generates them from action-language specifications [6], and our own Szumo system, which generates them from declarative synchronization contracts [25,5].…”

Section: Approaches To Separation and Automatic Programming Of Synchrmentioning

confidence: 99%

“…This need to keep the servlet and its negotiator in sync suggests that negotiators (and the servlet-based notification code) should be generated automatically. Fortunately, negotiators can be automatically generated from high-level specifications, such as action languages [6], region invariants [10], and synchronization contracts [4,25]. Synchronization contracts have the added advantage of being able to ensure freedom from certain kinds of data races [25].…”

Section: Proposed Extensionsmentioning

confidence: 99%

See 1 more Smart Citation

On Mechanisms for Deadlock Avoidance in SIP Servlet Containers

Huang

Dillon

Stirewalt

2008

Principles, Systems and Applications of IP Telecommunications. Services and Security for Next Generation Networks

View full text Add to dashboard Cite

Abstract. Increasingly, VoIP applications are being deployed to multithreaded SIP servlet containers. Unfortunately, the standard specification for these containers is silent with regard to synchronization issues, and the lack of direction has led different vendors to adopt a variety of different and incompatible policies for preventing data races among concurrent threads. In addition to the obvious portability problems, some policies make servlet code prone to deadlock under common scenarios of use. This paper documents this problem with concrete examples and proposes modifications to the standard to allow programmers to implement the protocols needed to avoid these common deadlocks. These extensions will open the way for automatic generation of the synchronization logic needed to implement these avoidance protocols, thereby increasing the safety and reliability of applications deployed in this environment.

show abstract

“…The second family, characterized by a semi-endogenous transformation, is the short-distance one. In this family, the formalism is embedded in the implementation code in form of special comments, as in SyncGen [21], or in form of special keywords and statements, as in ArchJava [2]. In this case, only special symbols are translated into implementation code, while the rest is left unchanged.…”

Section: Code Generationmentioning

confidence: 99%

Non-synchronous Communications in Process Algebraic Architectural Description Languages

Bernardo

Bontà

2008

Software Architecture

View full text Add to dashboard Cite

Architectural description languages are a useful tool for modeling complex software systems at a high level of abstraction. If based on formal methods, they can also serve for enabling the early verification of various properties such as component coordination and for guiding the synthesis of code correct by construction. This is the case with process algebraic architectural description languages, which are process calculi enhanced with the main architectural concepts. However, the techniques with which those languages have been equipped are mainly conceived to work with synchronous communications only. The objective of this paper is threefold. On the modeling side, we show how to enhance the expressiveness of a typical process algebraic architectural description language by including the capability of representing nonsynchronous communications in such a way that the usability of the original language is preserved. On the verification side, we show how to modify techniques for analyzing the absence of coordination mismatches like the compatibility check for acyclic topologies and the interoperability check for cyclic topologies in such a way that those checks are valid also for nonsynchronous communications. On the implementation side, we show how to generate multithreaded object-oriented software in the presence of synchronous and nonsynchronous communications in such a way that the properties proved at the architectural level are preserved at the code level.

show abstract

Invariant-based specification, synthesis, and verification of synchronization in concurrent programs

Cited by 59 publications

References 24 publications

Logical Concurrency Control from Sequential Proofs

Logical Concurrency Control from Sequential Proofs

On Mechanisms for Deadlock Avoidance in SIP Servlet Containers

Non-synchronous Communications in Process Algebraic Architectural Description Languages

Contact Info

Product

Resources

About