63 citations · 252 across the 39 of their papers we have counts for
9 papers · 1 filter
A Nonexistence Certificate for Projective Planes of Order Ten with Weight 15 Codewords
Curtis Bright, Kevin Cheung, Brett Stevens +3
Using techniques from the fields of symbolic computation and satisfiability checking we verify one of the cases used in the landmark result that projective planes of order ten do n…
MPro: Combining Static and Symbolic Analysis for Scalable Testing of Smart Contract
William Zhang, Sebastian Banescu, Leonardo Passos +2
Smart contracts are executable programs that enable the building of a programmable trust mechanism between multiple entities without the need of a trusted third-party. Researchers…
An Empirical Investigation of Randomized Defenses against Adversarial Attacks
Yannik Potdevin, Dirk Nowotka, Vijay Ganesh
In recent years, Deep Neural Networks (DNNs) have had a dramatic impact on a variety of problems that were long considered very difficult, e. g., image classification and automatic…
Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SAT
Curtis Bright, Ilias Kotsireas, Albert Heinle +1
We use techniques from the fields of computer algebra and satisfiability checking to develop a new algorithm to search for complex Golay pairs. We implement this algorithm and use…
The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices
Curtis Bright, Dragomir Ž. Đoković, Ilias Kotsireas +1
In this paper, we provide an overview of the SAT+CAS method that combines satisfiability checkers (SAT solvers) and computer algebra systems (CAS) to resolve combinatorial conjectu…
SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics
Curtis Bright, Ilias Kotsireas, Vijay Ganesh
Over the last few decades, many distinct lines of research aimed at automating mathematics have been developed, including computer algebra systems (CASs) for mathematical modelling…
Interpolating Strong Induction
Hari Govind V K, Yakir Vizel, Vijay Ganesh +1
The principle of strong induction, also known as k-induction is one of the first techniques for unbounded SAT-based Model Checking (SMC). While elegant and simple to apply, propert…
Effective problem solving using SAT solvers
Curtis Bright, Jürgen Gerhard, Ilias Kotsireas +1
In this article we demonstrate how to solve a variety of problems and puzzles using the built-in SAT solver of the computer algebra system Maple. Once the problems have been encode…
New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences
Curtis Bright, Ilias Kotsireas, Vijay Ganesh
We present new constructions for perfect and odd perfect sequences over the quaternion group . In particular, we show for the first time that perfect and odd perfect quaternio…