Article · Wikipedia archive · Last revised May 30, 2026

Retrenchment (computing)

Retrenchment is a technique associated with formal methods that was introduced to address some of the perceived limitations of formal, model based refinement, for situations in which refinement might be regarded as desirable in principle, but turned out to be unusable, or nearly unusable, in practice. It was primarily developed at the School of Computer Science, University of Manchester. The most up to date perspective is in the ACM TOSEM article below.

Last revised
May 30, 2026
Read time
≈ 1 min
Length
93 w
Citations
Source

Retrenchment is a technique associated with formal methods that was introduced to address some of the perceived limitations of formal, model based refinement, for situations in which refinement might be regarded as desirable in principle, but turned out to be unusable, or nearly unusable, in practice. It was primarily developed at the School of Computer Science, University of Manchester. The most up to date perspective is in the ACM TOSEM article below.

External links
  • The Retrenchment Homepage
  • R. Banach, Graded Refinement, Retrenchment and Simulation, ACM Trans. Soft. Eng. Meth., 32, 1-69 (2023)