Vijay Ganesh

Orcid: 0000-0002-6029-2047

Affiliations:
  • Georgia Institute of Technology, Atlanta, GA, USA
  • University of Waterloo, Canada (former)
  • Stanford University, CA, USA (PhD 2007)


According to our database1, Vijay Ganesh authored at least 141 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis.
CoRR, 2024

AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems.
CoRR, 2024

BertRLFuzzer: A BERT and Reinforcement Learning Based Fuzzer (Student Abstract).
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

A SAT + Computer Algebra System Verification of the Ramsey Problem R(3, 8) (Student Abstract).
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem (Student Abstract).
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Publisher Correction: Algorithm selection for SMT.
Int. J. Softw. Tools Technol. Transf., December, 2023

Algorithm selection for SMT.
Int. J. Softw. Tools Technol. Transf., April, 2023

On the Expressive Power of String Constraints.
Proc. ACM Program. Lang., January, 2023

Towards more efficient methods for solving regular-expression heavy string constraints.
Theor. Comput. Sci., 2023

Limits of CDCL Learning via Merge Resolution.
Electron. Colloquium Comput. Complex., 2023

Formal Languages via Theories over Strings: An Overview of Some Recent Results.
Bull. EATCS, 2023

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem.
CoRR, 2023

Attention, Compilation, and Solver-based Symbolic Analysis are All You Need.
CoRR, 2023

BertRLFuzzer: A BERT and Reinforcement Learning based Fuzzer.
CoRR, 2023

CGDTest: A Constrained Gradient Descent Algorithm for Testing Neural Networks.
CoRR, 2023

Learning Modulo Theories.
CoRR, 2023

Learning Shorter Redundant Clauses in SDCL Using MaxSAT.
Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

Grounding Neural Inference with Satisfiability Modulo Theories.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Robust Training for AC-OPF (Student Abstract).
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Theory and Practice of SAT and Combinatorial Solving (Dagstuhl Seminar 22411).
Dagstuhl Reports, October, 2022

Machine Learning and Logical Reasoning: The New Frontier (Dagstuhl Seminar 22291).
Dagstuhl Reports, July, 2022

Editorial.
Innov. Syst. Softw. Eng., 2022

Machine learning and logic: a new frontier in artificial intelligence.
Formal Methods Syst. Des., 2022

Formal Languages via Theories over Strings.
CoRR, 2022

When satisfiability solving meets symbolic computation.
Commun. ACM, 2022

Goose: A Meta-Solver for Deep Neural Network Verification.
Proceedings of the 20th Internal Workshop on Satisfiability Modulo Theories co-located with the 11th International Joint Conference on Automated Reasoning (IJCAR 2022) part of the 8th Federated Logic Conference (FLoC 2022), 2022

Diversifying a Parallel SAT Solver with Bayesian Moment Matching.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2022

An SC-Square Approach to the Minimum Kochen-Specker Problem.
Proceedings of the 7th SC-Square Workshop co-located with the Federated Logic Conference, 2022

Gas Gauge: A Security Analysis Tool for Smart Contract Out-of-Gas Vulnerabilities.
Proceedings of the 3rd International Conference on Mathematical Research for Blockchain Economy, 2022

A Solver + Gradient Descent Training Algorithm for Deep Neural Networks.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT.
J. Symb. Comput., 2021

On the Hierarchical Community Structure of Practical SAT Formulas.
CoRR, 2021

MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

Logic Solvers and Machine Learning: The Next Frontier (keynote abstract).
Proceedings of the 6th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry, 2021

On the Hierarchical Community Structure of Practical Boolean Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

BanditFuzz: Fuzzing SMT Solvers with Multi-agent Reinforcement Learning.
Proceedings of the Formal Methods - 24th International Symposium, 2021

Z3str4: A Multi-armed String Solver.
Proceedings of the Formal Methods - 24th International Symposium, 2021

String Theories Involving Regular Membership Predicates: From Practice to Theory and Back.
Proceedings of the Combinatorics on Words - 13th International Conference, 2021

An SMT Solver for Regular Expressions and Linear Arithmetic over String Length.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Amnesiac Machine Learning.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

A SAT-based Resolution of Lam's Problem.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Logic Guided Genetic Algorithms (Student Abstract).
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences.
IEEE Trans. Inf. Theory, 2020

Applying computer algebra systems with SAT solvers to the Williamson conjecture.
J. Symb. Comput., 2020

Logic Guided Genetic Algorithms.
CoRR, 2020

A Length-aware Regular Expression SMT Solver.
CoRR, 2020

LGML: Logic Guided Machine Learning.
CoRR, 2020

