17 citations found. Retrieving documents...
J.B. Wordsworth. Software Engineering with B. Addison-Wesley, 1996.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Generalized Quantifiers in Logic Programs - Eiter, Gottlob, Veith (1997)   (Correct)

....is presented, and occurrences of generalized quantifiers in existing database query languages are discussed. Further applications of generalized quantifiers in computer science are in software engineering, where generalized quantifiers are used in the specifications of the Z and B notation [52, 65]. Moreover, generalized quantifiers have also been investigated in the context of fuzzy logic [26] which has become popular in computer science more recently. In this paper, we address another application of generalized quantifiers in computer science; namely, in the field of logic programming. ....

J. Wordsworth. Software Engineering with B. Addison Wesley, 1996.


Extended Static Checking for Java - Flanagan, Leino, Lillibridge.. (2002)   (110 citations)  (Correct)

....the full verification of programs. While most such systems have remained in academic labs where they have been applied to small textbook programs or the verification of specific algorithms, some systems have been applied to actual safety critical programs. A successful example is the B system [48], which was used to construct a part of the Metro subway system in Paris. Another example of a fullverification tool is Perfect Developer for the object oriented language Escher [14] Both the B and Escher systems restrict the programming language to various extents and require some manual ....

J. B. Wordsworth. Software Engineering with B. Addison-Wesley, 1996.


Specification and Verification of Spatial Data types with the .. - Chun, Van Hung (2001)   (Correct)

....within inter prover. After adding more user de ned rules for the proof of remaining subgoals, the auto prover is invoked again. This process is repeated again until no unproved subgoal exists. This routine is called auto prover inter prover cycle. Other details on the B Method can be found in [1] [4]. 3 Realms: B Speci cation 3.1 Grid: Grid Points and Grid Segments In this section we present basic type machines for a realm. Given a non zero natural number n, a grid is the set of points in a two dimensional space with integer coordinates ranging from 0 to n 1. Let N be the set of integers ....

J.B.Wordsworth. Software Engineering with B. Addison-Wesley, rst edition, 1996.


The B Bank: A Complete Case Study - Büchi (1998)   (1 citation)  (Correct)

....where higher level specifications are implemented using lower level constructs. Refinement is the key notion between a specification and its implementation. Notation is quite standard; we give additional explanations where appropriate. For a thorough introduction to B, the reader may consult [12, 14, 19, 1]. Steria s Atelier B in version 3.2.2 [18] has been used in this case study. The final code has also been ported to BCore s B Toolkit 3.4.2 [2] Both tools include analyzers, animators, proof obligation generators, proof tools, code translators, and documentation facilities. Atelier B, which ....

J. B. Wordsworth. Software Engineering with B. AddisonWesley, 1996.


Safe Language Mechanisms for Modularization and Concurrency - Büchi (2000)   (3 citations)  (Correct)

....of physical processes and allow for accurate notions of fairness [5] However, models of true concurrency tend to be very complex. If, on the other hand, we are only concerned with the functional, untimed correctness of a program, we can use the more abstract interleaving model of concurrency [17]. In an interleaving semantics, we think of concurrent atomic transactions to be executed in an arbitrary sequential order. For example, if processor 1 executes S and processor 2 executes T, then we consider the sequential executions S; T and T; S in our reasoning, rather than the parallel S # ....

....systems. In Handbook of Computer Science and Engineering, chapter 103. CRC Press, 1997. http: www.luca.demon.co.uk Papers.html. 15] K. M. Chandy and J. Misra. Parallel Program Design A Foundation. Addison Wesley, 1988. 16] David Chappell. Understanding ActiveX and OLE. Microsoft Press, 1996. [17] Rance Cleaveland and Scott A. Smolka, editors. Strategic directions in concurrency research. ACM Computing Surveys, 28(4) 607 625, December 1996. 18] Component Source. http: www.componentsource.com. 19] William Cook. A proposal for making Eiffel type safe. In Proceedings of ECOOP 89, pages ....

[Article contains additional citation context not shown here]

J. B. Wordsworth. Software Engineering with B. Addison-Wesley, 1996.


Engineering and Theoretical Underpinnings of Retrenchment - Banach, Poppleton (2001)   (1 citation)  (Correct)

