< Features

(→Detailed Description) |
(→Detailed Description: Add link to new page) |
||

(39 intermediate revisions by 2 users not shown) | |||

Line 3: | Line 3: | ||

= Feature Name = | = Feature Name = | ||

− | + | Formal methods | |

+ | |||

+ | <!-- If too short, could say "Basic support for key provers, solvers, and formal methods tools" --> | ||

== Summary == | == Summary == | ||

− | + | "Formal methods" are techniques that use mathematics to prove that models of software, hardware, or systems will or will not have certain behaviors. To be practical, they must be automated using tools. | |

− | + | ||

− | systems using mathematics. In some cases they can be used to | + | Fedora has now added basic support for some key formal methods tools, |

− | greatly increase the reliability of software and hardware. | + | letting you prove that some facts are true (given other facts) and/or model systems using mathematics. In some limited cases they can be used to greatly increase the reliability of software and hardware. |

+ | |||

+ | This suite has been primarily packaged by the members of the [[FormalMethods|Fedora Formal Methods SIG]]. | ||

== Owner == | == Owner == | ||

− | * Name: [[User:dwheeler|David A. Wheeler]] | + | * Name: [[User:dwheeler|David A. Wheeler]] (proposer) |

== Current status == | == Current status == | ||

− | * Targeted release: [[Releases/ | + | * Targeted release: [[Releases/13 | Fedora13 ]] |

− | * Last updated: | + | * Last updated: 2010-01-14 |

− | * Percentage of completion: | + | * Percentage of completion: 100% |

<!-- CHANGE THE "FedoraVersion" TEMPLATES ABOVE TO PLAIN NUMBERS WHEN YOU COMPLETE YOUR PAGE. --> | <!-- CHANGE THE "FedoraVersion" TEMPLATES ABOVE TO PLAIN NUMBERS WHEN YOU COMPLETE YOUR PAGE. --> | ||

== Detailed Description == | == Detailed Description == | ||

− | No realistic software or hardware can be exhaustively tested; | + | No realistic software or hardware can be exhaustively tested; exhaustively testing |

− | a program that adds | + | a program that merely adds three 64-bit numbers would take more time than the Earth has existed. |

− | |||

So for decades people have worked to develop tools that can apply | So for decades people have worked to develop tools that can apply | ||

mathematical techniques to prove that software and hardware (or a model of them) does or does not do something. | mathematical techniques to prove that software and hardware (or a model of them) does or does not do something. | ||

− | These tools can also be used whenever it's important to prove something is true | + | These tools can also be used whenever it's important to prove something is true, |

or to solve for values given a large number of constraints. | or to solve for values given a large number of constraints. | ||

Although these tools are still maturing, they are beginning to become useful in some limited circumstances. | Although these tools are still maturing, they are beginning to become useful in some limited circumstances. | ||

Now some key ones are packaged so developers on Fedora can begin to experiment with them. | Now some key ones are packaged so developers on Fedora can begin to experiment with them. | ||

+ | |||

+ | The [[Formal methods tool suite]] page provides a longer description of the various kinds of tools, and the packages that implement them. | ||

Here are some of these kinds of tools, along with packages of programs | Here are some of these kinds of tools, along with packages of programs | ||

that perform them: | that perform them: | ||

− | * Automated Theorem Provers: These take mathematical facts and attempt to prove a goal, completely automatically. Packages: ''prover9'' | + | * Automated Theorem Provers: These take mathematical facts and attempt to prove a goal, completely automatically. Packages: ''prover9'', ''Zenon''. |

− | * Interactive Theorem Provers: These | + | * Interactive Theorem Provers: These help humans take mathematical facts and attempt to prove a goal, in cases where the automated tools can't manage. Package: ''Coq'', ''PVS'' (as pvs-sbcl) |

− | * Program Provers: These take software | + | * Program Provers: These take software code and work to prove claims about them, typically by breaking the code and claims into a large number of verification conditions (VCs) for the above to prove. Package: ''Why'' (for annotated C and Java) |

− | |||

* Formal specification languages: These let people describe software or systems using a mathematically rigorous language, such as Z. Package: ''tex-zfuzz'' | * Formal specification languages: These let people describe software or systems using a mathematically rigorous language, such as Z. Package: ''tex-zfuzz'' | ||

+ | * Boolean Satisfiability (SAT) solvers: These take boolean equations and solve for them; they are a basic building block for some implementations of the above. Packages: sat4j, minisat2 | ||

Do ''not'' assume that you can just take a program prover on a big existing program and start | Do ''not'' assume that you can just take a program prover on a big existing program and start | ||

Line 50: | Line 55: | ||

SAT solvers ''have'' been used in a variety of places. | SAT solvers ''have'' been used in a variety of places. | ||

− | [http://en.opensuse.org/Libzypp/Sat_Solver | + | [http://en.opensuse.org/Libzypp/Sat_Solver Another distribution is using a SAT solver to speed up RPM dependency analysis]. |

For more information, and a list of FLOSS tools, see | For more information, and a list of FLOSS tools, see | ||

Line 60: | Line 65: | ||

== Scope == | == Scope == | ||

Developers have had to package a number of programs, most of which have not been packaged before. | Developers have had to package a number of programs, most of which have not been packaged before. | ||

− | In some cases, we've had to address integration problems | + | In some cases, we've had to address integration problems. |

− | + | ||

− | + | This feature has no effect on those who don't wish to use these tools. | |

== Test Plan == | == Test Plan == | ||

Line 98: | Line 103: | ||

== Documentation == | == Documentation == | ||

− | + | Where permitted by license, packages include documentation. | |

− | + | In a few cases (e.g., minisat2), no documentation was provided at all, | |

− | + | and we have added some basic documentation to help people get started. | |

− | + | We expect this to improve in future releases; it will also be easier to get | |

− | We expect this to improve in future releases. | + | people to write documentation once the programs themselves are easier to install. |

<!-- Is there upstream documentation on this feature, or notes you have written yourself? Link to that material here so other interested developers can get involved. --> | <!-- Is there upstream documentation on this feature, or notes you have written yourself? Link to that material here so other interested developers can get involved. --> | ||

− | |||

== Release Notes == | == Release Notes == | ||

Line 113: | Line 117: | ||

---- | ---- | ||

+ | |||

[[Category:FeaturePageIncomplete]] | [[Category:FeaturePageIncomplete]] |

## Latest revision as of 15:41, 20 January 2010

## Contents

# Feature Name

Formal methods

## Summary

"Formal methods" are techniques that use mathematics to prove that models of software, hardware, or systems will or will not have certain behaviors. To be practical, they must be automated using tools.

Fedora has now added basic support for some key formal methods tools, letting you prove that some facts are true (given other facts) and/or model systems using mathematics. In some limited cases they can be used to greatly increase the reliability of software and hardware.

This suite has been primarily packaged by the members of the Fedora Formal Methods SIG.

## Owner

- Name: David A. Wheeler (proposer)

## Current status

- Targeted release: Fedora13
- Last updated: 2010-01-14
- Percentage of completion: 100%

## Detailed Description

No realistic software or hardware can be exhaustively tested; exhaustively testing a program that merely adds three 64-bit numbers would take more time than the Earth has existed. So for decades people have worked to develop tools that can apply mathematical techniques to prove that software and hardware (or a model of them) does or does not do something. These tools can also be used whenever it's important to prove something is true, or to solve for values given a large number of constraints.

Although these tools are still maturing, they are beginning to become useful in some limited circumstances. Now some key ones are packaged so developers on Fedora can begin to experiment with them.

The Formal methods tool suite page provides a longer description of the various kinds of tools, and the packages that implement them.

Here are some of these kinds of tools, along with packages of programs that perform them:

- Automated Theorem Provers: These take mathematical facts and attempt to prove a goal, completely automatically. Packages:
*prover9*,*Zenon*. - Interactive Theorem Provers: These help humans take mathematical facts and attempt to prove a goal, in cases where the automated tools can't manage. Package:
*Coq*,*PVS*(as pvs-sbcl) - Program Provers: These take software code and work to prove claims about them, typically by breaking the code and claims into a large number of verification conditions (VCs) for the above to prove. Package:
*Why*(for annotated C and Java) - Formal specification languages: These let people describe software or systems using a mathematically rigorous language, such as Z. Package:
*tex-zfuzz* - Boolean Satisfiability (SAT) solvers: These take boolean equations and solve for them; they are a basic building block for some implementations of the above. Packages: sat4j, minisat2

Do *not* assume that you can just take a program prover on a big existing program and start
using it effectively; program prover tools are just *starting* to become mature.
All such tools have limitations, scale can be a problem, and it's typically more effective
to develop the proofs simultaneously with the program.
Nevertheless, for those who are interested in the technology, have small-scale problems
where they can be applied, or who wish to help it mature,
these are a great place to start.

SAT solvers *have* been used in a variety of places.
Another distribution is using a SAT solver to speed up RPM dependency analysis.

For more information, and a list of FLOSS tools, see Assurance (for Security or Safety) and Free-Libre / Open Source Software (FLOSS)... with Lots on Formal Methods / Software Verification.

## Benefit to Fedora

This enables developers to start using these kinds of programs in a variety of circumstances.

## Scope

Developers have had to package a number of programs, most of which have not been packaged before. In some cases, we've had to address integration problems.

This feature has no effect on those who don't wish to use these tools.

## Test Plan

No special hardware or system preparation is required; simply install the packages listed above. Many of the toolsuites include some checking. In addition, the "Why" suite can use many other tools; we have used its "binary-search.c" example with gwhy to test integration with Zenon and Coq.

## User Experience

Target users will notice that they can easily install these tools.

## Dependencies

There are no special dependencies.

## Contingency Plan

None necessary, revert any undesirable packages.

## Documentation

Where permitted by license, packages include documentation. In a few cases (e.g., minisat2), no documentation was provided at all, and we have added some basic documentation to help people get started. We expect this to improve in future releases; it will also be easier to get people to write documentation once the programs themselves are easier to install.

## Release Notes

No special release notes.