| Concurrent Kleene algebra and its foundations T Hoare, B Möller, G Struth, I Wehrman The Journal of Logic and Algebraic Programming 80 (6), 266-296, 2011 | 114 | 2011 |
| Concurrent kleene algebra CART Hoare, B Möller, G Struth, I Wehrman International Conference on Concurrency Theory, 399-414, 2009 | 83 | 2009 |
| A timed semantics of Orc I Wehrman, D Kitchin, WR Cook, J Misra Theoretical Computer Science 402 (2-3), 234-248, 2008 | 69 | 2008 |
| Slothrop: Knuth-Bendix completion with a modern termination checker I Wehrman, A Stump, E Westbrook International Conference on Rewriting Techniques and Applications, 287-296, 2006 | 50 | 2006 |
| A language-based approach to functionally correct imperative programming E Westbrook, A Stump, I Wehrman Proceedings of the tenth ACM SIGPLAN international conference on Functional …, 2005 | 48 | 2005 |
| Graphical models of separation logic I Wehrman, CAR Hoare, PW O'Hearn Information processing letters 109 (17), 1001-1004, 2009 | 32* | 2009 |
| Foundations of concurrent Kleene algebra CAR Hoare, B Möller, G Struth, I Wehrman International Conference on Relational Methods in Computer Science, 166-186, 2009 | 16 | 2009 |
| Mining propositional simplification proofs for small validating clauses I Wehrman, A Stump Electronic Notes in Theoretical Computer Science 144 (2), 79-91, 2006 | 14 | 2006 |
| A proposal for weak-memory local reasoning I Wehrman, J Berdine LOLA workshop 6, 2011 | 11 | 2011 |
| Properties of the timed operational and denotational semantics of Orc I Wehrman, D Kitchin, WR Cook, J Misra Computer Science Department, University of Texas at Austin, 2007 | 11 | 2007 |
| Byzantine fault tolerant execution of long-running distributed applications SL Pallemulle, I Wehrman, KJ Goldman Proceedings of the IASTED Parallel and Distributed Computing and Systems …, 2006 | 11 | 2006 |
| Extending Byzantine fault tolerance to replicated clients I Wehrman, SL Pallemulle, KJ Goldman | 3 | 2006 |
| Knuth-Bendix completion with modern termination checking IA Wehrman Washington University, 2006 | 2 | 2006 |
| Weak-memory local reasoning IA Wehrman | 1 | 2012 |
| Semantics and Syntax of a Weak-Memory Separation Logic: Sequential Fragment I Wehrman | | 2010 |
| Knuth-Bendix Completion with Modern Termination Checking, Master's Thesis, August 2006 I Wehrman | | 2006 |
| Property Types: Semantic Programming for Java A Stump, I Wehrman International Conference on Foundations of Object-Oriented Languages (FOOL/WOOD), 2006 | | 2006 |
| Contact, closure, topology, and the linking of row and column types of relations G. Schmidt and R. Berghammer 339 Normal forms in total correctness for while programs and … R Berghammer, AM Jaoua, B Möller, HH Dang, P Höfner, W Guttmann, ... | | |
| Knuth-Bendix Completion with a Termination Checker I Wehrman, A Stump, E Westbrook | | |
