Abstract
Expressions in the programming language C have such an under-specied semantics that one might expect them to be non-deterministic. However, with the help of a mechanised formalisation, we have shown that the semantics’ additional constraints actually result in a large class of C expressions having only one possible behaviour.
Chapter PDF
References
M. J. C. Gordon and T. Melham. Introduction to HOL: a theorem proving environment. Cambridge University Press, 1993.
Matthew Hennessy. The semantics of programming languages. John Wiley and Sons, 1990.
Programming languages-C, 1990. ISO/IEC 9899:1990.
ISO committee JTC1/SC22/WG14. Record of responses. Available from ftp://ftp.dmk.com/DMK/sc22wg14/rr/.
Michael Norrish. Derivation of vericiation rules for C from operational denitions. In J. von Wright, J. Grundy, and J. Harrison, editors, Supplementary proceedings of TPHOLs ’96, number 1 in TUCS General Publications, pages 69–75. Turku Centre for Computer Science, August 1996.
Michael Norrish. An abstract dynamic semantics for C. Technical Report 421, Computer Laboratory, University of Cambridge, May 1997.
Michael Norrish. C formalised in HOL. PhD thesis, Computer Laboratory, University of Cambridge, 1998. Submitted August, 1998.
D. M. Ritchie. The development of the C language. ACM SIGPLAN Notices, 28(3):201–208, March 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Norrish, M. (1999). Deterministic Expressions in C. In: Swierstra, S.D. (eds) Programming Languages and Systems. ESOP 1999. Lecture Notes in Computer Science, vol 1576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49099-X_10
Download citation
DOI: https://doi.org/10.1007/3-540-49099-X_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65699-9
Online ISBN: 978-3-540-49099-9
eBook Packages: Springer Book Archive