Kaustuv Chaudhuri

Orcid: 0000-0003-2938-547X

According to our database1, Kaustuv Chaudhuri authored at least 38 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Formal Reasoning Using Distributed Assertions.
Proceedings of the Frontiers of Combining Systems - 14th International Symposium, 2023

2021
Subformula Linking for Intuitionistic Logic with Application to Type Theory.
Proceedings of the Automated Deduction - CADE 28, 2021

2019
Formalized meta-theory of sequent calculi for linear logics.
Theor. Comput. Sci., 2019

Hybrid linear logic, revisited.
Math. Struct. Comput. Sci., 2019

A proof-theoretic approach to certifying skolemization.
Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2019

2018
Expressing additives using multiplicatives and subexponentials.
Math. Struct. Comput. Sci., 2018

Preface - Special Issue on Logical Frameworks and Meta-Languages 2015.
Math. Struct. Comput. Sci., 2018

A two-level logic perspective on (simultaneous) substitutions.
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

2016
A multi-focused proof system isomorphic to expansion proofs.
J. Log. Comput., 2016

Formalized Meta-Theory of Sequent Calculi for Substructural Logics.
Proceedings of the 11th Workshop on Logical and Semantic Frameworks with Applications, 2016

Modular Focused Proof Systems for Intuitionistic Modal Logics.
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Focused and Synthetic Nested Sequents.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015
A Proof-theoretic Characterization of Independence in Type Theory.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

Disproving Using the Inverse Method by Iterative Refinement of Finite Approximations.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2015

An Adequate Compositional Encoding of Bigraph Structure in Linear Logic with Subexponentials.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

A Lightweight Formalization of the Metatheory of Bisimulation-Up-To.
Proceedings of the 2015 Conference on Certified Programs and Proofs, 2015

2014
Abella: A System for Reasoning about Relational Specifications.
J. Formaliz. Reason., 2014

Undecidability of Multiplicative Subexponential Logic.
Proceedings of the Proceedings Third International Workshop on Linearity, 2014

Automatically Deriving Schematic Theorems for Dynamic Contexts.
Proceedings of the 2014 International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, 2014

A Two-Level Logic Approach to Reasoning About Typed Specification Languages.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Equality and fixpoints in the calculus of structures.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
A Hybrid Linear Logic for Constrained Transition Systems with Applications to Molecular Biology.
CoRR, 2013

A Hybrid Linear Logic for Constrained Transition Systems.
Proceedings of the 19th International Conference on Types for Proofs and Programs, 2013

Reasoning about higher-order relational specifications.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

Subformula Linking as an Interaction Method.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

2012
A Systematic Approach to Canonicity in the Classical Sequent Calculus.
Proceedings of the Computer Science Logic (CSL'12), 2012

Compact Proof Certificates for Linear Logic.
Proceedings of the Certified Programs and Proofs - Second International Conference, 2012

2011
The Focused Calculus of Structures.
Proceedings of the Computer Science Logic, 2011

2010
Magically Constraining the Inverse Method Using Dynamic Polarity Assignment.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

The TLA<sup>+</sup> Proof System: Building a Heterogeneous Verification Platform.
Proceedings of the Theoretical Aspects of Computing, 2010

Classical and Intuitionistic Subexponential Logics Are Equally Expressive.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

Verifying Safety Properties with the TLA+ Proof System.
Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

2008
A Logical Characterization of Forward and Backward Chaining in the Inverse Method.
J. Autom. Reason., 2008

A TLA+ Proof System.
Proceedings of the LPAR 2008 Workshops, 2008

Focusing Strategies in the Sequent Calculus of Synthetic Connectives.
Proceedings of the Logic for Programming, 2008

Canonical Sequent Proofs via Multi-Focusing.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2005
Focusing the Inverse Method for Linear Logic.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

A Focusing Inverse Method Theorem Prover for First-Order Linear Logic.
Proceedings of the Automated Deduction, 2005


  Loading...