| A. Diller. Z: An Introduction to Formal Methods. John Wiley & Sons, 2nd edition, 1994. |
....overview of this language below. The different Alloy constructs used in the specification are explained when they are used. 5. 1 The Alloy Specification Language The Alloy specification language was designed by Daniel Jackson [11] It is a first order language that can be viewed as a subset of Z [4]. Alloy is a declarative language similar to the formal specification languages Z [4] and VDM [20] Unlike these languages, Alloy is automatically analyzable in the style of model checking. Models described using this specification language are called micromodels. They are intended to be tiny ....
....are explained when they are used. 5. 1 The Alloy Specification Language The Alloy specification language was designed by Daniel Jackson [11] It is a first order language that can be viewed as a subset of Z [4] Alloy is a declarative language similar to the formal specification languages Z [4], and VDM [20] Unlike these languages, Alloy is automatically analyzable in the style of model checking. Models described using this specification language are called micromodels. They are intended to be tiny models that focus on the risky parts of a system. It might be argued that a model ....
Antoni Diller. Z:An Introduction To Formal Methods. Oreilly, Mai 1996.
....meet extreme dependability goals and without having to show that such goals have in fact been met. The second technique is to obtain the parameters needed for fault tree analysis by some means other than testing or modeling. Many techniques exist, usually within the field of formal methods [5], that can show that a particular software system possesses useful properties without executing the software. If these properties could be used to establish the parameters necessary for fault tree analysis, then the requirement of using testing and Markov models would be avoided. Finally, the ....
Diller, A., Z: An Introduction to Formal Methods. ed. 2, John Wiley & Sons, New York, NY, 1994.
....and how this happens. Formal methods are becoming increasingly important in the development of rigorous engineering practices in many different problem domains. The research community has given birth to a large number of different methods and languages which are commonly accepted as being formal [41, 16, 1, 5, 33]. To promote the use of formal methods in industry we must produce a more unified model of formal software development [19] onto which individual approaches can be mapped. Formal languages have a large number of different roles to play. Consequently, choosing a requirements modelling language ....
A. Diller. An Introduction To Formal Methods. John Wiley and Sons, 1990.
....and principles are present in the problem and solution spaces. ffl How formality can help Mathematical rigour is necessary for formal validation, testing and completeness and consistency checking. The advantages of formal methods in the specification of requirements are well documented (see [6, 3, 9], for example) ffl How formality can hinder Formal methods do not come for free. They require much more rigorous development techniques which are more time consuming and more difficult to master. Furthermore, formal methods risk being too difficult for the client (or engineer) to understand. ....
A. Diller. An Introduction To Formal Methods. John Wiley and Sons, 1990.
.... An animation of a Z specification possesses many of the advantages of the (non executable) original and a small model environment can be provided in order to overcome large domain problems, as suggested by [4] Prolog has previously been used as an animation language for Z [6, 7] and Diller [8] includes the animation of a telephone data base using both a high level functional programming language and Prolog. The prototype Z Gamma Gamma interpreter [9] is a functional language representing an executable subset of Z. A review of work in this field is contained in a paper by Breuer and ....
A Diller. Z: An Introduction to Formal Methods. John Wiley, UK, 1990.
....know which theorems we have to prove. Given an algorithm and its specification we are far away from the actual theorems ensuring correctness of the algorithm. We need to construct a so called verification condition set : a set of theorems that imply the correctness of the original algorithm (see [Dil94]) The classical method that allows one to compute such verification condition sets is the calculus of Hoare ( Hoa69] Using this calculus one deduces triples of the form fPgAfQg with the meaning that program A is correct with respect to precondition P and postcondition Q: A Hoare calculus ....
....that the generator is applicable to every programming language that can be translated into this representation. And it is a minor task to construct a Scheme representation out of a parse tree independently of the original programming language. 1 For an introduction to the Hoare calculus see [Dil94] or [Hoa69] 26 The generator is divides its task into three parts: ffl annotating the algorithm ffl constructing abstract theorems ffl constructing specific theorems The first step consists of annotating the given algorithm: we introduce abstract intermediate predicates P i in sequences and ....
[Article contains additional citation context not shown here]
Antoni Diller, Z --- An Introduction to Formal Methods, 2nd ed., Wiley, New York, 1994. 93
No context found.
A. Diller. Z: An Introduction to Formal Methods. John Wiley & Sons, 2nd edition, 1994.
No context found.
A. Diller. Z: An Introduction to Formal Methods. John Wiley & Sons, 2nd edition, 1994.
No context found.
A. Diller. Z: An Introduction to Formal Methods. John Wiley & Sons, 2nd edition, 1994.
No context found.
A. Diller. Z: An Introduction to Formal Methods. John Wiley & Sons, 1994.
No context found.
A. Diller. Z. An Introduction to Formal Methods. John Wiley and Sons, 1990.
No context found.
Diller, A. (1994), Z. An Introduction to Formal Methods, 2 edn, John Wiley and Sons.
No context found.
Diller, A. (1990), Z. An Introduction to Formal Methods, John Wiley and Sons.
No context found.
A. Diller. Z: An Introduction to Formal Methods. J. Wiley and Sons, 2nd edition, 1994.
No context found.
A. Diller. Z: An introduction to formal methods (2 ed.). J. Wiley and Sons, 1994.
No context found.
A. Diller. Z: An Introduction to Formal Methods. J. Wiley and Sons, 2nd edition, 1994.
No context found.
A. Diller. Z: An Introduction to Formal Methods. J. Wiley and Sons, 2nd edition, 1994.
No context found.
A. Diller. Z: An Introduction to Formal Methods. J. Wiley and Sons, 2nd edition, 1994.
No context found.
Diller A.: Z An Introduction to Formal Methods. Wing's Library Problem. John Wiley and Sons Ltd. (1994)
No context found.
A. Diller, Z: An Introduction to Formal Methods, John Wiley and Sons, New York, NY (1990).
No context found.
Diller, A. Z: An Introduction to Formal Methods. John Willey & Sons, 1990.
No context found.
A. Diller, Z an Introduction to Formal Methods, John Wiley & Sons, 1990.
No context found.
DILLER, A.. Z An introduction to Formal Methods, John Wiley & Sons, 1994, 2 nd Edition.
No context found.
A. Diller. Z: An Introduction to Formal Methods. John Wiley & Sons, 1990. This book offers a comprehensive tutorial to Z from the practical viewpoint. Many natural deduction style proofs are presented and exercises are included. A second edition is in preparation.
No context found.
Antoni Diller: Z: An Introduction to Formal Methods, (2nd ed) John Wiley and Sons, Inc., New York (1994).
First 50 documents Next 50
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