Deductive verification of active objects with Crowbar

Kamburjan, Eduard; Scaletta, Marco; Rollshausen, Nils

doi:10.1016/j.scico.2023.102928

Cited by 6 publications

(2 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We rely on this existing feature of KeY-ABS, and other comparable tools such as ESC/Java [10,5] deal with them similarly with varying degrees of automation. An alternative to KeY is Crowbar [18]. Also here we would have to rely on being able to evaluate circularity-queries in the functional fragment of ABS as part of the proof as just like JML the Behavioral Program Logic is not expressive enough to treat them on the level of specifications.…”

Section: Related Workmentioning

confidence: 99%

I Can See Clearly Now: Clairvoyant Assertions for Deadlock Checking

Abusdal,

Din,

Pun

et al. 2022

The Logic of Software. A Tasting Menu of Formal Methods

View full text Add to dashboard Cite

Static analysers are traditionally used to check various correctness properties of software. In the face of refactorings that can have adverse effects on correctness, developers need to analyse the code after refactoring and possibly revert their changes. Here, we take a different approach: we capture the effect of the Hide Delegate refactoring on programs in the ABS modelling language in terms of the base program, which allows us to predict the correctness of the refactored program. In particular, we focus on deadlock-detection. The actual check is encoded with the help of an additional data structure and assertions. Developers can then attempt to discharge assertions as vacuous with the help of a theorem prover such as KeY. On the one hand, this means that we do not require a specific static analyser nor theorem prover, but rather profit from the strength and advances of modern tool support. On the other hand, developers can choose to rely on existing tests to confirm that no assertion is triggered before executing the actual refactoring. Finally, we argue the correctness of our over-approximation.

show abstract

Section: Related Workmentioning

confidence: 99%

I Can See Clearly Now: Clairvoyant Assertions for Deadlock Checking

Abusdal,

Din,

Pun

et al. 2022

The Logic of Software. A Tasting Menu of Formal Methods

View full text Add to dashboard Cite

show abstract

“…In these projects, ABS has been extended and successfully applied to the formal modelling and analysis of software product families [17] and software services deployed on the Cloud [31]. The ABS tool suite [20,6,35,2,32,4,21,34] has been further applied to case studies, targeting cloud-based frameworks [53,40,30,39,3], railway operations [33] and computational biology. 7 The parallel execution of active objects (see [18] for a survey of active object languages) is a direct consequence of decoupling method execution from method invocation by means of asynchronous method invocations.…”

Section: Introductionmentioning

confidence: 99%

Proving Correctness of Parallel Implementations of Transition System Specifications

Boer¹,

Johnsen²,

Pun³

et al. 2023

Preprint

View full text Add to dashboard Cite

The overall problem addressed in this paper is the long-standing problem of program correctness, and in particular programs that describe systems of parallel executing processes. We propose a new method for proving correctness of parallel implementations of high-level transition system specifications. The implementation language underlying the method is based on the model of active (or concurrent) objects. The method defines correctness in terms of a simulation relation between the transition system which specifies the program semantics and the transition system that is described by the correctness specification. The simulation relation itself abstracts from the fine-grained interleaving of parallel processes by exploiting a global confluence property of the particular model of active objects considered in this paper. As a proof-of-concept we apply our method to the correctness of a parallel simulator of multicore memory systems.

show abstract