Live briefing
Everything about Formal methods
Mathematical program specifications
In computer science, formal methods are mathematically rigorous techniques for the specification, development, analysis, and verification of software and hardware systems. The use of formal methods for software and hardware design is motivated by the expectation that, as in other engineering disciplines, performing appropriate mathematical analysis can contribute to the reliability and robustness of a design. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Formal methodsA 5-minute orientation
- Skim a recent paper: Formal Methods in Railways: A Systematic Mapping StudyInfluential work since 2022
- Pick up a classic book: How to survive in your native landThe most-reprinted book on the subject
- Read the landmark paper: Formal methodsCited 784 times
- Go sideways: Formal verificationA closely related topic
- Go sideways: Model checkingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Formal methods
Formal methods
Seven myths of formal methods
Ten commandments of formal methods
An Invitation to Formal Methods
Really Rethinking 'Formal Methods'
Formal Methods in Industry
Software engineering and formal methods
🆕 Influential since 2022
📚 Books worth reading
How to survive in your native landJames Herndon · 1971
Alternative approaches to educationFiona Carnie · 2002
Software Specification MethodsHenri Habrias · 2000
Modeling in event-bJean-Raymond Abrial · 2006
The sociology of health, illness, and health careRose Weitz · 1996
The Way of ZJonathan Jacky · 1996- 📕Principles of Cyber-Physical SystemsRajeev Alur · 2015
Formal methodsPaul Boca, J. P. Bowen · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Formal verification In the context of hardware and software systems, formal verification is the act of proving or disproving the correctness of a system with respect to a…
- Model checking In computer science, model checking or property checking is a method for checking whether a finite-state model of a system meets a given specification…
- Satisfiability modulo theories In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable…
- Automated theorem proving Automated theorem proving (ATP), also known as automated deduction, is a subfield of automated reasoning and mathematical logic dealing with proving mathematica…
- Correctness (computer science) In theoretical computer science, an algorithm is correct with respect to a specification if it behaves as specified. Best explored is functional correctness…
- Automated reasoning In computer science, in particular in knowledge representation and reasoning and metalogic, the area of automated reasoning is dedicated to understanding…
- Compiler correctness In computing, compiler correctness is the branch of computer science that deals with trying to show that a compiler behaves according to its language specificat…
- Extended static checking Extended static checking (ESC) is a collective name in computer science for a range of techniques for statically checking the correctness of various program…