Modular completeness: Integrating the reuse of specified software in top-down program development

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1051, Issue , 1996, Pages 595-608

  Zwiers, Job ^a   Hannemann, Ulrich ^b   Lakhneche, Yassine ^b   de Roever, Willem Paul ^b   Stomp, Frank ^c  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF KIEL   (Germany)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; FORMAL METHODS; SPECIFICATIONS;

COMPOSITIONAL SPECIFICATIONS; DEVELOPMENT METHODOLOGY; HOARE LOGIC; PROGRAM DEVELOPMENT; PROOF SYSTEM; SOFTWARE COMPONENT; TOPDOWN;

COMPUTER SOFTWARE REUSABILITY;

EID: 84955610902     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60973-3_109     Document Type: Conference Paper

References (33)

1. Abadi, M., and Lamport L.: Conjoining Specifications, DEC Systems Research Center, Research report (1994)
2. Apt, K. R.: Ten Years of Hoare's Logic, A Survey, Part I, ACM Transactions on Programming Languages and Systems 3:4 (1981) 431-483
3. de Boer, F.: Compositionality in the Inductive Assertion Method for Concurrent Systems, IFIP TC 2 Working Conference on programming concepts, methods and calculi (1994)
4. Cartwright, R., and Oppen, D.: The logic of aliasing, Acta Informatica 15 (1981) 365-384
5. Chen, Z. C., and Hoare, C. A. R.: Partial correctness of CSP, Conf. on Distr. Comp. Sys. (1981)
6. DaM Ole-Johan: Verifiable Programming, Prentice Hall (1992)
7. Dijkstra, E. W.: A discipline of programming, Prentice-Hall (1976)
8. Gibbs, W. W.: Software's Chronic Crisis Scientific American 9 (1994)
9. Gordon, M. é. C., and Melham, T. F.: Introduction to HOL -A theorem proving environment for higher order logic, Cambridge University Press (1993)
10. Gorelick, G. A.: A complete axiomatic system for proving assertions about recursive programs and non-recursiveprograms, TR 75, University of Toronto (1975)
11. Hoare, C. A. R.: The axiomatic basis of programming, Communications of the ACM (1969)
12. Hoare, C. A. R.: Procedures and parameters: An axiomatic approach, Lecture Notes in Mathematics (1971) 102-116
13. Hoare, C. A. R., He Jifeng, and Sanders, J. W.: Prespecification in Data Refinement, Information Processing Letters 25 (1987)
14. Hehner, E. C. R.: Predicative Programming, part I and II, Communications of the ACM 27 (1984)
15. Hannemann, U.: Modular complete proof systems for distributed processes, M. Sc. thesis, University of Kiel (1994)
16. Jones, Cliff B.: Development methods for computer programs including a notion of interference, Oxford (1981)
17. Jones, Cliff B.: Systematic software development using VDM, Prentice-Hall (1986)
18. Lamport, L.: Specifying concurrent program modules, ACM Transactions on Programming Languages and Systems 6(2) (1983)
19. Lamport, L.: The Temporal Logic of Actions, DEC Systems Research Center (1991)
20. Manna, Z., and Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Springer Verlag (1991)
21. Meyer, B.: Object-Oriented Software Construction, Prentice-Hall (1988)
22. Misra, J., and Chandy, K. M.: Proofs of networks of processes, IEEE Transactions on Software Engineering 7:4 (1981)
23. Moszkowski, B.: Some very compositional temporal properties, IFIP TC 2 Working Conference on programming concepts, methods and calculi (1994)
24. Olderog, E. R.: On the Notion of Expressiveness and the Rule of Adaptation, Theoretical Computer Science 24 (1983) 337-347
25. Pandya, P: Compositional Verification of Distributed Programs, Ph.D. thesis, Tara Institute of Fundamental Research, Bombay (1988)
26. P. Pandya, and M. Joseph: P-A logic - a compositional proof system for distributed programs Distributed Computing 5 (1991)
27. Ramesh, S.: On the Completeness of Modular Proof Systems, Information Processing Letters 36 (1990) 195-201 _9
28. Spivey, Mike: The Z notation: A reference manual, Prentice-Hall (1992)
29. Xu Qiwen: A theory of state-based parallel programming, Oxford (1992)
30. Zwiers, J.: Compositionality, Concurrency and Partial Correctness, Lecture Notes in Computer Science 321 (1989)
31. Zwiers, J., de Bruin, A., and de Roever, W. -P.: A proof system for partial correctness of Dynamic Networks of Processes, Lecture Notes in Computer Science 164 (1984)
32. Zwiers, J., de Roever W. -P., and van Emde Boas, P.: Compositionality and concurrent networks: soundness and completeness of a proof system. TR 57, Nijmegen (1984)
33. Zwiers, J., de Roever, W. -P., and van Erode Boas, P.: Compositionality and concurrent networks: soundness and completeness of a proof system, Lecture Notes in Computer Science 194 (1985)