A Modular Scheme for Deadlock Prevention in an Object-Oriented Programming Model

West, Scott; Nanz, Sebastian; Meyer, Bertrand

doi:10.1007/978-3-642-16901-4_39

Cited by 13 publications

(11 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Scoop Analysis/Verification. Various analyses for Scoop programs have been proposed, including: using a Scoop virtual machine for checking temporal properties [29]; checking Coffman's deadlock conditions using an abstract semantics [7]; and statically checking code annotated with locking orders for the absence of deadlock [39]. In contrast to our work, these approaches are tied to particular (and now obsolete) execution models, and do not operate on (unannotated) source code.…”

Section: Related Workmentioning

confidence: 99%

A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs

Corrodi¹,

Heubner²,

Poskitt³

2016

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. A number of novel programming languages and libraries have been proposed that offer simpler-to-use models of concurrency than threads. It is challenging, however, to devise execution models that successfully realise their abstractions without forfeiting performance or introducing unintended behaviours. This is exemplified by Scoop-a concurrent object-oriented message-passing language-which has seen multiple semantics proposed and implemented over its evolution. We propose a "semantics workbench" with fully and semi-automatic tools for Scoop, that can be used to analyse and compare programs with respect to different execution models. We demonstrate its use in checking the consistency of semantics by applying it to a set of representative programs, and highlighting a deadlock-related discrepancy between the principal execution models of the language. Our workbench is based on a modular and parameterisable graph transformation semantics implemented in the Groove tool. We discuss how graph transformations are leveraged to atomically model intricate language abstractions, and how the visual yet algebraic nature of the model can be used to ascertain soundness.

show abstract

Section: Related Workmentioning

confidence: 99%

A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs

Corrodi¹,

Heubner²,

Poskitt³

2016

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…Scoop Analysis / Verification. Various analyses for Scoop programs have been proposed, including: using a Scoop virtual machine for checking temporal properties [OTHS09]; checking Coffman's deadlock conditions using an abstract semantics [CM17]; and statically checking code annotated with locking orders for the absence of deadlock [WNM10]. In contrast to our work, these approaches are tied to particular (and now obsolete) execution models, and do not operate on (unannotated) source code.…”

Section: Related Workmentioning

confidence: 99%

A semantics comparison workbench for a concurrent, asynchronous, distributed programming language

2018

View full text Add to dashboard Cite

Abstract. A number of high-level languages and libraries have been proposed that offer novel and simple to use abstractions for concurrent, asynchronous, and distributed programming. The execution models that realise them, however, often change over time-whether to improve performance, or to extend them to new language features-potentially affecting behavioural and safety properties of existing programs. This is exemplified by Scoop, a message-passing approach to concurrent object-oriented programming that has seen multiple changes proposed and implemented, with demonstrable consequences for an idiomatic usage of its core abstraction. We propose a semantics comparison workbench for Scoop with fully and semiautomatic tools for analysing and comparing the state spaces of programs with respect to different execution models or semantics. We demonstrate its use in checking the consistency of properties across semantics by applying it to a set of representative programs, and highlighting a deadlock-related discrepancy between the principal execution models of Scoop. Furthermore, we demonstrate the extensibility of the workbench by generalising the formalisation of an execution model to support recently proposed extensions for distributed programming. Our workbench is based on a modular and parameterisable graph transformation semantics implemented in the Groove tool. We discuss how graph transformations are leveraged to atomically model intricate language abstractions, how the visual yet algebraic nature of the model can be used to ascertain soundness, and highlight how the approach could be applied to similar languages.

show abstract

“…A client object must acquire an exclusive lock on a separate object before invoking it through a routine. SCOOP was ported to Java [44] but is not inherently deadlock-free [45]. Some recent lock-inference techniques are deadlock-free, yet they require the programmer to provide a semantic description of methods [46].…”

Section: Related Workmentioning

confidence: 99%

Reusable Concurrent Data Types

Gramoli

Guerraoui

2014

ECOOP 2014 – Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. This paper contributes to address the fundamental challenge of building Concurrent Data Types (CDT) that are reusable and scalable at the same time. We do so by proposing the abstraction of Polymorphic Transactions (PT): a new programming abstraction that offers different compatible transactions that can run concurrently in the same application.We outline the commonality of the problem in various object-oriented languages and implement PT and a reusable package in Java. With PT, annotating sequential ADTs guarantee novice programmers to obtain an atomic and deadlock-free CDT and let an advanced programmer leverage the application semantics to get higher performance.We compare our polymorphic synchronization against transaction-based, lockbased and lock-free synchronizations on SPARC and x86-64 architectures and we integrate our methodology to a travel reservation benchmark. Although our reusable CDTs are sometimes less efficient than non-composable handcrafted CDTs from the JDK, they outperform all reusable Java CDTs.

show abstract

A Modular Scheme for Deadlock Prevention in an Object-Oriented Programming Model

Cited by 13 publications

References 10 publications

A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs

A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs

A semantics comparison workbench for a concurrent, asynchronous, distributed programming language

Reusable Concurrent Data Types

Contact Info

Product

Resources

About