Abstract. The notion of agents has provided a way of imbuing traditional computing systems with an extra degree of flexibility that allows them to be more resilient and robust in t...
We propose an extension to Z whereby generic parameters may have their types partially constrained. Using this mechanism it becomes possible to dene in Z much of its own schema cal...
Samuel H. Valentine, Ian Toyn, Susan Stepney, Stev...
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Abstract. This paper presents some of our requirements for a Z typechecker: that the typechecker accept all well-typeable formulations, however contrived; that it gather informatio...
Ian Toyn, Samuel H. Valentine, Susan Stepney, Stev...
We have recently completed the specication and security proof of a large, industrial scale application. The application is security critical, and the modelling and proof were done ...
Unlike Z, Object-Z allows schemas to be defined recursively. This enables mutual and self recursive structures, commonly occurring in object-oriented programs, to be readily specif...
with abstraction and refinement for managing features interactions A methodological approach to feature interaction problem Dominique Cansell and Dominique M
We present a computation model for Z, which is based on a reduction to a small calculus, called Z, and on concurrent constraint resolution techniques applied for computing in thi...
: Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models t...
Abstract. This paper reports on an experimental application of formal specification to inform analysis of compiled code. The analyses with are concerned attempt to recover abstract...