Designing executable abstractions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Designing executable abstractions

Full text

Pdf (772 KB)

Source

Formal Methods in Software Practice archive
Proceedings of the second workshop on Formal methods in software practice table of contents

Clearwater Beach, Florida, United States

Pages: 103 - 108

Year of Publication: 1998

ISBN:0-89791-954-8

Author

Gerard J. Holzmann

Bell Laboratories, 600 Mountain Avenue 2C-521, Murray Hill, NJ

Sponsor

SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 12, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/298595.298864 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	Gerard J. Holzmann, An Analysis of Bitstate Hashing, Formal Methods in System Design, v.13 n.3, p.289-307, Nov. 1998 [doi>10.1023/A:1008696026254]
	2	Lakatos, I. Proofs and Refutations: the logic of mathematical discovery. Cambridge University Press, 1976.
	3	Russell, B. The Principles of Mathematics. Cambridge University Press. 1903 Vol. 1, par. 78 and Ch. X, 1903.
	4	The source to the model checker Spin is available from URL: http://netlib, bel!-I abs.com/neflib/s_rfinL
	5	Strachey, C. An impossible program. Computer Journal, 7, 4 (January 1965), p. 313.
	6	Turing, A.M. On computable numbers, with an application to the Entseheidungsproblcm. Proc. London Mathematical Soc., Ser. 2-42, (1936), 230-265, see p. 247.
	7	Villiers, P.J.A. Validation of a micro-kernel: a case study. Ph.D. Thesis, University of Stellenbosch, S. Africa, (Draft of December 1997).
	8	Wilner, D. Vx-Files: What really happened on Mars. (keynote address.) Proc. IEEE Real-Time Systems Symposium, Dec. 2-5, 1997, San Francisco, CA.
	9	Pierre Wolper, Expressing interesting properties of programs in propositional temporal logic, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.184-193, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512661]

CITED BY 4

	James C. Corbett, Using shape analysis to reduce finite-state models of concurrent Java programs, ACM Transactions on Software Engineering and Methodology (TOSEM), v.9 n.1, p.51-93, Jan. 2000
	Yung-Pin Cheng , Michal Young , Che-Ling Huang , Chia-Yi Pan, Towards scalable compositional analysis by refactoring design models, ACM SIGSOFT Software Engineering Notes, v.28 n.5, September 2003
	Harald Rueß , Leonardo de Moura, Simulation and verification I: from simulation to verification (and back), Proceedings of the 35th conference on Winter simulation: driving innovation, December 07-10, 2003, New Orleans, Louisiana
	Marsha Chechik , John Gannon, Automatic Analysis of Consistency between Requirements and Designs, IEEE Transactions on Software Engineering, v.27 n.7, p.651-672, July 2001