Category:Formal methods
 | 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. |
Wikimedia Commons has media related to Formal methods.
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 18 subcategories, out of 18 total.
A
L
M
O
- Formal methods organizations (11 P)
P
- Program derivation (2 P)
- Program logic (4 P)
S
T
- Turing machine (29 P)
Z
- Z notation (19 P)
Σ
- Formal methods stubs (30 P)
Pages in category "Formal methods"
The following 102 pages are in this category, out of 102 total. This list may not reflect recent changes.
A
B
C
D
I
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