| Publication | Date of Publication | Type |
|---|
Tractable representations for Boolean functional synthesis
Annals of Mathematics and Artificial Intelligence | 2024-10-31 | Paper |
On synthesizing computable Skolem functions for first-order logic
| 2024-08-06 | Paper |
Counterexample guided knowledge compilation for Boolean functional synthesis
| 2024-02-01 | Paper |
Boolean functional synthesis: from under the hood of solvers
Logic and Its Applications | 2023-08-17 | Paper |
Projected model counting: beyond independent support
Automated Technology for Verification and Analysis | 2023-06-02 | Paper |
What's hard about Boolean functional synthesis?
Computer Aided Verification | 2023-05-26 | Paper |
Functional synthesis via input-output separation
Formal Methods in System Design | 2023-05-08 | Paper |
On eventual non-negativity and positivity for the weighted sum of powers of matrices
| 2022-12-07 | Paper |
Verifying array manipulating programs with full-program induction
Tools and Algorithms for the Construction and Analysis of Systems | 2022-10-13 | Paper |
\textsc{Diffy}: inductive reasoning of array programs using difference invariants
| 2022-03-25 | Paper |
Boolean functional synthesis: hardness and practical algorithms
Formal Methods in System Design | 2021-08-30 | Paper |
Towards Parallel Boolean Functional Synthesis
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
On Petri nets with hierarchical special arcs
| 2020-05-27 | Paper |
Verifying array manipulating programs by tiling
Static Analysis | 2019-09-16 | Paper |
A layered algorithm for quantifier elimination from linear modular constraints
Formal Methods in System Design | 2017-07-26 | Paper |
Symbolic trajectory evaluation for word-level verification: theory and implementation
Formal Methods in System Design | 2017-05-15 | Paper |
Matching multiplications in bit-vector formulas
Lecture Notes in Computer Science | 2017-02-21 | Paper |
A generalization of the Łoś-Tarski preservation theorem
Annals of Pure and Applied Logic | 2016-01-12 | Paper |
A generalization of the Łoś-Tarski preservation theorem over classes of finite structures
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Quantifier elimination for linear modular constraints
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
Improved upper and lower bounds for Büchi disambiguation
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
Bounding variance and expectation of longest path lengths in dags
| 2014-05-22 | Paper |
Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
Reasoning about heap manipulating programs using automata techniques
Modern Applications of Automata Theory | 2013-02-26 | Paper |
Preservation under substructures modulo bounded cores
Logic, Language, Information and Computation | 2012-09-21 | Paper |
Refining abstract interpretations
Information Processing Letters | 2012-03-19 | Paper |
Approximate Symbolic Reachability of Networks of Transition Systems
Next Generation Design and Verification Methodologies for Distributed Embedded Control Systems | 2010-06-02 | Paper |
On minimal odd rankings for Büchi complementation
Automated Technology for Verification and Analysis | 2009-12-01 | Paper |
Bottom-Up Shape Analysis
Static Analysis | 2009-08-18 | Paper |
Automatically Refining Abstract Interpretations
Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Reasoning about synchronization in GALS systems
Formal Methods in System Design | 2006-09-28 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Efficient algorithms for approximate time separation of events
Sādhanā | 2002-11-27 | Paper |
Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines
IEEE Transactions on Computers | 1996-01-01 | Paper |