....denied by researchers and held as selfevident by practitioners. The main motivation for the subject of this paper, retrenchment, is to help to assuage this dissonance. Retrenchment, which was first introduced in [Banach and Poppleton (1998) in the specific context of the B Method [Abrial (1996a) Wordsworth (1996), Lano and Haughton (1996) Sekerinski and Sere (1998) is a more liberal formal technique, based on the main ideas of refinement, and is intended so that some pairs of models which cannot be related within a development by refinement alone, can nevertheless be included within a formal ....

Wordsworth J. B. (1996); Software Engineering with B. Addison-Wesley.


Retrenchment, Refinement and Simulation - Banach, Poppleton (2000)   (Correct)

....results are easy to derive, and modulated refinements of the two kinds are recovered. Section 7 returns to the original example and Section 8 concludes. Notation. In the body of the paper we use the B Abstract Machine Notation for model oriented specification and system development (see [2, 3, 4, 5]) This provides a comprehensive syntax and semantics for the concepts of refinement most used in development, and our ideas slot very neatly into the B framework. Nevertheless the ideas of the paper are independent of notation, and readily apply to other approaches. 2 Some Inadequacies of ....

Wordsworth J. B. Software Engineering with B. Addison-Wesley, 1996.


Fragmented Retrenchment, Concurrency and Fairness - Banach, Poppleton   (Correct)

....software toolkits are unable to work within any medium other than a syntactic one. For simplicity of exposition we are avoiding such issues as much as possible in this paper, but sensitivity to them explains in large part the motivation for introducing retrenchment originally within the B Method [6, 7, 8]. Our restriction to forwards simulation techniques in this paper is also inspired by the B Method. 3 Fragmented Retrenchment In (normal) retrenchment, one abstract step corresponds to one concrete step as we have seen. In fragmented retrenchment we allow many steps at the concrete level to ....

Wordsworth J. B. Software Engineering with B. Addison-Wesley, 1996.


Formal Methods For The Re-Engineering of Computing Systems - Liu, Yang, Zedan (1997)   (Correct)

....formal foundation. Time is not a part of VDM notation. When trying to apply VDM to real time domain, novel features have to be added to VDM. VDM also keeps developing: VDM , as a new version of VDM integrated with object oriented idea, is a rather mature product now. ffl B Method [36] 37] [62]. The B method uses the Abstract Machine Notation to support the description of the target systems. The most eminent success of B method is that it already has a strong and quite mature tool B Toolkit, to support and automate the development of application systems. The B Method is complete in ....

Wordsworth, J., Software Engineering with B, Addison Wesley Longman, ISBN 0-201-40356-0., 1996.


Retrenchment: An Engineering Variation on Refinement - Banach, Poppleton (1998)   (9 citations)  (Correct)

....world considerations. For example, mathematics can express the fact that the mundane naturals are finite, but it cannot derive this fact from some convincingly self evident abstract criteria. 3 Incorporating Retrenchment in the B Method The B Method [Abrial (1996) Lano and Haughton (1996) Wordsworth (1996)] is a semantically well founded and structurally rich methodology for full lifecycle formal software development. As such it provides an ideal framework into which to embed the retrenchment concept, since it already provides syntactic structure for expressing the refinement relation between ....

Wordsworth J. B. (1996); Software Engineering with B. Addison-Wesley.


Retrenchment, Refinement, and Notions of Simulation - Banach, Poppleton   (Correct)

....are easy to derive, and modulated refinements of the two kinds are recovered. Section 7 returns to the original example and section 8 concludes. Notation. In the body of the paper we use the B Abstract Machine Notation for model oriented specification and system development (see [Abrial (1996) Wordsworth (1996), Lano and Haughton (1996) Sekerinski and Sere (1998) This provides a comprehensive syntax and semantics for the concepts of refinement most used in development, and our ideas slot very neatly into the B framework. Nevertheless the ideas of the paper are independent of notation, and readily ....

Wordsworth J. B. (1996); Software Engineering with B. Addison-Wesley.


Retrenchment and Punctured Simulation - Banach, Poppleton (1999)   (Correct)

....7, another special case is introduced, memoryless regular retrenchment, and a similar unique domain property is established. Section 8 presents a small case study of a model power generation plant to illustrate punctured simulation. Section 9 concludes. The B Method and Abstract Machine Notation [2, 3, 4] are used throughout the paper. By providing in particular a fixed syntactic framework for refinement, they provide a very convenient structure into which the ideas of retrenchment can be placed. This also helps in comparing refinement and retrenchment although a thorough treatment of that topic ....

Wordsworth J. B. Software Engineering with B. Addison-Wesley, 1996.


Sharp Retrenchment, Modulated Refinement and Punctured.. - Banach, Poppleton   (Correct)

....but we show that under certain circumstances, so called large maximal punctured simulations have unique domains. Section 11 concludes. Notation. In the body of the paper we use the B Abstract Machine Notation for model oriented specification and system development (see [Abrial (1996a) Wordsworth (1996), Lano and Haughton (1996) Sekerinski and Sere (1998) This has the virtue of being a semantically solid formalism that features a satisfying degree of syntactic completeness, including specific concrete syntax for declarations, initialisation, operation specification, and most particularly for ....

Wordsworth J. B. (1996); Software Engineering with B. Addison-Wesley.


Retrenchment and the B-Toolkit - Richard Banach And   (Correct)

No context found.

J.B. Wordsworth. Software Engineering with B. Addison-Wesley, 1996.


Pigs from Sausages? Reengineering from Assembler to C via FermaT.. - Ward (2004)   (Correct)

No context found.

John Wordsworth, Software Engineering with B, Addison Wesley Longman, ISBN 0-201-40356-0., 1996.


Performing Algorithmic Refinement before Data Refinement in B - Butler, Meagher (2000)   (1 citation)  (Correct)

No context found.

J.B. Wordsworth. Software Engineering with B. Addison-Wesley,1996. 18


A Prototype Generic Tool - Supporting The Embedding (1998)   (Correct)

No context found.

Wordsworth JB, Software Engineering with B, Addison Wesley, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC