40 Years of Formal Methods

Bjørner, Dines; Havelund, Klaus

doi:10.1007/978-3-319-06410-9_4

Cited by 38 publications

(20 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The course IN3050: Applied logic in Engineering (ALE) was introduced at TU Munich, Germany, in Winter Semester 2012/2013 as a face-to-face course on Bachelor and Master levels. 2 The course was designed as an elective without any enforced prerequisites. It contributed 6 credit points to the student curriculum, which corresponds to 4 teacher-directed hours.…”

Section: Course: Applied Logic In Engineeringmentioning

confidence: 99%

See 1 more Smart Citation

“Boring Formal Methods” or “Sherlock Holmes Deduction Methods”?

Spichkova

2016

Software Technologies: Applications and Foundations

View full text Add to dashboard Cite

Abstract. This paper provides an overview of common challenges in teaching of logic and formal methods to Computer Science and IT students. We discuss our experiences from the course IN3050: Applied Logic in Engineering, introduced as a "logic for everybody" elective course at at TU Munich, Germany, to engage pupils studying Computer Science, IT and engineering subjects on Bachelor and Master levels. Our goal was to overcome the bias that logic and formal methods are not only very complicated but also very boring to study and to apply. In this paper, we present the core structure of the course, provide examples of exercises and evaluate the course based on the students' surveys.

show abstract

Section: Course: Applied Logic In Engineeringmentioning

confidence: 99%

“…As curricula becomes more practice-oriented, the mathematical background of the students becomes weaker which provides an additional obstacle in understanding of logic and FMs, cf. [2,5,34]. Also, many students have negative perceptions and even fear of courses that require dealing with complex mathematical notations.…”

Section: Introductionmentioning

confidence: 99%

“Boring Formal Methods” or “Sherlock Holmes Deduction Methods”?

Spichkova

2016

Software Technologies: Applications and Foundations

View full text Add to dashboard Cite

show abstract

“…Methodologies for developing proofs of program correctness are as old as the proofs themselves (Turing, 1949;Floyd, 1967;Hoare, 1971). These proofs were on paper and of simple programs; tools to support their development followed soon after (Milner, 1972) and have continued to evolve for over 40 years (Bjørner and Havelund, 2014). Projects based on construction of formal, machine-checked proofs using these tools are now reaching a scale comparable to that of large software engineering projects.…”

Section: Introductionmentioning

confidence: 99%

QED at Large: A Survey of Engineering of Formally Verified Software

Ringer

Palmskog

Sergey

et al. 2019

FNT in Programming Languages

View full text Add to dashboard Cite

Development of formal proofs of correctness of programs can increase actual and perceived reliability and facilitate better understanding of program specifications and their underlying assumptions. Tools supporting such development have been available for over 40 years, but have only recently seen wide practical use. Projects based on construction of machine-checked formal proofs are now reaching an unprecedented scale, comparable to large software projects, which leads to new challenges in proof development and maintenance. Despite its increasing importance, the field of proof engineering is seldom considered in its own right; related theories, techniques, and tools span many fields and venues. This survey of the literature presents a holistic understanding of proof engineering for program correctness, covering impact in practice, foundations, proof automation, proof organization, and practical proof development.

show abstract

“…Difficulty, high development cost, and a general lack of tool support are often cited reasons-among others-as to why high integrity software has never fully taken root in the industry or the curriculum at large [1]. The overriding belief Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.…”

Section: Introductionmentioning

confidence: 99%

Scaling Up Automated Verification

Welch

2017

Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education

View full text Add to dashboard Cite

This work aims to show through a detailed case study that scaling up automated verification to larger non-trivial data structures is not only possible, but when combined with appropriate tool support, can be made more comprehensible and practicable to users in a variety of settings, including the undergraduate curriculum. The study involves an interplay of multiple components annotated with formal interface contracts and the components are all designed to be modular, reusable, and amenable to automated verification and analysis. The components are built using a formal integrated development environment (F-IDE). The plan is to evaluate the F-IDE in an upper-level undergraduate software engineering course in the Spring semester at Clemson University.

show abstract

40 Years of Formal Methods

Cited by 38 publications

References 45 publications

“Boring Formal Methods” or “Sherlock Holmes Deduction Methods”?

“Boring Formal Methods” or “Sherlock Holmes Deduction Methods”?

QED at Large: A Survey of Engineering of Formally Verified Software

Scaling Up Automated Verification

Contact Info

Product

Resources

About