E-Books durchsuchen
5th Refinement Workshop [1992]
- 1
-
Opening Address
- 3
-
Concurrent Processes as Objects
- 4
-
Formalising Dijkstra’s Development Strategy within Stark’s Formalism
- 43
-
A Recursion Removal Theorem
- 70
-
Demonstrating the Compliance of Ada Programs with Z Specifications
- 88
-
Methods and Tools for the Verification of Critical Properties
- 119
-
Refinement and Confidentiality
- 140
-
Software Reification using the SETS Calculus
- 172
-
Classification of Refinements in VDM
- 181
-
Constructive Refinement of First Order Specifications
- 211
-
A Model of the Refinement Process
- 230
-
A Window Inference Tool for Refinement
- 255
-
Using Metavariables in Natural Deduction Proofs
- 272
-
A Tactic Driven Refinement Tool
- 298
-
Revisiting Abstraction Functions For Reasoning About Concurrency
- 301
-
A case study in formally developing state-based parallel programs—the Dutch National Torus
- 320
-
Proving Total Correctness with Respect to a Fair (Shared-State) Parallel Language
- 342
-
A Note on Compositional Refinement
- 367
-
Implementing Promoted Operations in Z