Vijay Ganesh

According to our database1, Vijay Ganesh authored at least 86 papers between 1999 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
SMTIBEA: a hybrid multi-objective optimization algorithm for configuring large constrained software product lines.
Software and Systems Modeling, 2019

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

Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SAT.
CoRR, 2019

The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices.
CoRR, 2019

SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics.
CoRR, 2019

Effective problem solving using SAT solvers.
CoRR, 2019

Interpolating Strong Induction.
CoRR, 2019

New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences.
CoRR, 2019

Accelerated Learning of Predictive Runtime Monitors for Rare Failure.
Proceedings of the Runtime Verification - 19th International 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

Interpolating Strong Induction.
Proceedings of the Computer Aided Verification - 31st International Conference, 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
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples.
CoRR, 2018

Enumeration of Complex Golay Pairs via Programmatic SAT.
CoRR, 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 Comm. Computer 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. Reasoning, 2017

Z3str2: an efficient solver for strings, regular expressions, and length constraints.
Formal Methods in System Design, 2017

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

Reasoning about Probabilistic Defense Mechanisms against Remote Attacks.
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

SC-square: when Satisfiability Checking and Symbolic Computation join forces.
Proceedings of the ARCADE 2017, 2017

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

Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions.
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

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

MATHCHECK: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 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

MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures.
Proceedings of the Computer Algebra in Scientific Computing - 18th International Workshop, 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

Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers.
CoRR, 2015

SAT-based Analysis of Large Real-world Feature Models is Easy.
CoRR, 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

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
A Decision Procedure for Bit-Vectors and Arrays.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

2006
EXE: automatically generating inputs of death.
Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, Ioctober 30, 2006

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...