Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic (Q5738912): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2118154221 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: cs/9910014 / rank | |||
Normal rank | |||
Latest revision as of 04:03, 20 April 2024
scientific article; zbMATH DE number 6729722
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic |
scientific article; zbMATH DE number 6729722 |
Statements
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic (English)
0 references
13 June 2017
0 references
decision procedures
0 references
processor verfication
0 references
uninterpreted functions
0 references
