|Present||Assistant Professor, Boise State University ‐ Department of Computer Science|
Honors and Awards
- 2011 - "Preparing Future Faculty" Program, University of Nebraska-Lincoln
- 2011 - "SAT/SMT Summer School", MIT, Cambridge
- 2010 - "Marktoberdorf Summer School" Program, Germany
Deciding Type-Based Partial-Order Constraints for Path-Sensitive Analysis
ACM Transactions on Software Engineering and Methodology (2015)
The precision and scalability of path-sensitive program analyses depend on their ability to distinguish feasible and infeasible program paths. Analyses ...
Conference Proceedings (4)
Contribution to Book
Exploiting Domain and Program Structure to Synthesize Efficient and Precise ...
Proceedings: 2015 30th IEEE/ACM International Conference on Automated Software Engineering (2015)
A key challenge in implementing an efficient and precise1 data flow analysis is determining how to abstract the domain of ...
Evaluation of String Constraint Solvers in the Context of Symbolic ...
ASE '14 Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering (2014)
Symbolic execution tools query constraint solvers for tasks such as determining the feasibility of program paths. Therefore, the effectiveness of ...
A Slice-Based Decision Procedure for Type-Based Partial Orders
Lecture Notes in Computer Science (Proceedings of IJCAR) (2010)
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. ...
Saturation-Based Testing of Concurrent Programs
ESEC/FSE '09: Proceedings of the the 7th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (2009)
Coverage measures help to determine whether a test suite exercises a program adequately according to a testing criterion. Many existing ...