An SMT Theory of Fixed-Point Arithmetic. | 1 | 0.36 | 2020 |
Towards Providing Low-Overhead Data Race Detection for Large OpenMP Applications | 5 | 0.50 | 2014 |
Hybrid learning: interface generation through static, dynamic, and symbolic analysis | 9 | 0.53 | 2013 |
Overcoming extreme-scale reproducibility challenges through a unified, targeted, and multilevel toolset | 4 | 0.41 | 2013 |
Practical formal correctness checking of million-core problem solving environments for HPC | 2 | 0.38 | 2013 |
Symbolic learning of component interfaces | 21 | 0.78 | 2012 |
Context-bounded translations for concurrent software: an empirical evaluation | 15 | 0.72 | 2010 |
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers | 38 | 1.77 | 2009 |
A low-level memory model and an accompanying reachability predicate | 5 | 0.46 | 2009 |
A Scalable Memory Model for Low-Level Code | 21 | 0.88 | 2009 |
Verifying heap-manipulating programs in an SMT framework | 14 | 0.61 | 2007 |