default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmitabha Sanyal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c15]Aman Bansal
, Saksham Goel, Preey Shah, Amitabha Sanyal, Prasanna Kumar:
Garbage collection using a finite liveness domain. ISMM 2020: 1-15
2010 – 2019
- 2019
- [c14]Prasanna Kumar K., Amitabha Sanyal, Amey Karkare, Saswat Padhi:
A static slicing method for functional programs and its incremental version. CC 2019: 53-64 - 2018
- [c13]Shantanu Thakoor, Simoni Shah, Ganesh Ramakrishnan, Amitabha Sanyal:
Synthesis of Programs from Multimodal Datasets. AAAI 2018: 184-191 - [c12]Shrawan Kumar, Amitabha Sanyal, R. Venkatesh, Punit Shah:
Property Checking Array Programs Using Loop Shrinking. TACAS (1) 2018: 213-231 - 2017
- [i8]Prasanna Kumar K., Amitabha Sanyal, Amey Karkare:
An Incremental Slicing Method for Functional Programs. CoRR abs/1709.08016 (2017) - 2016
- [c11]Prasanna Kumar K., Amitabha Sanyal, Amey Karkare:
Liveness-based garbage collection for lazy languages. ISMM 2016: 122-133 - [i7]Prasanna Kumar K., Amitabha Sanyal, Amey Karkare:
Liveness-Based Garbage Collection for Lazy Languages. CoRR abs/1604.05841 (2016) - 2015
- [c10]Shrawan Kumar, Amitabha Sanyal, Uday P. Khedker:
Value Slice: A New Slicing Concept for Scalable Property Checking. TACAS 2015: 101-115 - 2014
- [c9]Rahul Asati, Amitabha Sanyal, Amey Karkare, Alan Mycroft:
Liveness-Based Garbage Collection. CC 2014: 85-106 - [i6]Shrawan Kumar, Amitabha Sanyal, Uday P. Khedker:
Sliced Slices: Separating Data and Control Influences. CoRR abs/1407.4917 (2014) - 2012
- [i5]Aditya Kanade, Amitabha Sanyal, Uday P. Khedker:
A Logic for Correlating Temporal Properties across Program Transformations. CoRR abs/1209.5152 (2012)
2000 – 2009
- 2009
- [b1]Uday P. Khedker, Amitabha Sanyal, Bageshri Sathe:
Data Flow Analysis - Theory and Practice. CRC Press 2009, ISBN 978-0-8493-2880-0, pp. I-XIII, 1-386 - [j6]Aditya Kanade, Amitabha Sanyal, Uday P. Khedker:
Validation of GCC optimizers through trace generation. Softw. Pract. Exp. 39(6): 611-639 (2009) - 2007
- [j5]Uday P. Khedker, Amitabha Sanyal, Amey Karkare:
Heap reference analysis using access graphs. ACM Trans. Program. Lang. Syst. 30(1): 1 (2007) - [p1]Amitabha Sanyal, Uday P. Khedker:
Garbage Collection Techniques. The Compiler Design Handbook, 2nd ed. 2007: 6 - [i4]Amey Karkare, Amitabha Sanyal, Uday P. Khedker:
Heap Reference Analysis for Functional Programs. CoRR abs/0710.1482 (2007) - [i3]Amey Karkare, Uday P. Khedker, Amitabha Sanyal:
Liveness of Heap Data for Functional Programs. CoRR abs/cs/0703155 (2007) - 2006
- [c8]Aditya Kanade, Amitabha Sanyal, Uday P. Khedker:
A PVS Based Framework for Validating Compiler Optimizations. SEFM 2006: 108-117 - [c7]Aditya Kanade, Amitabha Sanyal, Uday P. Khedker:
Structuring Optimizing Transformations and Proving Them Sound. COCV@ETAPS 2006: 79-95 - [i2]Uday P. Khedker, Amitabha Sanyal, Amey Karkare:
Heap Reference Analysis Using Access Graphs. CoRR abs/cs/0608104 (2006) - [i1]Amey Karkare, Amitabha Sanyal, Uday P. Khedker:
Effectiveness of Garbage Collection in MIT/GNU Scheme. CoRR abs/cs/0611093 (2006) - 2005
- [c6]Aditya Kanade, Uday P. Khedker, Amitabha Sanyal:
Heterogeneous Fixed Points with Application to Points-To Analysis. APLAS 2005: 298-314
1990 – 1999
- 1999
- [j4]Mangala Gowri Nanda, Purandar Bhaduri, Sundeep Oberoi, Amitabha Sanyal:
An Application of Compiler Technology to the Year 2000 Problem. Softw. Pract. Exp. 29(4): 359-377 (1999) - 1998
- [j3]Manoranjan Satpathy, Amitabha Sanyal, G. Venkatesh:
Improved Register Usage for Functional Programs through Multiple Function Versions. J. Funct. Log. Program. 1998(7) (1998) - 1997
- [j2]S. Ramesh Babu, Amitabha Sanyal, G. Venkatesh:
Proof of Correctness of a Direct Construction of DFA from Regular Expression. Int. J. Comput. Math. 64(3-4): 191-210 (1997) - 1996
- [c5]Milind Gandhe, G. Venkatesh, Amitabha Sanyal:
Correcting Errors in the Curry System. FSTTCS 1996: 347-358 - 1995
- [j1]Ajay Sethi, Supratim Biswas, Amitabha Sanyal:
Extensions to Cycle Shrinking. Int. J. High Speed Comput. 7(2): 265-284 (1995) - [c4]Manoranjan Satpathy, Amitabha Sanyal, G. Venkatesh:
An Automaton-Driven Frame Disposal Algorithm and its Proof of Correctness. ASIAN 1995: 88-102 - [c3]Milind Gandhe, G. Venkatesh, Amitabha Sanyal:
Labeled Lambda-Calculus and a Generalized Notion of Strictness (An Extended Abstract). ASIAN 1995: 103-110 - 1991
- [c2]Supratim Biswas, Amitabha Sanyal, L. M. Tewari:
Extended Cycle Shrinking: A Restructuring Method for Parallel Compilation. ICCI 1991: 462-470
1980 – 1989
- 1987
- [c1]Amitabha Sanyal, Supratim Biswas, Vishv M. Malhotra:
Extension of Weakest Precondition Formalism to a Low Level Language. FSTTCS 1987: 485-499
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-04-25 05:49 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:
