Tim Blackmore

According to our database, Tim Blackmore authored at least 11 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Detecting Stimuli with Novel Temporal Patterns to Accelerate Functional Coverage Closure.

Xuan Zheng, Tim Blackmore, James Buckingham, Kerstin Eder

Proceedings of the IEEE International Test Conference in Asia, 2024

2023

Using Neural Networks for Novelty-based Test Selection to Accelerate Functional Coverage Closure.

Xuan Zheng, Kerstin Eder, Tim Blackmore

Proceedings of the IEEE International Conference On Artificial Intelligence Testing, 2023

2022

Hybrid Intelligent Testing in Simulation-Based Verification.

Nyasha Masamba, Kerstin Eder, Tim Blackmore

Proceedings of the IEEE International Conference On Artificial Intelligence Testing, 2022

Supervised Learning for Coverage-Directed Test Selection in Simulation-Based Verification.

Nyasha Masamba, Kerstin Eder, Tim Blackmore

Proceedings of the IEEE International Conference On Artificial Intelligence Testing, 2022

2012

Analysing and Closing Simulation Coverage by Automatic Generation and Verification of Formal Properties from Coverage Reports.

Tim Blackmore, David Halliwell, Philip Barker, Kerstin Eder, Naresh Ramaram

Proceedings of the Integrated Formal Methods - 9th International Conference, 2012

2002

Lower Bounds on the State Complexity of Geometric Goppa Codes.

Tim Blackmore, Graham H. Norton

Des. Codes Cryptogr., 2002

A comparison of three verification techniques: directed testing, pseudo-random testing and property checking.

Mike Bartley, Darren Galpin, Tim Blackmore

Proceedings of the 39th Design Automation Conference, 2002

2001

On a family of Abelian codes and their state complexities.

Tim Blackmore, Graham H. Norton

IEEE Trans. Inf. Theory, 2001

Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound.

Tim Blackmore, Graham H. Norton

SIAM J. Discret. Math., 2001

Matrix-Product Codes over F_q.

Tim Blackmore, Graham H. Norton

Appl. Algebra Eng. Commun. Comput., 2001

1999

Every Binary (2^m-2, 2^{2^m-2-m}, 3) Code Can Be Lengthened to Form a Perfect Code of Length 2^m-1.

Tim Blackmore

IEEE Trans. Inf. Theory, 1999