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.
Tom Melham
A grouping.
Tom Melham, Cambridge then Glasgow then Oxford. Held under four spellings -- Tom Melham, Tom F. Melham, Thomas F. Melham, Thomas Frederick Melham -- which is why the write-up queue listed him twice. Eleven records, 1986 to 2025.
10 references
Comprehensive Formal Verification of Observational Correctness for the CHERIoT-Ibex Processor
Louis-Emile Ploix and others (2025)
Relational STE and Theorem Proving for Formal Verification of Industrial Circuit Designs
John O'Leary and others (2013) · Formal Methods in Computer-Aided Design (FMCAD 2013) · IEEE Computer Society
Assume-Guarantee Validation for STE Properties within an SVA Environment
Zurab Khasidashvili and others (2009) · Formal Methods in Computer-Aided Design (FMCAD 2009) · IEEE
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
Higher order logic and hardware verification
Tom F. Melham (1993) · Cambridge University Press
Formalizing abstraction mechanisms for hardware verification in higher order logic
Thomas Frederick Melham (1990) · University of Cambridge Computer Laboratory
Automating Recursive Type Definitions in Higher Order Logic
Thomas F. Melham (1989)
Using recursive types to reason about hardware in higher order logic
Thomas F. Melham (1988) · University of Cambridge Computer Laboratory
Abstraction mechanisms for hardware verification
Thomas F. Melham (1987) · University of Cambridge Computer Laboratory
Hardware Verification using Higher-Order Logic
Albert Camilleri and others (1986) · University of Cambridge Computer Laboratory