𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic

✍ Scribed by Bryant, Randal E.; German, Steven; Velev, Miroslav N.


Book ID
120639988
Publisher
Association for Computing Machinery
Year
2001
Tongue
English
Weight
312 KB
Volume
2
Category
Article
ISSN
1529-3785

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Processor verification using efficient r
✍ Bryant, Randal E.; German, Steven; Velev, Miroslav N. πŸ“‚ Article πŸ“… 2001 πŸ› Association for Computing Machinery 🌐 English βš– 312 KB

The logic of Equality with Uninterpreted Functions (EUF) provides a means of abstracting the manipulation of data by a processor when verifying the correctness of its control logic. By reducing formulas in this logic to propositional formulas, we can apply Boolean methods such as ordered Binary Deci

[Lecture Notes in Computer Science] Comp
✍ Brinksma, Ed; Larsen, Kim Guldstrand πŸ“‚ Article πŸ“… 2002 πŸ› Springer Berlin Heidelberg 🌐 English βš– 199 KB

This volume contains the proceedings of the conference on Computer Aided V- i?cation (CAV 2002), held in Copenhagen, Denmark on July 27-31, 2002. CAV 2002 was the 14th in a series of conferences dedicated to the advancement of the theory and practice of computer-assisted formal analysis methods for