Bruce W. Watson

Affiliations:
  • Stellenbosch University, Department of Information Science, South Africa
  • CSIR, Centre for Artificial Intelligence Research, Pretoria, South Africa
  • University of Pretoria, Department of Computer Science, South Africa
  • TU Eindhoven, Department of Mathematics and Computing Science, The Netherlands
  • Ribbit Software Systems Inc., Kelowna, BC, Canada


According to our database1, Bruce W. Watson authored at least 116 papers between 1996 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Architecture Requirements for Open Inference Networks.
Proceedings of the 17th International Conference on Evaluation of Novel Approaches to Software Engineering, 2022

Re-CorC-ing KeY: Correct-by-Construction Software Development Based on KeY.
Proceedings of the Logic of Software. A Tasting Menu of Formal Methods, 2022

2021
Searching with Extended Guard and Pivot Loop.
Proceedings of the Prague Stringology Conference 2021, 2021

Pitfalls of Algorithm Comparison.
Proceedings of the Prague Stringology Conference 2021, 2021

Tutorial: The Correctness-by-Construction Approach to Programming Using CorC.
Proceedings of the IEEE Secure Development Conference, 2021

Tool Support for Correctness-by-Construction.
Proceedings of the Software Engineering 2021, 2021

Cyber Personhood.
Proceedings of the 13th International Conference on Cyber Conflict, 2021

2020
Tune-up for the Dead-Zone Algorithm.
Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

X-by-Construction - Correctness Meets Probability.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles, 2020

Up in the Air: Ensuring Government Data Sovereignty in the Cloud.
Proceedings of the 12th International Conference on Cyber Conflict, 2020

2019
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform.
Inf. Process. Lett., 2019

A Brief Overview of Dead-Zone Pattern Matching Algorithms.
Proceedings of the Artificial Intelligence Applications and Innovations, 2019

On the Cyclic Regularities of Strings.
Proceedings of the Artificial Intelligence Applications and Innovations, 2019

Comparing Correctness-by-Construction with Post-Hoc Verification - A Qualitative User Study.
Proceedings of the Formal Methods. FM 2019 International Workshops, 2019

2018
Workshop on Advances in Knowledge Extraction and Re-engineering of Software (selected and extended papers from WAKERS 2017).
Sci. Comput. Program., 2018

From Tree Automata to String Automata Minimization.
Theory Comput. Syst., 2018

Three Strategies for the Dead-Zone String Matching Algorithm.
Proceedings of the Prague Stringology Conference 2018, 2018

Towards Confidentiality-by-Construction.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Modeling, 2018

X-by-Construction.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Modeling, 2018

Using CSP to Develop Quality Concurrent Software.
Proceedings of the Principled Software Development, 2018

2017
An Assessment of Algorithms for Deriving Failure Deterministic Finite Automata.
South Afr. Comput. J., 2017

Indeterminate String Factorizations and Degenerate Text Transformations.
Math. Comput. Sci., 2017

Towards a Unified Taxonomy of Biclustering Methods.
CoRR, 2017

On the Semantics of Atomic Subgroups in Practical Regular Expressions.
Proceedings of the Implementation and Application of Automata, 2017

Many-MADFAct: Concurrently Constructing MADFAs.
Proceedings of the Prague Stringology Conference 2017, 2017

CSP for Parallelising Brzozowski's DFA Construction Algorithm.
Proceedings of the Role of Theory in Computer Science, 2017

2016
Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA.
Proceedings of the Implementation and Application of Automata, 2016

Using Human Computation in Dead-zone based 2D Pattern Matching.
Proceedings of the Prague Stringology Conference 2016, 2016

Correctness-by-Construction and Post-hoc Verification: A Marriage of Convenience?
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques, 2016

Correctness-by-Construction \wedge Taxonomies \Rightarrow Deep Comprehension of Algorithm Families.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques, 2016

Tax-PLEASE - Towards Taxonomy-Based Software Product Line Engineering.
Proceedings of the Software Reuse: Bridging with Social-Awareness, 2016

2015
Experience with correctness-by-construction.
Sci. Comput. Program., 2015

Hardware Implementations of Finite Automata and Regular Expressions - Extended Abstract.
Proceedings of the Implementation and Application of Automata, 2015

Quantum Leap Pattern Matching.
Proceedings of the Prague Stringology Conference 2015, 2015

