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
P
- Program derivation (2 P)
- Program logic (5 P)
S
T
- Turing machine (31 P)
Z
- Z notation (20 P)
Σ
- Formal methods stubs (29 P)
Pages in category “Formal methods”
The following 106 pages are in this category, out of 106 total. This list may not reflect recent changes.
0–9
A
- Abstract machine notation
- Abstract state machine
- ABZ Conference
- Agent verification
- Algebraic semantics (computer science)
- Algebraic specification
- Algorithm characterizations
- And-inverter graph
- Applicative universal grammar
- Assertion (software development)
- Asynchronous system
- Automated theorem proving
B
C
D
I
L
P
R
S
- Safety-critical system
- SAT solver
- Satisfiability modulo theories
- Semantic spacetime
- Semantics (programming languages)
- 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