Technology
Constraint Checking
Constraint Checking is a formal verification technique that uses symbolic solvers to prove whether a system state can transition into a property violation.
Constraint Checking (CBC) moves beyond traditional model checking by utilizing symbolic constraint solvers (like ProB or Z3) to identify edge cases that break system invariants. Instead of exhaustively exploring every reachable state from an initial point, CBC treats the system as a mathematical model and searches for any single operation that could lead from a valid state to a failure. This approach is highly effective for verifying complex B-specifications, C programs, or UML diagrams where state-space explosion makes standard simulation impossible. By finding counter-examples through logic rather than brute force, engineers can isolate specific bugs in concurrent systems and memory management early in the design cycle.
Recent Talks & Demos
Showing 1-0 of 0