This description was written by a machine and published without a person checking it. It is what the agent made of this grouping, and not a statement anybody has stood behind.
How many values
A subject the papers are about. The loosest grouping, and the one to reach for last.
How many logic values a hardware model admits, and why the count keeps moving. The counts predate this set: ternary hazard algebra 1964, four-state MOS simulation 1981. From 1984 these records choose among them for proof, not simulation.
13 references
Bilattice-Catastrophe Isomorphism for Four-Valued Logic in Digital Systems
Jiu Hui Wu and others (2026)
Metastability-Containing Circuits
Stephan Friedrichs and others (2018) · IEEE Transactions on Computers · Institute of Electrical and Electronics Engineers (IEEE)
Word-level Symbolic Trajectory Evaluation
Supratik Chakraborty and others (2015)
Xs Are for Trajectory Evaluation, Booleans Are for Theorem Proving
Mark D. Aagaard and others (1999) · Correct Hardware Design and Verification Methods (CHARME '99) · Springer-Verlag
Formally verified synthesis of combinational CMOS circuits
David A. Basin and others (1991) · Integration, the VLSI Journal · Elsevier BV
Extraction of Gate Level Models from Transistor Circuits by Four-Valued Symbolic Analysis
Randal E. Bryant (1991) · International Conference on Computer-Aided Design (ICCAD '91)
Verification of Combinational Logic in Nuprl
David A. Basin and others (1989) · Cornell University
Formalising an integrated circuit design style in higher order logic
Inderpreet-Singh Dhingra (1988) · University of Cambridge Computer Laboratory
Using recursive types to reason about hardware in higher order logic
Thomas F. Melham (1988) · University of Cambridge Computer Laboratory
Hardware verification of VLSI regular structures
Jeffrey J. Joyce (1987) · University of Cambridge Computer Laboratory
Relating two models of hardware
Glynn Winskel (1987) · Category Theory and Computer Science · Springer Berlin Heidelberg
Hardware Verification using Higher-Order Logic
Albert Camilleri and others (1986) · University of Cambridge Computer Laboratory
Why higher-order logic is a good formalism for specifying and verifying hardware
Mike Gordon (1985) · University of Cambridge Computer Laboratory