default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKshitij Bansal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Heri Zhao, Jeffrey Hui, Joshua Howland, Nam Nguyen, Siqi Zuo, Andrea Hu, Christopher A. Choquette-Choo, Jingyue Shen, Joe Kelley, Kshitij Bansal, Luke Vilnis, Mateo Wirth, Paul Michel, Peter Choy, Pratik Joshi, Ravin Kumar, Sarmad Hashmi, Shubham Agrawal, Zhitao Gong, Jane Fine, Tris Warkentin, Ale Jakse Hartman, Bin Ni, Kathy Korevec, Kelly Schaefer, Scott Huffman:
CodeGemma: Open Code Models Based on Gemma. CoRR abs/2406.11409 (2024)- 2021
- [c12]Markus Norman Rabe, Dennis Lee, Kshitij Bansal, Christian Szegedy:
Mathematical Reasoning via Self-supervised Skip-tree Training. ICLR 2021 - [c11]Eric Koskinen, Kshitij Bansal:
Decomposing Data Structure Commutativity Proofs with $m\!n$-Differencing. VMCAI 2021: 81-103 - 2020
- [j2]Kshitij Bansal, Eric Koskinen
, Omer Tripp:
Synthesizing Precise and Useful Commutativity Conditions. J. Autom. Reason. 64(7): 1333-1359 (2020) - [c10]Aditya Paliwal, Sarah M. Loos, Markus N. Rabe, Kshitij Bansal, Christian Szegedy:
Graph Representations for Higher-Order Logic and Theorem Proving. AAAI 2020: 2967-2974 - [c9]Dennis Lee, Christian Szegedy, Markus N. Rabe, Sarah M. Loos, Kshitij Bansal:
Mathematical Reasoning in Latent Space. ICLR 2020 - [i10]Eric Koskinen, Kshitij Bansal:
Reducing Commutativity Verification to Reachability with Differencing Abstractions. CoRR abs/2004.08450 (2020) - [i9]Markus N. Rabe, Dennis Lee, Kshitij Bansal, Christian Szegedy:
Language Modeling for Formal Mathematics. CoRR abs/2006.04757 (2020)
2010 – 2019
- 2019
- [c8]Kshitij Bansal, Sarah M. Loos, Markus N. Rabe, Christian Szegedy, Stewart Wilcox:
HOList: An Environment for Machine Learning of Higher Order Logic Theorem Proving. ICML 2019: 454-463 - [i8]Kshitij Bansal, Sarah M. Loos, Markus N. Rabe, Christian Szegedy, Stewart Wilcox:
HOList: An Environment for Machine Learning of Higher-Order Theorem Proving (extended version). CoRR abs/1904.03241 (2019) - [i7]Aditya Paliwal, Sarah M. Loos, Markus N. Rabe, Kshitij Bansal, Christian Szegedy:
Graph Representations for Higher-Order Logic and Theorem Proving. CoRR abs/1905.10006 (2019) - [i6]Kshitij Bansal, Sarah M. Loos, Markus N. Rabe, Christian Szegedy:
Learning to Reason in Large Theories without Imitation. CoRR abs/1905.10501 (2019) - [i5]Dennis Lee, Christian Szegedy, Markus N. Rabe, Sarah M. Loos, Kshitij Bansal:
Mathematical Reasoning in Latent Space. CoRR abs/1909.11851 (2019) - 2018
- [j1]Kshitij Bansal, Clark W. Barrett, Andrew Reynolds, Cesare Tinelli:
Reasoning with Finite Sets and Cardinality Constraints in SMT. Log. Methods Comput. Sci. 14(4) (2018) - [c7]Kshitij Bansal, Eric Koskinen, Omer Tripp:
Automatic Generation of Precise and Useful Commutativity Conditions. TACAS (1) 2018: 115-132 - [i4]Kshitij Bansal, Eric Koskinen, Omer Tripp:
Automatic Generation of Precise and Useful Commutativity Conditions (Extended Version). CoRR abs/1802.08748 (2018) - 2017
- [i3]Kshitij Bansal, Clark W. Barrett, Andrew Reynolds, Cesare Tinelli:
A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT. CoRR abs/1702.06259 (2017) - 2016
- [b1]Kshitij Bansal:
Decision Procedures for Finite Sets with Cardinality, and Local Theories Extensions. New York University, USA, 2016 - [c6]Kshitij Bansal, Andrew Reynolds, Clark W. Barrett, Cesare Tinelli:
A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT. IJCAR 2016: 82-98 - 2015
- [c5]Kshitij Bansal, Andrew Reynolds, Tim King, Clark W. Barrett, Thomas Wies:
Deciding Local Theory Extensions via E-matching. CAV (2) 2015: 87-105 - [i2]Kshitij Bansal, Andrew Reynolds, Tim King, Clark W. Barrett, Thomas Wies:
On Deciding Local Theory Extensions via E-matching. CoRR abs/1508.06827 (2015) - 2014
- [c4]Liana Hadarean, Kshitij Bansal, Dejan Jovanovic, Clark W. Barrett, Cesare Tinelli:
A Tale of Two Solvers: Eager and Lazy Approaches to Bit-Vectors. CAV 2014: 680-695 - 2013
- [c3]Kshitij Bansal, Stéphane Demri:
Model-Checking Bounded Multi-Pushdown Systems. CSR 2013: 405-417 - [c2]Kshitij Bansal, Eric Koskinen, Thomas Wies, Damien Zufferey:
Structural Counter Abstraction. TACAS 2013: 62-77 - 2012
- [i1]Kshitij Bansal, Stéphane Demri:
A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems. CoRR abs/1212.1485 (2012)
2000 – 2009
- 2009
- [c1]Kshitij Bansal, Rémi Brochenin, Étienne Lozes:
Beyond Shapes: Lists with Ordered Data. FoSSaCS 2009: 425-439
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-19 19:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
