eliminIM

Eliminim is a programming technique and a model checking approach for analyzing the correctness of programs with respect to properties of interest. It was introduced by model checkers such as FORS/AB, in comparison to earlier techniques.

The technique was devised by Didier Galmiche and Jean-Loup Krivine, building on the concept of modal logics. The goal of eliminim is to narrow the space of possible inputs through a series of broad maneuvers, resulting in a model that exhaustively explores all reachable states. This is achieved by eliminating different sets of possible inputs and interleavings gradually until the remaining subspace exactly corresponds to the model's satisfying equivalences.

The term "eliminim" is derived from the word "eliminationism," which refers to the process of eliminating hypotheses, deductions, or, in this case, possible models as counterexamples are found. This iterative approach has proven useful in finding valid inputs efficiently in high-complexity computations within the context of distributed algorithms.

Model-checking techniques have since built upon eliminim to tackle a range of formal properties in distributed systems and hardware. In distributed algorithms, it has demonstrated its worth by reducing the computational overhead in establishing consistency. The inference process in various distributed systems in computer science has also adopted eliminim.