
The Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated as SATISFIABILITY or SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE. If this is the case, the formula is called satisfiable. SAT techniques can be used to prove or disprove properties: if the negation of a property cannot be satisfied, then the property is valid. If the negation of a property is satisfied by a certain interpretation, then this interpretation is a counterexample of the property.
Share this article

Learn to build a solid safety case for rail control systems using formal verification
Fill out your information here.
More News & Articles
At ISoLA 2026 in Kos, Greece, Prover presented three papers on railway signaling: two from the ForTeS project on formal verification and testing of EULYNX specifications with Prover PSL, and one on validating architectural variants of ETCS trackside systems in a single ontology-driven framework.
When replacing relay interlockings, most conversations start with technology. The better starting point is governance: how do you make sure you can still change parts of the system 20 years from now? We look at what Open Signaling means in practice, and how our Stockholm Metro pilot was designed for replaceability from day one.
Prover, RATP and Systerel publish the unified HLL 4.0 specification, keeping the rail industry's formal verification language open and free of dialects.


