CASL: the Common Algebraic Specification Language

Astesiano, Egidio; Bidoit, Michel; Kirchner, Hélène; Krieg-Brückner, Bernd; Mosses, Peter D.; Sannella, Donald; Tarlecki, Andrzej

doi:10.1016/s0304-3975(01)00368-1

Cited by 143 publications

(82 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Our paper uses algebraic datatypes as a well-studied example of unbounded structured values. Algebraic datatypes are the basis of the algebraic approach to formal specification and verification [2,4,11,12]. The use of the list algebraic datatype was pioneered by LISP [31].…”

Section: Related Workmentioning

confidence: 99%

Relational analysis of algebraic datatypes

Kunčak

Jackson

2005

SIGSOFT Softw. Eng. Notes

View full text Add to dashboard Cite

We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when using the language of sets and relations to reason about structured values such as algebraic datatypes. The key idea of our technique is to identify a natural syntactic class of formulas in relational logic for which reasoning about infinite structures can be reduced to reasoning about finite structures. As a result, when a formula belongs to this class, we can use existing finite model finding tools to check whether the formula holds in the desired infinite model.

show abstract

Section: Related Workmentioning

confidence: 99%

Relational analysis of algebraic datatypes

Kunčak

Jackson

2005

SIGSOFT Softw. Eng. Notes

View full text Add to dashboard Cite

show abstract

“…In the theoretical computer science community a lot of effort has been spent on formalizing abstract data types [2], [13], corresponding optimizations [40], and verification [21]. Also, data structure and algorithmic design for specific problems have been a main research topic in the past [8], [26].…”

Section: Related Workmentioning

confidence: 99%

Memory-access-aware data structure transformations for embedded software with dynamic data accesses

Daylight

Atienza

Vandecappelle

et al. 2004

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

Abstract-Embedded systems are evolving from traditional, stand-alone devices to devices that participate in Internet activity. The days of simple, manifest embedded software [e.g. a simple finite-impulse response (FIR) algorithm on a digital signal processor DSP)] are over. Complex, nonmanifest code, executed on a variety of embedded platforms in a distributed manner, characterizes next generation embedded software. One dominant niche, which we concentrate on, is embedded, multimedia software. The need is present to map large scale, dynamic, multimedia software onto an embedded system in a systematic and highly optimized manner. The objective of this paper is to introduce high-level, systematically applicable, data structure transformations and to show in detail the practical feasibility of our optimizations on three real-life multimedia case studies. We derive Pareto tradeoff points in terms of accesses versus memory footprint and obtain significant gains in execution time and power consumption with respect to the initial implementation choices. Our approach is a first step to systematically applying high-level data structure transformations in the context of memory-efficient and low-power multimedia systems.

show abstract

“…The Operator is the lift user (further denoted by User), the Control machine is the lift controller (that is the software controlling the lift), and the Controlled domain is the lift plant (that is the cabin, the motor, and the doors at the floors), further denoted by LiftPlant. The Controlled domain is equipped with some sensors, which are modelled by the public attributes ) 2 , and is controlled by sending it some pulses, which are modelled by the operations of the interface Pulses. However, a Controlled domain may change its state and the way it works even if it does not receive a pulse (for example, when a part breaks down or when some external entity acts over it).…”

Section: Running Example: the Lift Systemmentioning

confidence: 99%

“…A dashed arrow from a class C to an interface I denotes that C will call the operations of I, whereas a dashed arrow with a solid head from I to C denotes that C will realizes I. 2 The fact that the sensors may break down is modelled by assuming that they may contain some special values corresponding to failures.…”

Section: Running Example: the Lift Systemmentioning

confidence: 99%