The following pages link to Supratik Chakraborty (Q526772):
Displaying 34 items.
- Symbolic trajectory evaluation for word-level verification: theory and implementation (Q526779) (← links)
- Refining abstract interpretations (Q765513) (← links)
- \textsc{Diffy}: inductive reasoning of array programs using difference invariants (Q832320) (← links)
- A generalization of the Łoś-Tarski preservation theorem (Q904143) (← links)
- Efficient algorithms for approximate time separation of events (Q1847541) (← links)
- Boolean functional synthesis: hardness and practical algorithms (Q2050108) (← links)
- On eventual non-negativity and positivity for the weighted sum of powers of matrices (Q2104554) (← links)
- A layered algorithm for quantifier elimination from linear modular constraints (Q2363817) (← links)
- Reasoning about synchronization in GALS systems (Q2505629) (← links)
- Quantifier Elimination for Linear Modular Constraints (Q2879138) (← links)
- Preservation under Substructures modulo Bounded Cores (Q2915035) (← links)
- A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures (Q2922040) (← links)
- Matching Multiplications in Bit-Vector Formulas (Q2961559) (← links)
- Towards Parallel Boolean Functional Synthesis (Q3303903) (← links)
- Bottom-Up Shape Analysis (Q3392926) (← links)
- Approximate Symbolic Reachability of Networks of Transition Systems (Q3564025) (← links)
- On Minimal Odd Rankings for Büchi Complementation (Q3648701) (← links)
- Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines (Q4420875) (← links)
- Reasoning about Heap Manipulating Programs using Automata Techniques (Q4907859) (← links)
- Verifying Array Manipulating Programs with Full-Program Induction (Q5039501) (← links)
- On Petri Nets with Hierarchical Special Arcs (Q5111656) (← links)
- Improved Upper and Lower Bounds for Büchi Disambiguation (Q5166675) (← links)
- Verifying Array Manipulating Programs by Tiling (Q5233256) (← links)
- Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors (Q5326316) (← links)
- (Q5417666) (← links)
- Automatically Refining Abstract Interpretations (Q5458344) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703768) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5899054) (← links)
- What's hard about Boolean functional synthesis? (Q6045007) (← links)
- Functional synthesis via input-output separation (Q6102165) (← links)
- Boolean functional synthesis: from under the hood of solvers (Q6132564) (← links)
- Counterexample guided knowledge compilation for Boolean functional synthesis (Q6535639) (← links)
- On synthesizing computable Skolem functions for first-order logic (Q6584024) (← links)
- Tractable representations for Boolean functional synthesis (Q6630716) (← links)
