| Probabilistic program analysis with martingales A Chakarov, S Sankaranarayanan International Conference on Computer Aided Verification, 511-526, 2013 | 148 | 2013 |
| Static analysis for probabilistic programs: inferring whole program properties from finitely many paths S Sankaranarayanan, A Chakarov, S Gulwani Proceedings of the 34th ACM SIGPLAN conference on Programming language …, 2013 | 131 | 2013 |
| Debugging machine learning tasks A Chakarov, A Nori, S Rajamani, S Sen, D Vijaykeerthy arXiv preprint arXiv:1603.07292, 2016 | 45 | 2016 |
| Expectation invariants for probabilistic program loops as fixed points A Chakarov, S Sankaranarayanan International Static Analysis Symposium, 85-100, 2014 | 44 | 2014 |
| Uncertainty propagation using probabilistic affine forms and concentration of measure inequalities O Bouissou, E Goubault, S Putot, A Chakarov, S Sankaranarayanan International Conference on Tools and Algorithms for the Construction and …, 2016 | 27 | 2016 |
| Deductive proofs of almost sure persistence and recurrence properties A Chakarov, YL Voronin, S Sankaranarayanan International Conference on Tools and Algorithms for the Construction and …, 2016 | 20 | 2016 |
| Exploring the internal state of user interfaces by combining computer vision techniques with grammatical inference P Givens, A Chakarov, S Sankaranarayanan, T Yeh 2013 35th International Conference on Software Engineering (ICSE), 1165-1168, 2013 | 15 | 2013 |
| Combining time and frequency domain specifications for periodic signals A Chakarov, S Sankaranarayanan, G Fainekos International Conference on Runtime Verification, 294-309, 2011 | 13 | 2011 |
| Deductive verification of infinite-state stochastic systems using martingales AN Chakarov University of Colorado at Boulder, 2016 | 5 | 2016 |
| Expectation invariants as fixed points of probabilistic programs A Chakarov, S Sankaranarayanan Static Analysis Symposium (SAS). Lecture Notes in Computer Science 8723, 85-100, 2014 | 5 | 2014 |
| Constructing partial words with subword complexities not achievable by full words F Blanchet-Sadri, A Chakarov, L Manuelli, J Schwartz, S Stich Theoretical Computer Science 432, 21-27, 2012 | 4 | 2012 |
| Towards JARVIS for software engineering: lessons learned in implementing a natural language chat interface R Pandita, S Bucuvalas, H Bergier, A Chakarov, E Richards Workshops at the Thirty-Second AAAI Conference on Artificial Intelligence, 2018 | 3 | 2018 |
| Tricolorable torus knots are NP-complete P Golbus, RW McGrail, T Przytycki, M Sharac, A Chakarov Proceedings of the 47th Annual Southeast Regional Conference, 1-6, 2009 | 3 | 2009 |
| Contemporary COBOL: developers' perspectives on defects and defect location A Ciborowska, A Chakarov, R Pandita 2021 IEEE International Conference on Software Maintenance and Evolution …, 2021 | 2 | 2021 |
| Minimum number of holes in unavoidable sets of partial words of size three F Blanchet-Sadri, B Chen, A Chakarov International Workshop on Combinatorial Algorithms, 43-55, 2010 | 2 | 2010 |
| Abstracting event-driven systems with lifestate rules S Meier, A Chakarov, M Russek, S Mover, BYE Chang arXiv preprint arXiv:1701.00161, 2016 | 1 | 2016 |
| Number of holes in unavoidable sets of partial words I F Blanchet-Sadri, B Chen, A Chakarov Journal of Discrete Algorithms 14, 55-64, 2012 | 1 | 2012 |
| Recurrent partial words F Blanchet-Sadri, A Chakarov, L Manuelli, J Schwartz, S Stich arXiv preprint arXiv:1108.3623, 2011 | 1 | 2011 |
| Better Counterexamples for Dafny A Chakarov, A Fedchin, Z Rakamarić, N Rungta International Conference on Tools and Algorithms for the Construction and …, 2022 | | 2022 |
| Recurrent Partial Words and Representable Sets. F Blanchet-Sadri, A Chakarov, B Chen, L Manuelli, S Munteanu, ... J. Autom. Lang. Comb. 21 (3), 149-181, 2016 | | 2016 |
Sriram SankaranarayananProfessor of Computer Science, University of Colorado, BoulderVerified email at colorado.edu