SPLicing TABASCO: Custom-Tailored Software Product Line Variants from Taxonomy-Based Toolkits.
Proceedings of the 2015 Annual Research Conference on South African Institute of Computer Scientists and Information Technologists, 2015

An Aho-Corasick Based Assessment of Algorithms Generating Failure Deterministic Finite Automata.
Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, 2015

2014
Weak factor automata: the failure of failure factor oracles?
South Afr. Comput. J., 2014

Quality in software development: a pragmatic approach using metrics.
South Afr. Comput. J., 2014

Using Correctness-by-Construction to Derive Dead-zone Algorithms.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

A Process-Oriented Implementation of Brzozowski's DFA Construction Algorithm.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Empirically Assessing Algorithm Performance.
Proceedings of the Southern African Institute for Computer Scientist and Information Technologists Annual Conference 2014, 2014

A Text Transformation Scheme for Degenerate Strings.
Proceedings of the 2nd International Conference on Algorithms for Big Data , 2014

Elastic deep packet inspection.
Proceedings of the 6th International Conference on Cyber Conflict, 2014

2013
Fine-tuning the search for microsatellites.
J. Discrete Algorithms, 2013

Weak Factor Automata: Comparing (Failure) Oracles and Storacles.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Efficient representation of DNA data for pattern recognition using failure factor oracles.
Proceedings of the 2013 South African Institute for Computer Scientists and Information Technologists, 2013

Identification of All Exact and Approximate Inverted Repeats in Regular and Weighted Sequences.
Proceedings of the Engineering Applications of Neural Networks, 2013

Cuts in Regular Expressions.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Correctness-by-Construction in Stringology.
Proceedings of the Prague Stringology Conference 2012, 2012

Failure Deterministic Finite Automata.
Proceedings of the Prague Stringology Conference 2012, 2012

An Efficient Parallel Determinisation Algorithm for Finite-state Automata.
Proceedings of the Prague Stringology Conference 2012, 2012

Performance assessment of dead-zone single keyword pattern matching.
Proceedings of the 2012 South African Institute of Computer Scientists and Information Technologists Conference, 2012

A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

Multiple Keyword Pattern Matching using Position Encoded Pattern Lattices.
Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, 2012

The Correctness-by-Construction Approach to Programming.
Springer, ISBN: 978-3-642-27918-8, 2012

2011
On Compile Time Knuth-Morris-Pratt Precomputation.
Proceedings of the Prague Stringology Conference 2011, 2011

Model-Based Passive Testing of Safety-Critical Components.
Proceedings of the Model-Based Testing for Embedded Systems, 2011

2010
A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms.
Sci. Comput. Program., 2010

Formal Characterizations of FA-based String Processors.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Improving Automata Efficiency by Stretching and Jamming.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Performance of C++ bit-vector implementations.
Proceedings of the 2010 Annual Conference of the South African Institute of Computer Scientists and Information Technologists, 2010

A framework for benchmarking FA-based string recognizers.
Proceedings of the 2010 Annual Conference of the South African Institute of Computer Scientists and Information Technologists, 2010

Software engineering in South Africa.
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering, 2010

2009
An incremental algorithm to construct a lattice of set intersections.
Sci. Comput. Program., 2009

On Regular Expression Hashing to Reduce FA Size.
Int. J. Found. Comput. Sci., 2009

Virtual machine framework for constructing domain-specific languages.
IET Softw., 2009

On Minimizing Deterministic Tree Automata.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

FCA-Based Two Dimensional Pattern Matching.
Proceedings of the Formal Concept Analysis, 7th International Conference, 2009

2008
A Boyer-Moore-Horspool algorithm derivation.
South Afr. Comput. J., 2008

Efficient Automata Constructions and Approximate Automata.
Int. J. Found. Comput. Sci., 2008

A Concurrent Specification of Brzozowski's DFA Construction Algorithm.
Int. J. Found. Comput. Sci., 2008

On Implementation and Performance of Table-Driven DFA-Based String Processors.
Int. J. Found. Comput. Sci., 2008

A Concurrent Specification of an Incremental DFA Minimisation Algorithm.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

A New CSP Operator for Optional Parallelism.
Proceedings of the International Conference on Computer Science and Software Engineering, 2008

2007
A Word Game Support Tool Case Study.
ARIMA J., 2007

