![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Ashutosh Gupta 0001
Person information
- affiliation: IT Bombay, Department of Computer Science and Engineering, Mumbai, India
- affiliation: IST, Austria
- affiliation: MPI for Software Systems, Saarbrücken, Germany
- affiliation (PhD 2011): TU Munich, Department of Informatics, Germany
Other persons with the same name
- Ashutosh Gupta — disambiguation page
- Ashutosh Gupta 0002
— Amity University, School of Engineering and Technology, Noida, India
- Ashutosh Gupta 0003
— U. P. Rajarshi Tandon Open University Prayagraj, Allahabad, India (and 2 more)
- Ashutosh Kumar Gupta 0002 — Udai Pratap Autonomous College, India
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c21]Mohammad Afzal
, Ashutosh Gupta
, S. Akshay
:
Using Counterexamples to Improve Robustness Verification in Neural Networks. ATVA (1) 2023: 422-443 - 2022
- [j4]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Full-program induction: verifying array programs sans loop invariants. Int. J. Softw. Tools Technol. Transf. 24(5): 843-888 (2022) - [i7]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Full-Program Induction: Verifying Array Programs sans Loop Invariants. CoRR abs/2209.12456 (2022) - 2021
- [c20]Supratik Chakraborty
, Ashutosh Gupta, Divyesh Unadkat
:
Diffy: Inductive Reasoning of Array Programs Using Difference Invariants. CAV (2) 2021: 911-935 - [i6]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Diffy: Inductive Reasoning of Array Programs using Difference Invariants. CoRR abs/2105.14748 (2021) - 2020
- [c19]Supratik Chakraborty
, Ashutosh Gupta, Divyesh Unadkat
:
Verifying Array Manipulating Programs with Full-Program Induction. TACAS (1) 2020: 22-39 - [c18]Mohammad Afzal, Supratik Chakraborty
, Avriti Chauhan, Bharti Chimdyalwar, Priyanka Darke, Ashutosh Gupta, Shrawan Kumar, Charles Babu M, Divyesh Unadkat
, R. Venkatesh:
VeriAbs : Verification by Abstraction and Test Generation (Competition Contribution). TACAS (2) 2020: 383-387 - [i5]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Verifying Array Manipulating Programs with Full-Program Induction. CoRR abs/2002.09857 (2020)
2010 – 2019
- 2017
- [j3]Mirco Giacobbe
, Calin C. Guet, Ashutosh Gupta, Thomas A. Henzinger, Tiago Paixão
, Tatjana Petrov
:
Model checking the evolution of gene regulatory networks. Acta Informatica 54(8): 765-787 (2017) - [c17]Supratik Chakraborty
, Ashutosh Gupta, Divyesh Unadkat
:
Verifying Array Manipulating Programs by Tiling. SAS 2017: 428-449 - [c16]Supratik Chakraborty
, Ashutosh Gupta, Rahul Jain
:
Matching Multiplications in Bit-Vector Formulas. VMCAI 2017: 131-150 - [i4]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Verifying Array Manipulating Programs by Tiling. CoRR abs/1707.03555 (2017) - 2016
- [c15]Przemyslaw Daca, Ashutosh Gupta, Thomas A. Henzinger:
Abstraction-driven Concolic Testing. VMCAI 2016: 328-347 - [i3]Supratik Chakraborty, Ashutosh Gupta, Rahul Jain:
Matching Multiplications in Bit-Vector Formulas. CoRR abs/1611.10146 (2016) - 2015
- [j2]Ashutosh Gupta, Thomas A. Henzinger:
Guest Editors' Introduction to Special Issue on Computational Methods in Systems Biology. ACM Trans. Model. Comput. Simul. 25(2): 7:1-7:2 (2015) - [c14]Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakrishna
, Roopsha Samanta, Thorsten Tarrach:
Succinct Representation of Concurrent Trace Sets. POPL 2015: 433-444 - [c13]Mirco Giacobbe
, Calin C. Guet, Ashutosh Gupta, Thomas A. Henzinger, Tiago Paixão
, Tatjana Petrov
:
Model Checking Gene Regulatory Networks. TACAS 2015: 469-483 - [i2]Przemyslaw Daca, Ashutosh Gupta, Thomas A. Henzinger:
Abstraction-driven Concolic Testing. CoRR abs/1511.02615 (2015) - 2014
- [c12]Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko:
Generalised Interpolation by Solving Recursion-Free Horn Clauses. HCVS 2014: 31-38 - [i1]Mirco Giacobbe, Calin C. Guet, Ashutosh Gupta, Thomas A. Henzinger, Tiago Paixão, Tatjana Petrov:
Model Checking Gene Regulatory Networks. CoRR abs/1410.7704 (2014) - 2013
- [j1]Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko:
From tests to proofs. Int. J. Softw. Tools Technol. Transf. 15(4): 291-303 (2013) - [c11]Cezara Dragoi, Ashutosh Gupta, Thomas A. Henzinger:
Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. CAV 2013: 174-190 - [e1]Ashutosh Gupta, Thomas A. Henzinger:
Computational Methods in Systems Biology - 11th International Conference, CMSB 2013, Klosterneuburg, Austria, September 22-24, 2013. Proceedings. Lecture Notes in Computer Science 8130, Springer 2013, ISBN 978-3-642-40707-9 [contents] - 2012
- [c10]Calin C. Guet, Ashutosh Gupta, Thomas A. Henzinger, Maria Mateescu, Ali Sezgin:
Delayed Continuous-Time Markov Chains for Genetic Regulatory Circuits. CAV 2012: 294-309 - [c9]Sergey Grebenshchikov, Ashutosh Gupta, Nuno P. Lopes
, Corneliu Popeea, Andrey Rybalchenko:
HSF(C): A Software Verifier Based on Horn Clauses - (Competition Contribution). TACAS 2012: 549-551 - 2011
- [b1]Ashutosh Kumar Gupta:
Constraint solving for verification. Technical University Munich, 2011, pp. 1-98 - [c8]Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko:
Solving Recursion-Free Horn Clauses over LI+UIF. APLAS 2011: 188-203 - [c7]Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko:
Threader: A Constraint-Based Verifier for Multi-threaded Programs. CAV 2011: 412-417 - [c6]Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko:
Predicate abstraction and refinement for verifying multi-threaded programs. POPL 2011: 331-344 - 2010
- [c5]Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko:
Non-monotonic Refinement of Control Abstraction for Concurrent Programs. ATVA 2010: 188-202
2000 – 2009
- 2009
- [c4]Ashutosh Gupta, Andrey Rybalchenko:
InvGen: An Efficient Invariant Generator. CAV 2009: 634-640 - [c3]Byron Cook, Ashutosh Gupta, Stephen Magill, Andrey Rybalchenko, Jirí Simsa, Satnam Singh, Viktor Vafeiadis
:
Finding heap-bounds for hardware synthesis. FMCAD 2009: 205-212 - [c2]Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko:
From Tests to Proofs. TACAS 2009: 262-276 - 2008
- [c1]Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko, Ru-Gang Xu:
Proving non-termination. POPL 2008: 147-158
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint