Searching for authors named "Dominique Cansell" – sorted by Relevance.
8 documents found, showing 1 through 8.
-
Abstraction and Refinement of Features
- …. The composition of services and features often leads to unwanted situations, because it is a non-monotonic operation over services and features. When a new service is added to an existing system, conditions have to be checked to ensure that the resulting system satisfies a list of required propert…
- Cited by 1 (0 self) – Add To MetaCart
-
Formal construction of a non-blocking concurrent queue algorithm (a case study in atomicity
- …Abstract: This paper contains a completely formal (and mechanically proved) development of some algorithms dealing with a linked list supposed to be shared by various processes. These algorithms are executed in a highly concurrent fashion by an unknown number of such independent processes. These alg…
- Cited by 6 (0 self) – Add To MetaCart
-
Foundations Of The B Method
- …B is a method for specifying, designing and coding software systems. It is based on Zermelo-Fraenkel set theory with the axiom of choice, the concept of generalized substitution and on structuring mechanisms (machine,refinement, implementation). The concept of refinement is the key notion for devel…
- Cited by 4 (0 self) – Add To MetaCart
-
Diagram refinements for the design of reactive systems
- …Abstract: We define a class of predicate diagrams that represent abstractions of—possibly infinite-state—reactive systems. Our diagrams support the verification of safety as well as liveness properties. Non-temporal proof obligations establish the correspondence between the original specification, w…
- Cited by 5 (2 self) – Add To MetaCart
-
Modelling and proof analysis of interrupt driven scheduling
- …Abstract. Following a brief discussion of uniprocessor scheduling in which we argue the case for formal analysis, we describe a distributed Event B model of interrupt driven scheduling. We first consider a model with two executing tasks, presented with the aid of state machine diagrams. We then pres…
- Cited by 1 (0 self) – Add To MetaCart
-
Validating and animating higher-order recursive functions in B. Submitted; preliminary version presented at Dagstuhl Seminar 06191 Rigorous Methods for Software Construction and Analysis
- …Abstract. ProB is an animation and model checking tool for the B Method, which can deal with many interesting specifications. Some specifications, however, contain complicated functions which cannot be represented explicitly by a tool. We present a scheme with which higher-order recursive functions …
- Cited by 2 (2 self) – Add To MetaCart
-
Designing Event-Driven Systems By Combining Coordination and Refinement
- …The coordination paradigm improves the development of concurrent/distributed solutions, because it provides simple way to communicate between processes via a data structure called a tuple space. Coordination principles and event-driven system development principles can be fruitfully combined to …
- Add To MetaCart
-
Incremental Parametric Development of Greedy Algorithms
- …The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properties. We address the problem of development of greedy algorithms using the seminal work of S. Curtis; she has formalised gr…
- Cited by 2 (1 self) – Add To MetaCart
Showing 1 through 8.