Automata Applications in Chip-Design Software.
Proceedings of the Implementation and Application of Automata, 2007

2006
Performance of hardcoded finite automata.
Softw. Pract. Exp., 2006

TABASCO: using concept-based taxonomies in domain engineering.
South Afr. Comput. J., 2006

Dynamic Allocation of Finite Automata States for Fast String Recognition.
Int. J. Found. Comput. Sci., 2006

FireµSat: An algorithm to detect microsatellites in DNA.
Proceedings of the Prague Stringology Conference, 2006

Refactoring Tools and Complementary Techniques.
Proceedings of the 2006 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2006), 2006

2005
Constructing Factor Oracles.
J. Autom. Lang. Comb., 2005

A framework for the dynamic implementation of finite automata for performance enhancement.
Int. J. Found. Comput. Sci., 2005

Taxonomy-based software construction of SPARE Time: a case study.
IEE Proc. Softw., 2005

Reordering finite automata states for fast string recognition.
Proceedings of the Prague Stringology Conference, 2005

FIRE Station.
Proceedings of the Finite-State Methods and Natural Language Processing, 2005

2004
Introduction.
Theor. Comput. Sci., 2004

SPARE Parts: a C++ toolkit for string pattern recognition.
Softw. Pract. Exp., 2004

Reducing memory requirements in reachability-based finite automata operations.
Softw. Pract. Exp., 2004

Taxonomy of directed graph representations.
IEE Proc. Softw., 2004

Combining Regular Expressions with (Near-)Optimal Brzozowski Automata.
Proceedings of the Implementation and Application of Automata, 2004

FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views.
Proceedings of the Implementation and Application of Automata, 2004

Automaton-Based Sublinear Keyword Pattern Matching.
Proceedings of the String Processing and Information Retrieval, 2004

2003
A new regular grammar pattern matching algorithm.
Theor. Comput. Sci., 2003

A Boyer-Moore-style algorithm for regular expression pattern matching.
Sci. Comput. Program., 2003

A new algorithm for the construction of minimal acyclic DFAs.
Sci. Comput. Program., 2003

A new family of string pattern matching algorithms.
South Afr. Comput. J., 2003

A new family and structure for Commentz-Walter-style multiple-keyword pattern matching algorithms : research article.
South Afr. Comput. J., 2003

An efficient incremental DFA minimization algorithm.
Nat. Lang. Eng., 2003

Preliminary Experiments in Hardcoding Finite Automata.
Proceedings of the Implementation and Application of Automata, 2003

The Effect of Rewriting Regular Expressions on Their Accepting Automata.
Proceedings of the Implementation and Application of Automata, 2003

A New Recursive Incremental Algorithm for Building Minimal Acyclic Deterministic Finite Automata.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002
Directly constructing minimal DFAs : combining two algorithms by Brzozowski.
South Afr. Comput. J., 2002

A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata.
J. Univers. Comput. Sci., 2002

2001
A taxonomy of algorithms for constructing minimal acyclic deterministic finite automata.
South Afr. Comput. J., 2001

2000
Incremental Construction of Minimal Acyclic Finite State Automata.
Comput. Linguistics, 2000

A new family of Commentz-Walter-style multiple-keyword pattern matching algorithms.
Proceedings of the Prague Stringology Club Workshop 2000, Prague, Czech Republic, 2000

1998
A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs.
Proceedings of the Automata Implementation, 1998

An Early-Retirement Plan for the States.
Proceedings of the Prague Stringology Club Workshop 1998, Prague, Czech Republic, 1998

1997
Practical Optimizations for Automata.
Proceedings of the Automata Implementation, 1997

SPARE Parts: A C++ Toolkit for String PAttern REcognition.
Proceedings of the Prague Stringology Club Workshop 1997, 1997

A Boyer-Moore (or Watson-Watson) Type Algorithm for Regular Tree Pattern Matching.
Proceedings of the Prague Stringology Club Workshop 1997, 1997

1996
A Taxonomy of Sublinear Multiple Keyword Pattern Matching Algorithms.
Sci. Comput. Program., 1996

Implementing and using finite automata toolkits.
Nat. Lang. Eng., 1996

FIRE Lite: FAs and REs in C++.
Proceedings of the Automata Implementation, 1996

A Collection of New Regular Grammar Pattern Matching Algorithms.
Proceedings of the Prague Stringology Club Workshop 1996, 1996


  Loading...