The ASM ground model method as a foundation of requirements engineering

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

Volumn 2772, Issue , 2004, Pages 145-160

  Börger, Egon ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ABSTRACT STATE MACHINES; COMPUTER-BASED SYSTEM; ENGINEERING METHODS; EXECUTABLE CODES; GROUND MODELS; REFINEMENT METHODS;

REQUIREMENTS ENGINEERING;

EID: 35248893023     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (32)

1. Methodologies and technologies for industrial strength systems engineering. http://www.matisse.qinetiq.com/, 1999. Project number IST-1999-11435.
2. J.-R. Abrial. The B-Book. Cambridge University Press, 1996.
3. D. Barnocchi. L''Evidenza' nell'assiomatica aristotelica (contributo all'interpretazione dell'assiomatica aristotelica alla luce della moderna logica matematica). Proteus, 5:133-144, 1971.
4. D. M. Berry. The importance of ignorance in requirements engineering. J. of Systems and Software, 28(2):179-184, 1995.
5. D. M. Berry. Formal methods: the very idea, some thoughts on why they work when they work. Science of Computer Programming, 42(1):11-27, 2002.
6. D. M. Berry. The inevitable pain of software development: Why there is no silver bullet. In Proceedings of Monterey Workshop 2002: Radical Innovations of Software and Systems Engineering in the Future, October 2002.
7. E. Börger. A logical operational semantics for full Prolog. Part I: Selection core and control. In E. Börger, H. Kleine Büning, M. M. Richter, and W. Schönfeld, editors, CSL'89. 3rd Workshop on Computer Science Logic, volume 440 of LNCS, pages 36-64. Springer-Verlag, 1990.
8. E. Börger. A logical operational semantics of full Prolog. Part II: Built-in predicates for database manipulation. In B. Rovan, editor, Mathematical Foundations of Computer Science, volume 452 of LNCS, pages 1-14. Springer-Verlag, 1990.
9. E. Börger. Logic programming: The evolving algebra approach. In B. Pehrson and I. Simon, editors, IFIP 13th World Computer Congress, volume I: Technology/Foundations, pages 391-395, Elsevier, Amsterdam, the Netherlands, 1994.
10. E. Börger. Why use evolving algebras for hardware and software engineering? In M. Bartosek, J. Staudek, and J. Wiederman, editors, Proceedings of SOFSEM'95, 22nd Seminar on Current Trends in Theory and Practice of Informatics, volume 1012 of LNCS, pages 236-271. Springer-Verlag, 1995.
11. E. Börger. High level system design and analysis using abstract state machines. In D. Hutter, W. Stephan, P. Traverso, and M. Ullmann, editors, Current Trends in Applied Formal Methods (FM-Trends 98), number 1641 in LNCS, pages 1-43. Springer-Verlag, 1999.
12. E. Börger. The ASM refinement method. Formal Aspects of Computing, 14, 2003, to appear.
13. E. Börger and K. Dässler. Prolog: DIN papers for discussion. ISO/IEC JTCI SC22 WG17 Prolog Standardization Document 58, National Physical Laboratory, Middlesex, England, 1990.
14. E. Börger, B. Hörger, D. L. Parnas, and D. Rombach. Requirements Capture, Documentation, and Validation, volume 241. Dagstuhl Seminar No. 99241, June 1999.
15. E. Börger and J. Schmid. Composition and submachine concepts for sequential ASMs. In P. Clote and H. Schwichtenberg, editors, Computer Science Logic (Proceedings of CSL 2000), volume 1862 of LNCS, pages 41-60. Springer-Verlag, 2000.
16. E. Börger and R. Stärk. Abstract State Machines. A Method for High-Level System Design and Analysis. Springer, 2003.
17. F. P. J. Brooks. No silver bullet. Computer, 20(4):10-19, 1987.
18. R. Carnap. The methodological character of theoretical concepts. In H. Feigl and M. Scriven, editors, Minnesota Studies in the Philosophy of Science, volume 2, pages 33-76. University of Minnesota Press, 1956.
19. E. Dijkstra. Notes on structured programming. In Structured Programming, pages 1-82. Academic Press, 1972.
20. Y. Gurevich. Evolving algebras. A tutorial introduction. Bulletin of EATCS, 43:264-284, 1991.
21. Y. Gurevich. Evolving Algebras 1993: Lipari Guide. In E. Börger, editor, Specification and Validation Methods, pages 9-36. Oxford University Press, 1995.
22. A. M. Haeberer and T. S. E. Maibaum. Scientific rigour, an answer to a pragmatic question: a linguistic framework for software engineering. Number 23 in International Conference on Software Engineering, Toronto, 2001.
23. A. M. Haeberer, T. S. E. Maibaum, and M. V. Cengarle. Knowing what requirements specifications specify. Typescript, 2001.
24. A. Hall. Seven myths of formal methods. IEEE Software, pages 11-19, September 1990.
25. D. Harel and R. Marelly. Capturing and executing behavioral requirements: the play-in/play-out approach. Technical Report MCS01-15, Weizmann Institute of Science, Israel, 2001.
26. C. Heitmeyer. Using SCR methods to capture, document, and verify computer system requirements. In E. Börger, B. Hörger, D. L. Parnas, and D. Rombach, editors, Requirements Capture, Documentation, and Validation. Dagstuhl Seminar No. 99241, Schloss Dagstuhl, Int. Conf. and Research Center for Computer Science, 1999.
27. N. G. Leveson. Completeness in formal specification language design for process-control systems. In Formal Methods in Software Practice, pages 75-87. ACM Press, 2000.
28. K. Popper. Logik der Forschung. Zur Erkenntnishtoeire der modernen Naturwissenschaft. Wien, 1935.
29. H. Rust. A non-standard approach to operational semantics for timed systems. Habilitation thesis, BTU Cottbus, Germany, 2003.
30. R. Stärk, J. Schmid, and E. Börger. Java and the Java Virtual Machine: Definition, Verification, Validation. Springer-Verlag, 2001.
31. J. M. Wing. A specifier's introduction to formal methods. Computer, pages 8-24, Sept. 1990.
32. N. Wirth. Program development by stepwise refinement. Comm. ACM, 1971.