A language for building verified software components

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Safe and secure reuse is only achievable by deploying formally verified software components. This paper presents essential design objectives for languages for building such components and highlights key features in RESOLVE - a prototype for such languages. It explains why the language must include specifications as an integral constituent and must have clean and rich semantics, which preclude unconstrained aliasing and other unwanted side-effects. In order that arbitrarily complex components can be given concise and verification amenable specifications, an adequate language must also include an open-ended mechanism for incorporating additional mathematical theories. Given these essential characteristics, safe and secure reuse cannot be attained within popular languages, such as C++ or Java, either by constraining them or by extending them. Better languages are necessary. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kulczycki, G., Sitaraman, M., Krone, J., Hollingsworth, J. E., Ogden, W. F., Weide, B. W., … Zaccai, D. (2013). A language for building verified software components. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7925 LNCS, pp. 308–314). https://doi.org/10.1007/978-3-642-38977-1_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free