A Fully Abstract Semantics for UML Components

Boer, Frank S. de; Bonsangue, Marcello M.; Steffen, Martín; Ábrahám, Erika

doi:10.1007/11561163_3

Cited by 9 publications

(8 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, their semantics avoids the issue of object connectivity by using a notion of package. [7] tackles the problem of full abstraction and observable component behavior and connectivity in a UML-setting.…”

Section: Resultsmentioning

confidence: 99%

Heap-Abstraction for an Object-Oriented Calculus with Thread Classes

Ábrahám

Grüner

Steffen

2006

Logical Approaches to Computational Barriers

View full text Add to dashboard Cite

Abstract. From an observational point of view, considering classes as part of a component makes instantiation a possible interaction between component and environment or observer. For thread classes it means that a component may create external activity, which influences what can be observed. The fact that cross-border instantiation is possible requires that the connectivity of the objects needs to be incorporated into the semantics. We extend our prior work not only by adding thread classes, but also in that thread names may be communicated, which means that the semantics needs to account explicitly for the possible acquaintance of objects with threads. This paper formalizes an open semantics for a calculus featuring thread classes, where the environment, consisting in particular of an overapproximation of the heap topology, is abstractly represented. We show basic soundness results of the abstraction.

show abstract

Section: Resultsmentioning

confidence: 99%

Heap-Abstraction for an Object-Oriented Calculus with Thread Classes

Ábrahám

Grüner

Steffen

2006

Logical Approaches to Computational Barriers

View full text Add to dashboard Cite

show abstract

“…also [14]. [5] tackles the problem of full abstraction and observable component behavior and connectivity in a UML-setting. Unlike this contribution, [5] features concurrency Future work The trace semantics together with the equivalence relation capturing the undefinednes of order of interacting with separe cliques is a "tree" semantics.…”

Section: Resultsmentioning

confidence: 99%

“…[5] tackles the problem of full abstraction and observable component behavior and connectivity in a UML-setting. Unlike this contribution, [5] features concurrency Future work The trace semantics together with the equivalence relation capturing the undefinednes of order of interacting with separe cliques is a "tree" semantics. As illustrated also by the informal examples of Section 2, the semantics more precisely can be understood as a forest of interactions, where each tree represents one current clique of objects.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Observability, Connectivity, and Replay in a Sequential Calculus of Classes

Ábrahám

Bonsangue

Boer

et al. 2005

Formal Methods for Components and Objects

View full text Add to dashboard Cite

Abstract. Object calculi have been investigated as semantical foundation for object-oriented languages. Often, they are object-based, whereas the mainstream of object-oriented languages is class-based. Considering classes as part of a component makes instantiation a possible interaction between component and environment. As a consequence, one needs to take connectivity information into account. We formulate an operational semantics that incorporates the connectivity information into the scoping mechanism of the calculus. Furthermore, we formalize a notion of equivalence on traces which captures the uncertainty of observation cause by the fact that the observer may fall into separate groups of objects. We use a corresponding trace semantics for full abstraction wrt. a simple notion of observability. This requires to capture the notion of determinism for traces where classes may be instantiated into more than one instance during a run and showing thus twice an equivalent behavior (doing a "replay"), a problem absent in an object-based setting.

show abstract

“…The resulting specification language describes properties of the protocol of the program. While sequence diagrams have been used in theoretical studies for verification purposes [24,50], to the best of our knowledge, sequence diagrams as a specification language have not been used in actual tools for static or run-time verification. There are several reasons for this.…”

mentioning

confidence: 99%

Combining Monitoring with Run-Time Assertion Checking

Boer

Gouw

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. According to a study in 2002 commisioned by a US Department, software bugs annually costs the US economy an estimated $59 billion 1 . A more recent study in 2013 by Cambridge University estimated that the global cost has risen to $312 billion globally 2 .There exists various ways to prevent, isolate and fix software bugs, ranging from lightweight methods that are (semi)-automatic, to heavyweight methods that require significant user interaction. Our own method described in this tutorial is based on automated run-time checking of a combination of protocol-and data-oriented properties of object-oriented programs. Run-Time Checking of Object-Oriented ProgramsGiven a program and a specification, a run-time verifier inserts checks in the code that determine whether the specification is satisfied. The checks are triggered during an actual execution of the program. In contrast to static verification, where properties are checked with respect to all executions (possibly there are infinitely many), run-time checkers only consider a single execution of the program. There is a wide range of specification languages used in run-time verification. They can be partitioned into two categories: languages that focus on the control-flow (these approaches are also called "monitoring"), and those focussing on data-flow.As an example, one can use regular expressions to specify the order in which functions or methods in a program should be called [18]. Such specifications describe the control-flow of the program. Other formalisms for specifying controlflow are temporal logics, various kinds of automata and context-free grammars. For these formalisms, checking whether a given property holds of the current execution involves parsing a word (where the word is some representation of the trace of method calls in the current execution) in an automata. Generally only formalisms are chosen with a decidable parsing problem (in particular, this is the case for regular expressions, context-free grammars and most automata), so Approaches that specify data-flow usually do so by annotating the source code with assertions: logical formulas that must be true whenever control passes them. The formulas constrain the values of the program variables. If assertions are expressed in first-order logic with arithmetic, it is in general undecidable due to unbounded quantification (i.e. ranging over an infinite number of values) whether the assertion is true, thus usually the assertions are restricted in some way. For instance, Java contains an assert-statement which restricts to quantifier-free formulas (i.e. Boolean expressions). Design by Contract [53] provides a systematic way of using assertions to specify classes, interfaces and methods with respectively class invariants and pre-and postconditions. It was first used in the programming language Eiffel, and subsequently has also been applied to many other programming languages. For example, JML [14] is one of the most popular specification languages for Java and supports Design by Contract. JML...

show abstract

A Fully Abstract Semantics for UML Components

Cited by 9 publications

References 22 publications

Heap-Abstraction for an Object-Oriented Calculus with Thread Classes

Heap-Abstraction for an Object-Oriented Calculus with Thread Classes

Observability, Connectivity, and Replay in a Sequential Calculus of Classes

Combining Monitoring with Run-Time Assertion Checking

Contact Info

Product

Resources

About