SMT-Based Bounded Model Checking for Real-Time Systems (Short Paper)

Abstract

SAT-based bounded model checking has a high complexity in dealing with real-time systems. SMT solvers can generalize SAT solving by adding the ability to handle arithmetic and other decidable theories. With this advantage, if we use SMT in bounded model checking for real-time systems instead of SAT, the clocks can be represented as integer or real variables directly and clock constraints can be represented as linear arithmetic expressions. This makes the checking procedure more efficient. We use TCTL to specify the properties of real-time systems.