Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2017. Model checking the evolution of gene regulatory networks. Acta Informatica. 54(8), 765–787.
LibreCat: https://research-explorer.ista.ac.at/record/1351
DOI: 10.1007/s00236-016-0278-x
WoS: 000414343200003

Daca P, Gupta A, Henzinger TA. 2016. Abstraction-driven concolic testing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 9583, 328–347.
LibreCat: https://research-explorer.ista.ac.at/record/1230
DOI: 10.1007/978-3-662-49122-5_16

Gupta A, Henzinger TA. 2015. Guest editors’ introduction to special issue on computational methods in systems biology. ACM Transactions on Modeling and Computer Simulation. 25(2), 7.
LibreCat: https://research-explorer.ista.ac.at/record/1808
DOI: 10.1145/2745799

Gupta A, Henzinger TA, Radhakrishna A, Samanta R, Tarrach T. 2015. Succinct representation of concurrent trace sets. POPL: Principles of Programming Languages, 433–444.
LibreCat: https://research-explorer.ista.ac.at/record/1992
DOI: 10.1145/2676726.2677008

Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2015. Model checking gene regulatory networks. 9035, 469–483.
LibreCat: https://research-explorer.ista.ac.at/record/1835
DOI: 10.1007/978-3-662-46681-0_47

Gupta A, Popeea C, Rybalchenko A. 2014. Generalised interpolation by solving recursion free-horn clauses. Electronic Proceedings in Theoretical Computer Science, EPTCS. HCVS: Horn Clauses for Verification and Synthesis, EPTCS, vol. 169, 31–38.
LibreCat: https://research-explorer.ista.ac.at/record/1702
DOI: 10.4204/EPTCS.169.5

Hofferek G, Gupta A. 2014. Suraq - a controller synthesis tool using uninterpreted functions. HVC 2014. HVC: Haifa Verification Conference, LNCS, vol. 8855, 68–74.
LibreCat: https://research-explorer.ista.ac.at/record/1869
DOI: 10.1007/978-3-319-13338-6_6

Gupta A, Kovács L, Kragl B, Voronkov A. 2014. Extensional crisis and proving identity. ATVA 2014. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 8837, 185–200.
LibreCat: https://research-explorer.ista.ac.at/record/1872
DOI: 10.1007/978-3-319-11936-6_14

Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple boolean functions using interpolation on a single proof. 2013 Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84.
LibreCat: https://research-explorer.ista.ac.at/record/1385
DOI: 10.1109/FMCAD.2013.6679394
arXiv: 1308.4767

Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire. 8312, 173–181.
LibreCat: https://research-explorer.ista.ac.at/record/2237
DOI: 10.1007/978-3-642-45221-5_13

Gupta A, Henzinger TA eds. 2013. Computational Methods in Systems Biology, Springer,p.
LibreCat: https://research-explorer.ista.ac.at/record/2288
DOI: 10.1007/978-3-642-40708-6

Dragoi C, Gupta A, Henzinger TA. 2013.Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: Computer Aided Verification. vol. 8044, 174–190.
LibreCat: https://research-explorer.ista.ac.at/record/5747
DOI: 10.1007/978-3-642-39799-8_11

Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. 2012. Delayed continuous time Markov chains for genetic regulatory circuits. CAV: Computer Aided Verification, LNCS, vol. 7358, 294–309.
LibreCat: https://research-explorer.ista.ac.at/record/3136
DOI: 10.1007/978-3-642-31424-7_24

Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.
LibreCat: https://research-explorer.ista.ac.at/record/10906
DOI: 10.1007/978-3-642-28756-5_46

Gupta A, Popeea C, Rybalchenko A. 2011. Solving recursion-free Horn clauses over LI+UIF. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 7078, 188–203.
LibreCat: https://research-explorer.ista.ac.at/record/3264
DOI: 10.1007/978-3-642-25318-8_16

Gupta A, Henzinger TA, Majumdar R, Rybalchenko A, Xu R. 2008. Proving non-termination. POPL: Principles of Programming Languages, 147–158.
LibreCat: https://research-explorer.ista.ac.at/record/4521
DOI: 10.1145/1328438.1328459