An Embedding of Timed Transition Systems in HOL

A Visual Tradeoff Space for Formal Verification and Validation Techniques

“…HOL theorem provers [25] are a family of interactive theorem proving systems that use higher order logic, which is theoretically more descriptive than PLTL but is arguably harder to use when it comes to specification of reactive system requirements. Examples of HOL TPs include the NQTHM [26], HOL4 [25], Isabelle [27], ProofPower [28] and PVS [16], as well as several efforts to embed temporal logic in HOL [29]- [32]. There are also a number of formal methods (e.g.…”

“…Consequently, MC is limited to finite-state components and is performanceconstrained by the number of states in that component. For example, a single 32-bit integer variable induces effectively 2 32 states. For FV&V of large real-life systems there are two options available to MC users: (i) to ignore large parts of the system using a process known as abstraction [42], where MC is performed on a small abstract model of the original system, or (ii) to carve out limited, small, parts of the system and perform MC only on those parts.…”