DocumentCode :
3460399
Title :
System modeling and verification with UCLID
Author :
Bryant, Randal E.
Author_Institution :
Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
fYear :
2004
fDate :
23-25 June 2004
Firstpage :
3
Lastpage :
4
Abstract :
Formal verification has had a significant impact on the semiconductor industry, particularly for companies that can devote significant resources to creating and deploying internally developed verification tools. Most existing verifiers model system operation at a detailed bit level. We have developed UCLID, a prototype verifier for infinite-state systems. The UCLID modeling language extends that of SMV, a bit-level model checker, to include integer and function state variables, addition by constants, and relational operations. The underlying logic is expressive enough to model a wide range of systems, but it still permits a decision procedure where we transform the formula into propositional logic and then use either binary decision diagrams (BDD) or a Boolean satisfiability (SAT) solver.
Keywords :
computability; formal verification; simulation languages; Boolean satisfiability; SAT solver; UCLID modeling language; binary decision diagrams; bit-level model checker; formal verification; function state variable; infinite-state systems; integer state variable; propositional logic; system modeling; Boolean functions; Buffer storage; Data structures; Engines; Formal verification; Hardware; Logic; Microprocessors; Power system modeling; Protocols;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Formal Methods and Models for Co-Design, 2004. MEMOCODE '04. Proceedings. Second ACM and IEEE International Conference on
Print_ISBN :
0-7803-8509-8
Type :
conf
DOI :
10.1109/MEMCOD.2004.1459805
Filename :
1459805
Link To Document :
بازگشت