Specification of abstract dynamic-data types: A temporal logic approach

Specifying Software Connectors

“…Our current concerns include, in particular, the full developement of a calculus of software connectors emerging from the coalgebraic model and its use in reasoning about the typical software architectural patterns [1,12] and their laws. How easily this work scales up to accommodate dynamically re-configurable architectures, as in, e.g., [11] or [26], remains an open challenging question. We are also currently working on the development of an Haskell based platform for prototyping this model, allowing the user to define and compose, in an interactive way, his/her own software connectors.…”

A Temporal Approach to Specification and Verification of Pointer Data-Structures

“…Therefore it arises a natural question of usability of temporal logics for specification of pointer data-structures. The general idea of using temporal logics for the specification of abstract data-types is not new [5,8,16], however the idea of using it for the purpose of the specification of a pointer data-structure is novel.…”

“…However, the formalism for specification of pointer data-structures proposed here is different. It is an adaptation of temporal specifications of dynamic algebras [5]-an extension of first-order logic with temporal branching-time combinators. In our approach we interpret the notion of direct consequence in time as a pointer link.…”

Mixed formal specifications with PVS

“…A full comparison with existing works would be too long, related works are [5,2,6,4]. We have chosen an integrated approach [13] with a single semantic framework based on partial algebras [17].…”

“…A related approach is [4] which can be seen as a more general and more complex approach. We provide a simpler way which does not need any special kind of dynamic data types and it uses classical partial abstract data types.…”