Related Experiment Video
Updated: Jun 5, 2025

Setting Limits on Supersymmetry Using Simplified Models
Published on: November 15, 2013
Global guidance for local generalization in model checking
Hari Govind Vediramana Krishnan1, YuTing Chen2, Sharon Shoham3
1Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON Canada.
We introduce global guidance into IC3-style model checking for infinite state systems. This approach significantly enhances verification effectiveness by mitigating limitations of local reasoning, outperforming existing methods.
Area of Science:
- Formal methods
- Computer science
- Software engineering
Background:
- SMT-based model checkers, particularly IC3-style algorithms, are leading techniques for verifying infinite state systems.
- These methods infer global inductive invariants using local reasoning on transition relations, enhanced by SMT procedures like interpolation.
- However, reliance on SMT solver heuristics can compromise model checking stability.
Purpose of the Study:
- To systematically address the limitations of local reasoning in SMT-based model checking.
- To introduce explicit global guidance into the local reasoning of IC3-style algorithms.
- To improve the stability and effectiveness of infinite state system verification.
Main Methods:
- Extension of the SMT-IC3 paradigm with three novel rules for global guidance.
- Instantiation of these rules for Linear Integer Arithmetic and Linear Rational Arithmetic.
- Implementation of the enhanced algorithm, GSpacer, on top of the Spacer solver within Z3.
Main Results:
- GSpacer demonstrates significantly improved effectiveness compared to the original Spacer algorithm.
- The enhanced method also surpasses the performance of solely global reasoning approaches.
- GSpacer exhibits insensitivity to interpolation, a common factor affecting SMT solver performance.
Conclusions:
- Explicit global guidance is a systematic and effective way to overcome locality limitations in SMT-based model checking.
- GSpacer offers a more robust and efficient solution for verifying infinite state systems.
- The proposed method enhances verification stability and performance by reducing reliance on SMT solver-specific heuristics.
Related Concept Videos
Constraints and Statical Determinacy
Generalization, Discrimination, and Extinction
Generalization occurs when a behavior reinforced in one context is performed in similar situations. For instance, a student who studies diligently for calculus and receives excellent grades might apply the same study habits to psychology and history, expecting similar results. Generalization shows how learning in one setting can influence behavior in...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Case Studies
Propagation of Uncertainty from Systematic Error

