Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic (Q5738912): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2118154221 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: cs/9910014 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
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