Computing reachable control states of systems modeled with uninterpreted functions and infinite memory
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 256-267
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Formal verification of the Island Tunnel Controller using Multiway Decision GraphsLecture Notes in Computer Science, 1996
- Verification using uninterpreted functions and finite instantiations1996
- Automatic datapath abstraction in hardware systemsLecture Notes in Computer Science, 1995
- Automated verification of behavioral equivalence for microprocessorsIEEE Transactions on Computers, 1994
- Comparing generic state machines1992
- Formal verification of a pipelined microprocessorIEEE Software, 1990
- Sequential circuit verification using symbolic model checking1990
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- A Practical Decision Procedure for Arithmetic with Function SymbolsJournal of the ACM, 1979