Discovering Symmetry Invariants and Conserved Quantities by Interpreting Siamese Neural Networks.
CoRR, 2020

LogicGAN: Logic-guided Generative Adversarial Networks.
CoRR, 2020

A nonexistence certificate for projective planes of order ten with weight 15 codewords.
Appl. Algebra Eng. Commun. Comput., 2020

BanditFuzz: A Reinforcement-Learning Based Performance Fuzzer for SMT Solvers.
Proceedings of the Software Verification - 12th International Conference, 2020

Abstract: MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers.
Proceedings of the 18th International Workshop on Satisfiability Modulo Theories co-located with the 10th International Joint Conference on Automated Reasoning (IJCAR 2020), 2020

Abstract: BanditFuzz: A Reinforcement-Learning based Performance Fuzzer for SMT Solvers.
Proceedings of the 18th International Workshop on Satisfiability Modulo Theories co-located with the 10th International Joint Conference on Automated Reasoning (IJCAR 2020), 2020

Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Nonexistence Certificates for Ovals in a Projective Plane of Order Ten.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Online Bayesian Moment Matching based SAT Solver Heuristics.
Proceedings of the 37th International Conference on Machine Learning, 2020

A Machine Learning Based Splitting Heuristic for Divide-and-Conquer Solvers.
Proceedings of the Principles and Practice of Constraint Programming, 2020

LGML: Logic Guided Machine Learning (Student Abstract).
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

On the Unreasonable Effectiveness of SAT Solvers.
Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019
SMTIBEA: a hybrid multi-objective optimization algorithm for configuring large constrained software product lines.
Softw. Syst. Model., 2019

An Empirical Investigation of Randomized Defenses against Adversarial Attacks.
CoRR, 2019

The SAT+CAS method for combinatorial search with applications to best matrices.
Ann. Math. Artif. Intell., 2019

On the Proof Complexity of MCSAT.
Proceedings of the 4th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry, 2019

Accelerated Learning of Predictive Runtime Monitors for Rare Failure.
Proceedings of the Runtime Verification - 19th International Conference, 2019

Effective Problem Solving Using SAT Solvers.
Proceedings of the Maple in Mathematics Education and Research - Third Maple Conference, 2019

Theory and practice of string solvers (invited talk abstract).
Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis, 2019

MPro: Combining Static and Symbolic Analysis for Scalable Testing of Smart Contract.
Proceedings of the 30th IEEE International Symposium on Software Reliability Engineering, 2019

Interpolating Strong Induction.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

CDCL(Crypto) SAT solvers for cryptanalysis.
Proceedings of the 29th Annual International Conference on Computer Science and Software Engineering, 2019

SAT solvers and computer algebra systems: a powerful combination for mathematics.
Proceedings of the 29th Annual International Conference on Computer Science and Software Engineering, 2019

A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture.
CoRR, 2018

The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability.
CoRR, 2018

The SAT+CAS paradigm and the Williamson conjecture.
ACM Commun. Comput. Algebra, 2018

Predicting SAT Solver Performance on Heterogeneous Hardware.
Proceedings of Pragmatics of SAT 2015, 2018

Machine Learning-Based Restart Policy for CDCL SAT Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

The Satisfiability of Word Equations: Decidable and Undecidable Theories.
Proceedings of the Reachability Problems - 12th International Conference, 2018

Enumeration of Complex Golay Pairs via Programmatic SAT.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

An Empirical Study of Branching Heuristics through the Lens of Global Learning Rate.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Learning-Sensitive Backdoors with Restarts.
Proceedings of the Principles and Practice of Constraint Programming, 2018

The Effect of Structural Measures and Merges on SAT Solver Performance.
Proceedings of the Principles and Practice of Constraint Programming, 2018

Algebraic Fault Attack on SHA Hash Functions Using Programmatic SAT Solvers.
Proceedings of the Principles and Practice of Constraint Programming, 2018

The Proof Complexity of SMT Solvers.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

StringFuzz: A Fuzzer for String Solvers.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

A SAT+CAS Method for Enumerating Williamson Matrices of Even Order.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures.
J. Autom. Reason., 2017

Z3str2: an efficient solver for strings, regular expressions, and length constraints.
Formal Methods Syst. Des., 2017

Relating Complexity-theoretic Parameters with SAT Solver Performance.
CoRR, 2017

Z3str3: A String Solver with Theory-aware Branching.
CoRR, 2017

Adaptive Restart and CEGAR-Based Solver for Inverting Cryptographic Hash Functions.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2017

A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Preface.
Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation co-located with the 42nd International Symposium on Symbolic and Algebraic Computation (ISSAC 2017), 2017

