Supratik Chakraborty

Available identifiers

zbMath Open chakraborty.supratikWikidataQ102250373 ScholiaQ102250373MaRDI QIDQ526772

List of research outcomes

Publication	Date of Publication	Type
Tractable representations for Boolean functional synthesis	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	2023-08-17	Paper
Projected model counting: beyond independent support	2023-06-02	Paper
What's hard about Boolean functional synthesis?	2023-05-26	Paper
Functional synthesis via input-output separation	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	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	2021-08-30	Paper
Towards Parallel Boolean Functional Synthesis	2020-08-05	Paper
On Petri Nets with Hierarchical Special Arcs	2020-05-27	Paper
Verifying Array Manipulating Programs by Tiling	2019-09-16	Paper
A layered algorithm for quantifier elimination from linear modular constraints	2017-07-26	Paper
Symbolic trajectory evaluation for word-level verification: theory and implementation	2017-05-15	Paper
Matching Multiplications in Bit-Vector Formulas	2017-02-21	Paper
A generalization of the Łoś-Tarski preservation theorem	2016-01-12	Paper
A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures	2014-10-14	Paper
Quantifier Elimination for Linear Modular Constraints	2014-09-08	Paper
Improved Upper and Lower Bounds for Büchi Disambiguation	2014-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q5417666	2014-05-22	Paper
Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors	2013-08-05	Paper
Reasoning about Heap Manipulating Programs using Automata Techniques	2013-02-26	Paper
Preservation under Substructures modulo Bounded Cores	2012-09-21	Paper
Refining abstract interpretations	2012-03-19	Paper
Approximate Symbolic Reachability of Networks of Transition Systems	2010-06-02	Paper
On Minimal Odd Rankings for Büchi Complementation	2009-12-01	Paper
Bottom-Up Shape Analysis	2009-08-18	Paper
Automatically Refining Abstract Interpretations	2008-04-11	Paper
Tools and Algorithms for the Construction and Analysis of Systems	2007-05-02	Paper
Reasoning about synchronization in GALS systems	2006-09-28	Paper
Tools and Algorithms for the Construction and Analysis of Systems	2005-11-10	Paper
Efficient algorithms for approximate time separation of events	2002-11-27	Paper
Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines	1996-01-01	Paper

Research outcomes over time

This page was built for person: Supratik Chakraborty