Category:Formal methods
Here is a list of articles in the Formal methods category of the Computing portal that unifies foundations of mathematics and computations using computers.
 | Pages in this category should be moved to subcategories where applicable. This category may require frequent maintenance to avoid becoming too large. It should directly contain very few, if any, pages and should mainly contain subcategories. |
Formal methods are mathematical approaches to software and hardware computer-based system development from requirements, specification and design through to programming and implementation. They form an important theoretical underpinning for software engineering, especially where safety or security is involved. Formal methods are a useful adjunct to software testing since they help avoid errors and can also give a framework for testing. For industrial use, tool support is required.
Subcategories
This category has the following 6 subcategories, out of 6 total.
Pages in category "Formal methods"
The following 107 pages are in this category, out of 107 total.
A
- Abstract machine notation
- Abstract state machine
- Abstract state machines
- ABZ Conference
- Algebraic semantics (computer science)
- Algebraic specification
- Algorithm characterizations
- And-inverter graph
- Applicative universal grammar
- Software:Assertion (software development)
- Asynchronous system
- Atelier B
- Automated theorem proving
B
C
D
L
P
R
S
- Safety-critical system
- SAT solver
- Satisfiability modulo theories
- Semantic spacetime
- Semantics (computer science)
- Set theory
- SIGNAL (programming language)
- SLAM project
- State space enumeration
- Static timing analysis
- Statistical static timing analysis
- Strict function
- Stuttering equivalence
- Symbolic simulation
- Syntactic methods
