Jonathan Jacky · Cambridge University Press eBooks · 1996
Formal methods apply logic and simple mathematics to programming. They work best where traditional programming methods don't work very well: problems that are too difficult to solve by intuition or too novel to solve by modifying some existing program or design. They can help you create new programs, or analyze and document programs that are already written. Using formal methods requires creativity and judgment, but once you have created or analyzed a program formally, you can document your work as a sequence of steps that you or anyone else can check. You must be able to do this if you need to convince yourself or others that a program meets requirements for safety, accuracy, security, or any other critical property. It is also worth doing if you simply want to understand how the program works.
Cited by 1
Evert W. Beth · 1970
Cited by 1
OAPEN (The OAPEN Foundation) · 2024
Cited by 0Open access
Directory of Open access Books (OAPEN Foundation) · 2024
Cited by 0Open access
Jim Woodcock, Peter Gorm Larsen, Juan Bicarregui et al. · ACM Computing Surveys · 2009
Formal methods use mathematical models for analysis and verification at any part of the program life-cycle. We describe the state of the art in the industrial use of formal methods, concentrating on their increasing use at the earlier stages of specification and design. We do this by reporting on a new survey of industrial use, comparing the situation in 2009 with the most significant surveys carried out over the last 20 years. We describe some of the highlights of our survey by presenting a series of industrial projects, and we draw some observations from these surveys and records of experience. Based on this, we discuss the issues surrounding the industrial adoption of formal methods. Finally, we look to the future and describe the development of a Verified Software Repository, part of the worldwide Verified Software Initiative. We introduce the initial projects being used to populate the repository, and describe the challenges they address.
Cited by 648Open access
Jan Baumeister, Bernd Finkbeiner, Florian Kohn et al. · Lecture notes in computer science · 2024
Cited by 2Open access
Princeton University Press eBooks · 2019
Cited by 0
International Symposium on Formal Methods 2024 Mailand, Platzer, André, Rozier, Kristin Yvonne et al. · Lecture notes in computer science · 2024
Cited by 2Open access
Ramaguru Radhakrishnan · OSF Preprints (OSF Preprints) · 2024
Cited by 0
Pettigrew, Richard · PhilPapers (PhilPapers Foundation)
(This is for the Cambridge Handbook of Analytic Philosophy, edited by Marcus Rossberg) In this handbook entry, I survey the different ways in which formal mathematical methods have been applied to philosophical questions throughout the history of analytic philosophy. I consider: formalization in symbolic logic, with examples such as Aquinas’ third way and Anselm’s ontological argument; Bayesian confirmation theory, with examples such as the fine-tuning argument for God and the paradox of the ravens; foundations of mathematics, with examples such as Hilbert’s programme and Gödel’s incompleteness theorems; social choice theory, with examples such as Condorcet’s paradox and Arrow’s theorem; ‘how possibly’ results, with examples such as Condorcet’s jury theorem and recent work on intersectionality theory; and the application of advanced mathematics in philosophy, with examples such as accuracy-first epistemology.
Cited by 0
Raymond J. Turner · 2018
Cited by 0
Ben Di Vito · 2014
Cited by 0
Flemming Nielson, Hanne Riis Nielson · 2019
Cited by 17
Ben Di Vito · 2014
Formal methods provide powerful tools and techniques for modeling and analyzing software designs and implementations. They make use of mathematics and formal logic to achieve high levels of assurance that software components have important behavioral properties or will not raise runtime errors. Since the publication of the first edition of the Digital Avionics Handbook, the field of formal methods has experienced substantial growth. This growth has occurred in core technical capabilities, in the maturity and variety of software tools, and in adoption by engineers across several industries. While the technology of formal methods has advanced steadily, more recent developments of note concern avionics certification guidance. Opportunities to use the results of formal analysis in certification are on the rise. Historically, deductive techniques were the original formal methods, dating back to the late 1960s. The other types of formal methods were introduced later in response to theoretical advances that made them possible.
Cited by 0
Marsha Chećhik, Joost-Pieter Katoen, Martin Leucker · Lecture notes in computer science · 2023
Cited by 0Open access
Pettigrew, Richard · PhilPapers (PhilPapers Foundation)
(This is for the Cambridge Handbook of Analytic Philosophy, edited by Marcus Rossberg) In this handbook entry, I survey the different ways in which formal mathematical methods have been applied to philosophical questions throughout the history of analytic philosophy. I consider: formalization in symbolic logic, with examples such as Aquinas’ third way and Anselm’s ontological argument; Bayesian confirmation theory, with examples such as the fine-tuning argument for God and the paradox of the ravens; foundations of mathematics, with examples such as Hilbert’s programme and Gödel’s incompleteness theorems; social choice theory, with examples such as Condorcet’s paradox and Arrow’s theorem; ‘how possibly’ results, with examples such as Condorcet’s jury theorem and recent work on intersectionality theory; and the application of advanced mathematics in philosophy, with examples such as accuracy-first epistemology.
Cited by 0
Edmund M. Clarke, Jeannette M. Wing · ACM Computing Surveys · 1996
this report assesses the state of the art in specification and verification. For verification, we highlight advances in model checking and theorem proving. In the three sections on specification, model checking, and theorem proving, we explain what we mean by the general technique and briefly describe some successful case studies and well-known tools. The second part of this report outlines future directions in fundamental concepts, new methods and tools, integration of methods, and education and technology transfer. We close with summary remarks and pointers to resources for more information
Cited by 728Open access
2004
Cited by 0
João Miguel, Alves Pestana, Néstor Cataño · 2016
Cited by 0
Richard G Pettigrew · Explore Bristol Research · 2021
In this handbook entry, I survey the different ways in which formal mathematical methods have been applied to philosophical questions throughout the history of analytic philosophy. I consider: formalization in symbolic logic, with examples such as Aquinas’ third way and Anselm’s ontological argument; Bayesian confirmation theory, with examples such as the fine-tuning argument for God and the paradox of the ravens; foundations of mathematics, with examples such as Hilbert’s programme and Gödel’s incompleteness theorems; social choice theory, with examples such as Condorcet’s paradox and Arrow’s theorem; ‘how possibly’ results, with examples such as Condorcet’s jury theorem and recent work on intersectionality theory; and the application of advanced mathematics in philosophy, with examples such as accuracy-first epistemology.
Cited by 0