# Shuvendu K. Lahiri, Ph.D. - Publications

## Affiliations: | 2004 | Carnegie Mellon University, Pittsburgh, PA |

##### Area:

Computer Science, Electronics and Electrical EngineeringYear | Citation | Score | |||
---|---|---|---|---|---|

2016 | He S, Lahiri SK, Rakamarić Z. Verifying relative safety, accuracy, and termination for program approximations Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9690: 237-254. DOI: 10.1007/978-3-319-40648-0_19 |
1 | |||

2013 | Blackshear S, Lahiri SK. Almost-correct specifications a modular semantic framework for assigning confidence to warnings Acm Sigplan Notices. 48: 209-218. DOI: 10.1145/2499370.2462188 |
1 | |||

2013 | Lahiri SK, McMillan KL, Sharma R, Hawblitzel C. Differential assertion checking 2013 9th Joint Meeting of the European Software Engineering Conference and the Acm Sigsoft Symposium On the Foundations of Software Engineering, Esec/Fse 2013 - Proceedings. 345-355. DOI: 10.1145/2491411.2491452 |
1 | |||

2013 | Blackshear S, Lahiri SK. Almost-correct specifications: A modular semantic framework for assigning confidence to warnings Proceedings of the Acm Sigplan Conference On Programming Language Design and Implementation (Pldi). 209-218. DOI: 10.1145/2462156.2462188 |
1 | |||

2013 | Vanegue J, Lahiri SK. Towards practical reactive security audit using extended static checkers Proceedings - Ieee Symposium On Security and Privacy. 33-47. DOI: 10.1109/SP.2013.12 |
1 | |||

2013 | Hawblitzel C, Kawaguchi M, Lahiri SK, Rebêlo H. Towards modularly comparing programs using automated theorem provers Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7898: 282-299. DOI: 10.1007/978-3-642-38574-2_20 |
1 | |||

2012 | Joshi S, Lahiri SK, Lal A. Underspecified harnesses and interleaved bugs Conference Record of the Annual Acm Symposium On Principles of Programming Languages. 19-30. DOI: 10.1145/2103656.2103662 |
1 | |||

2012 | Godefroid P, Lahiri SK. From program to logic: An introduction Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7682: 31-44. DOI: 10.1007/978-3-642-35746-6_2 |
1 | |||

2012 | Lahiri SK, Hawblitzel C, Kawaguchi M, Rebêlo H. SYMDIFF: A language-agnostic semantic diff tool for imperative programs |
1 | |||

2012 | Lal A, Qadeer S, Lahiri SK. A solver for reachability modulo theories |
1 | |||

2011 | Lahiri SK, Qadeer S, Walker D. Linear maps Plpv'11 - Proceedings of the 5th Acm Workshop On Programming Languages Meets Program Verification. 3-14. DOI: 10.1145/1929529.1929531 |
1 | |||

2011 | Godefroid P, Lahiri SK, Rubio-González C. Statically validating must summaries for incremental compositional dynamic test generation |
1 | |||

2011 | Lahiri SK. SMT-based modular analysis of sequential systems code |
1 | |||

2011 | Lahiri SK, Qadeer S. Call invariants |
1 | |||

2011 | Lahiri SK, Vanegue J. ExplainHoudini: Making Houdini inference transparent |
1 | |||

2010 | Lahiri SK, Malkis A, Qadeer S. Abstract threads |
1 | |||

2009 | Lahiri SK, Qadeer S. Complexity and algorithms for monomial and clausal predicate abstraction |
1 | |||

2009 | Lahiri SK, Qadeer S, Rakamarić Z. Static and precise detection of concurrency errors in systems code using SMT solvers |
1 | |||

2008 | Lahiri SK, Qadeer S. Back to the future: Revisiting precise program verification using SMT solvers Conference Record of the Annual Acm Symposium On Principles of Programming Languages. 171-182. DOI: 10.1145/1328438.1328461 |
1 | |||

2008 | Lahiri SK, Qadeer S. Back to the future revisiting precise program verification using SMT solvers Acm Sigplan Notices. 43: 171-182. |
1 | |||

2007 | Lahiri SK, Bryant RE. Predicate abstraction with indexed predicates Acm Transactions On Computational Logic. 9. DOI: 10.1145/1297658.1297662 |
1 | |||

2007 | Chatterjee S, Lahiri SK, Qadeer S, Rakamarić Z. A reachability predicate for analyzing low-level software |
1 | |||

2006 | Lahiri SK, Qadeer S. Verifying properties of well-founded linked lists Conference Record of the Annual Acm Symposium On Principles of Programming Languages. 115-126. DOI: 10.1145/1111320.1111048 |
1 | |||

2006 | Lahiri SK, Musuvathi M. An efficient Nelson-Oppen decision procedure for difference constraints over rationals Electronic Notes in Theoretical Computer Science. 144: 27-41. DOI: 10.1016/j.entcs.2005.12.004 |
1 | |||

2006 | Lahiri SK, Nieuwenhuis R, Oliveras A. SMT techniques for fast predicate abstraction |
1 | |||

2006 | Lahiri SK, Musuvathi M. Solving sparse linear constraints |
1 | |||

2005 | Ball T, Lahiri SK, Musuvathi M. Zap: Automated theorem proving for software analysis |
1 | |||

2005 | Lahiri SK, Musuvathi M. An efficient decision procedure for UTVPI constraints |
1 | |||

2004 | Lahiri SK, Seshia SA. The UCLID decision procedure |
1 | |||

2004 | Lahiri SK, Bryant RE. Indexed predicate discovery for unbounded system verification |
1 | |||

2004 | Lahiri SK, Bryant RE. Constructing quantified invariants via predicate abstraction |
1 | |||

2004 | Ball T, Cook B, Lahiri SK, Zhang L. ZAPATO: Automatic theorem proving for predicate abstraction refinement |
1 | |||

2003 | Lahiri SK, Bryant RE. Deductive verification of advanced out-of-order microprocessors |
1 | |||

Show low-probability matches. |