State abstraction and modular software development

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

State abstraction and modular software development

Full text

Pdf (884 KB)

Source

Foundations of Software Engineering archive
Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering table of contents

Washington, D.C., United States

Pages: 53 - 61

Year of Publication: 1995

ISBN:0-89791-716-2

Also published in ...

Authors

Daniel Hoffman	University of Victoria, Department of Computer Science, P.O. Box 3055, Victoria, B. C., V8W 3P6 Canada
Paul Strooper	University of Queensland, Department of Computer Science, St. Lucia, Qld. 4072, Australia

Sponsor

SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 22, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/222124.222139 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M. Aigner. Combinatorial Theory. Springer- Verlag, 1979.
	2	Edsger Wybe Dijkstra, A Discipline of Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1997
	3	H. Ehrig , Bernd Mahr, Fundamentals of algebraic specification 2: module specifications and constraints, Springer-Verlag New York, Inc., New York, NY, 1990
	4	J. D. Gannon , R. G. Hamlet , H. D. Mills, Theory of modules, IEEE Transactions on Software Engineering, v.13 n.7, p.820-829, July 1987 [doi>10.1109/TSE.1987.233493]
	5	V. Giarratana, F. Gimona, and U. Montanari. Observability concepts in abstract data type specifications. In A. Mazurkiewicz, editor, Mathematical Foundations of Computer Science 1976, Lecture Notes in Computer Science 45. Springer- Verlag, 1976.
	6	Stephen J. Goldsack, ADA for Specification: Possibilities and Limitations, Cambridge University Press, New York, NY, 1985
	7	I. Hayes. Bias in VDM: Full abstraction and the functional retrieve rules for data refinement. Technical Report No. 162, The University of Queensland, 1990.
	8	C. A. R. Hoare, An axiomatic basis for computer programming, Communications of the ACM, v.12 n.10, p.576-580, Oct. 1969 [doi>10.1145/363235.363259]
	9	C.A.R. Hoare. Proof of correctness of data representations. Acts Informatica, 1(4):271-281, 1972.
	10	D.M. Hoffman. A CASE study in module testing. In Proc. Conf. Software Maintenance, pages 100-105. IEEE Computer Society, October 1989.
	11	D.M. Hoffman and G. Jones. Module state machines (submitted). ACM Trans. Soft. Eng. and Meth., May 1992.
	12	D. Hoffman , Richard Thomas Snodgrass, Trace Specifications: Methodology and Models, IEEE Transactions on Software Engineering, v.14 n.9, p.1243-1252, September 1988 [doi>10.1109/32.6168]
	13	Daniel M. Hoffman , Paul Strooper, Automated Module Testing in Prolog, IEEE Transactions on Software Engineering, v.17 n.9, p.934-943, September 1991 [doi>10.1109/32.92913]
	14	D.M. Hoffman and P.A. Strooper. Graphbased class testing. The Australian Computer Journal, 26(4):158-163, 1994.
	15	D.M. Hoffman and P.A. Strooper. The testgraphs methodology-automated testing of collection classes. Journal of Object-Oriented Programming (accepted), 1995.
	16	John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	17	Cliff B. Jones, Systematic software development using VDM (2nd ed.), Prentice-Hall, Inc., Upper Saddle River, NJ, 1990
	18	Richard C. Linger , Bernard I. Witt , H. D. Mills, Structured Programming; Theory and Practice the Systems Programming Series, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1979
	19	W. Morris, editor. The American Heritage Dictionary of the English Language. American Heritage Pub. Co., 1973.
	20	R.J. Nelson. Introduction to Automata. John Wiley and Sons, Inc., 1968.
	21	Tobias Nipkow, Non-deterministic data types: models and implementations, Acta Informatica, v.22 n.6, p.629-661, March 1986 [doi>10.1007/BF00263649]
	22	D L Parnas , P C Clements, A rational design process: How and why to fake it, IEEE Transactions on Software Engineering, v.12 n.2, p.251-257, Feb. 1986
	23	J. M. Spivey, The Z notation: a reference manual, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
	24	M. Wand. Final algebra semantics and data type extensions. Journal of Computer and System Sciences, 19:27-44, 1979.
	25	Niklaus Wirth, Program development by stepwise refinement, Communications of the ACM, v.14 n.4, p.221-227, April 1971 [doi>10.1145/362575.362577]

CITED BY 2

	Karl Lermer , Paul Strooper, Refinement and state machine abstraction, Theoretical Computer Science, v.266 n.1-2, p.195-235, 09/06/2001
	Robert J. Walker , Kevin Viggers, Implementing protocols via declarative event patterns, ACM SIGSOFT Software Engineering Notes, v.29 n.6, November 2004