Casl Reference Manual

Mosses, Peter D.

doi:10.1007/b96103

Cited by 54 publications

(4 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Heterogeneous Tool-Set Hets provides a framework for heterogeneous specifications where each formalism is represented as a logic and understood in the theory of institutions [9]. Our logic for EVT utilises the already existing institution CASL [10] to account for the FOPEQ parts of the EVT institution thus taking advantage of the interoperability/heterogeneity supplied by Hets. CASL provides sorts and predicates like those written in lines 4-6 from Fig.…”

Section: Discussionmentioning

confidence: 99%

“…The axiom on line 5 explicitly restricts the set to only contain the constants red, green and orange. Figure 1 specifies five different events (including a starting event called Initialisation defined on lines [8][9][10]. Each event has a guard, specifying when it can be activated, and an action, specifying what happens when the event is activated.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Institution for Event-B

Farrell

Monahan

Power

2017

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

This paper presents a formalisation of the Event-B formal specification language in terms of the theory of institutions. The main objective of this paper is to provide: (1) a mathematically sound semantics and (2) modularisation constructs for Event-B using the specification-building operations of the theory of institutions. Many formalisms have been improved in this way and our aim is thus to define an appropriate institution for Event-B, which we call EVT. We provide a definition of EVT and the proof of its satisfaction condition. A motivating example of a traffic-light simulation is presented to illustrate our approach.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An Institution for Event-B

Farrell

Monahan

Power

2017

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

show abstract

“…Event-B [1] or Z [28]), or algebraic specifications (e.g. CSP [18] or CASL [24]) amongst others to specify the components in the system. Each of these formalisms offers its own range of benefits, and each tends to suit the verification of particular types of behaviour.…”

Section: A First-order Logic Frameworkmentioning

confidence: 99%

Towards Compositional Verification for Modular Robotic Systems

Cardoso

Dennis

Farrell

et al. 2020

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Software engineering of modular robotic systems is a challenging task, however, verifying that the developed components all behave as they should individually and as a whole presents its own unique set of challenges. In particular, distinct components in a modular robotic system often require different verification techniques to ensure that they behave as expected. Ensuring whole system consistency when individual components are verified using a variety of techniques and formalisms is difficult. This paper discusses how to use compositional verification to integrate the various verification techniques that are applied to modular robotic software, using a First-Order Logic (FOL) contract that captures each component's assumptions and guarantees. These contracts can then be used to guide the verification of the individual components, be it by testing or the use of a formal method. We provide an illustrative example of an autonomous robot used in remote inspection. We also discuss a way of defining confidence for the verification associated with each component.

show abstract

“…The partiality of computable functions is most commonly addressed by either allowing partial structures [9,1,16], or by referring to domains, in which an object ⊥ denotes divergence. Yet another approach, adopted here, is based on the "global" behavior of programs in all (usual, non-partial) structures.…”

Section: Equational Programs Over Data Systems 21 Equational Programsmentioning

confidence: 99%

Implicit complexity for coinductive data: a characterization of corecurrence

Leivant

Ramyaa²

2012

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We propose a framework for reasoning about programs that manipulate coinductive data as well as inductive data. Our approach is based on using equational programs, which support a seamless combination of computation and reasoning, and using productivity (fairness) as the fundamental assertion, rather than bi-simulation. The latter is expressible in terms of the former. As an application to this framework, we give an implicit characterization of corecurrence: a function is definable using corecurrence iff its productivity is provable using coinduction for formulas in which data-predicates do not occur negatively. This is an analog, albeit in weaker form, of a characterization of recurrence (i.e. primitive recursion) in [Leivant, Unipolar induction, TCS 318, 2004]

show abstract

Casl Reference Manual

Cited by 54 publications

References 37 publications

An Institution for Event-B

An Institution for Event-B

Towards Compositional Verification for Modular Robotic Systems

Implicit complexity for coinductive data: a characterization of corecurrence

Contact Info

Product

Resources

About