Verification of Concurrent Objects with Asynchronous Method Calls

Dovland, Johan; Johnsen, Einar Broch; Owe, Olaf

doi:10.1109/swste.2005.24

Cited by 17 publications

(9 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the best of our knowledge this is a first sound and complete axiomatization of trace reachability for concurrent objects. Doveland et al [7] present a proof theory for concurrent objects that uses traces for compositional reasoning. Their traces satisfy certain well-formedness conditions, but completeness of their wellformedness conditions is not mentioned.…”

Section: Discussionmentioning

confidence: 99%

“…Processing units are dynamically provisioned and interact asynchronously. Such systems are naturally modelled as concurrent object-oriented systems, in which concurrent objects are representing such processing units [7]. Classes of concurrent objects comprise object behaviors that share common behavioral properties, as specified by a concurrent object program.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Axiomatic Characterization of Trace Reachability for Concurrent Objects

Boer

Hiep

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In concurrent object models, objects encapsulate local state, schedule local processes, interact via asynchronous method calls, and methods of different objects are executed concurrently. In this paper, we introduce a compositional trace semantics for concurrent objects and provide an axiomatic characterization of the general properties of reachable traces, that is, traces that can be generated by a concurrent object program. The main result of this paper is a soundness and completeness proof of the axiomatic characterization.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Axiomatic Characterization of Trace Reachability for Concurrent Objects

Boer

Hiep

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Previous work by the third author [7] on the verification of asynchronous method calls was performed in a language without first-class futures. The paper took a transformational approach by encoding the language into a sequential language with a non-deterministic assignment operator.…”

Section: Related Workmentioning

confidence: 99%

A Complete Guide to the Future

Boer

Clarke

Johnsen

2007

Lecture Notes in Computer Science

140

119

View full text Add to dashboard Cite

Abstract. We present the semantics and proof system for an objectoriented language with active objects, asynchronous method calls, and futures. The language, based on Creol, distinguishes itself in that unlike active object models, it permits more than one thread of control within an object, though, unlike Java, only one thread can be active within an object at a given time and rescheduling occurs only at specific release points. Consequently, reestablishing an object's monitor invariant is possible at specific well-defined points in the code. The resulting proof system shows that this approach to concurrency is simpler for reasoning than, say, Java's multithreaded concurrency model. From a methodological perspective, we identify constructs which admit a simple proof system and those which require, for example, interference freedom tests.

show abstract

“…An additional construct in the proof is the communication history, which both the specifications as well as the class invariants talk about. These concepts for reasoning about Creol were introduced in [17,19].…”

Section: Interface and Class Invariantsmentioning

confidence: 99%

A Verification System for Distributed Objects with Asynchronous Method Calls

Ahrendt

Dylla

2009

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. We present a verification system for Creol, an object-oriented modeling language for concurrent distributed applications. The system is an instance of KeY, a framework for object-oriented software verification, which has so far been applied foremost to sequential Java. Building on KeY characteristic concepts, like dynamic logic, sequent calculus, explicit substitutions, and the taclet rule language, the system presented in this paper addresses functional correctness of Creol models featuring local cooperative thread parallelism and global communication via asynchronous method calls. The calculus heavily operates on communication histories which describe the interfaces of Creol units. Two example scenarios demonstrate the usage of the system.

show abstract

Verification of Concurrent Objects with Asynchronous Method Calls

Abstract: Abstract

Cited by 17 publications

References 26 publications

Axiomatic Characterization of Trace Reachability for Concurrent Objects

Axiomatic Characterization of Trace Reachability for Concurrent Objects

A Complete Guide to the Future

A Verification System for Distributed Objects with Asynchronous Method Calls

Contact Info

Product

Resources

About