A solver for a theory of string and bit-vectors.
Proceedings of the 39th International Conference on Software Engineering, 2017

Z3str3: A string solver with theory-aware heuristics.
Proceedings of the 2017 Formal Methods in Computer Aided Design, 2017

Reasoning about Probabilistic Defense Mechanisms against Remote Attacks.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy, 2017


2016
A Solver for a Theory of Strings and Bit-vectors.
CoRR, 2016

Undecidability of a Theory of Strings, Linear Arithmetic over Length, and String-Number Conversion.
CoRR, 2016

Accelerating the General Simplex Procedure for Linear Real Arithmetic via GPUs.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2016

MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures.
Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation co-located with 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2016), 2016

Learning Rate Based Branching Heuristic for SAT Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Combining static analysis and targeted symbolic execution for scalable bug-finding in application binaries.
Proceedings of the 26th Annual International Conference on Computer Science and Software Engineering, 2016

Manifold: an SMT-based declarative language for electronic and microfluidic design synthesis.
Proceedings of the 26th Annual International Conference on Computer Science and Software Engineering, 2016

Code obfuscation against symbolic execution attacks.
Proceedings of the 32nd Annual Conference on Computer Security Applications, 2016

Exponential Recency Weighted Average Branching Heuristic for SAT Solvers.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Theory and Practice of SAT Solving (Dagstuhl Seminar 15171).
Dagstuhl Reports, 2015

The Meaning of Attack-Resistant Programs.
CoRR, 2015

SAT-based analysis of large real-world feature models is easy.
Proceedings of the 19th International Conference on Software Product Line, 2015

SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers.
Proceedings of the Hardware and Software: Verification and Testing, 2015

Short Paper: The Meaning of Attack-Resistant Systems.
Proceedings of the 10th ACM Workshop on Programming Languages and Analysis for Security, 2015

Effective Search-Space Pruning for Solvers of String Equations, Regular Expressions and Length Constraints.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers.
Proceedings of the Automated Deduction - CADE-25, 2015

2014
Symbolic Execution and Constraint Solving (Dagstuhl Seminar 14442).
Dagstuhl Reports, 2014

Impact of Community Structure on SAT Solver Performance.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2013
Mohawk: Abstraction-Refinement and Bound-Estimation for Verifying Access Control Policies.
ACM Trans. Inf. Syst. Secur., 2013

(Un)Decidability Results for Word Equations with Length and Regular Expression Constraints.
CoRR, 2013

Z3-str: a z3-based string solver for web application analysis.
Proceedings of the Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, 2013

2012
HAMPI: A solver for word equations over strings, regular expressions, and context-free grammars.
ACM Trans. Softw. Eng. Methodol., 2012

STP/HAMPI and Computer Security
CoRR, 2012

Cryptographic Path Hardening: Hiding Vulnerabilities in Software through Cryptography
CoRR, 2012

Lynx: A Programmatic SAT Solver for the RNA-Folding Problem.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Automatic input rectification.
Proceedings of the 34th International Conference on Software Engineering, 2012

Word Equations with Length Constraints: What's Decidable?
Proceedings of the Hardware and Software: Verification and Testing, 2012

An SMT-based approach to automated configuration.
Proceedings of the 10th International Workshop on Satisfiability Modulo Theories, 2012

SMT-LIB Sequences and Regular Expressions.
Proceedings of the 10th International Workshop on Satisfiability Modulo Theories, 2012

2011
ARBAC Policy for a Large Multi-National Bank
CoRR, 2011

Automatic error finding in access-control policies.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

HAMPI: A String Solver for Testing, Analysis and Vulnerability Detection.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2009
jFuzz: A Concolic Whitebox Fuzzer for Java.
Proceedings of the First NASA Formal Methods Symposium, 2009

HAMPI: a solver for string constraints.
Proceedings of the Eighteenth International Symposium on Software Testing and Analysis, 2009

Taint-based directed whitebox fuzzing.
Proceedings of the 31st International Conference on Software Engineering, 2009

2008
EXE: Automatically Generating Inputs of Death.
ACM Trans. Inf. Syst. Secur., 2008

2007
Decision procedures for bit-vectors, arrays and integers.
PhD thesis, 2007

A Decision Procedure for Bit-Vectors and Arrays.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

2003
An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

2002
Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods.
Proceedings of the Formal Methods in Computer-Aided Design, 4th International Conference, 2002

1999
EXPRESSION: A Language for Architecture Exploration through Compiler/Simulator Retargetability.
Proceedings of the 1999 Design, 1999


  Loading...