| Unreliable channels are easier to verify than perfect channels G Cécé, A Finkel, SP Iyer Information and computation 124 (1), 20-31, 1996 | 177 | 1996 |
| On synthesizing systolic arrays from recurrence equations with linear dependencies SV Rajopadhye, S Purushothaman, RM Fujimoto International Conference on Foundations of Software Technology and …, 1986 | 101 | 1986 |
| Analyzing network traffic to detect self-decrypting exploit code Q Zhang, DS Reeves, P Ning, SP Iyer Proceedings of the 2nd ACM symposium on Information, computer and …, 2007 | 96 | 2007 |
| A formal methods approach to medical device review R Jetley, SP Iyer, P Jones Computer 39 (4), 61-67, 2006 | 95 | 2006 |
| Data flow analysis of communicating finite state machines W Peng, S Puroshothaman ACM Transactions on Programming Languages and Systems (TOPLAS) 13 (3), 399-442, 1991 | 89 | 1991 |
| Optimality in abstractions of model checking R Cleaveland, P Iyer, D Yankelevich International Static Analysis Symposium, 51-63, 1995 | 86 | 1995 |
| Reasoning about complementary intrusion evidence Y Zhai, P Ning, P Iyer, DS Reeves 20th Annual Computer Security Applications Conference, 39-48, 2004 | 85 | 2004 |
| Probabilistic lossy channel systems P Iyer, M Narasimha Colloquium on Trees in Algebra and Programming, 667-681, 1997 | 65 | 1997 |
| Well-abstracted transition systems: Application to FIFO automata A Finkel, SP Iyer, G Sutre Information and Computation 181 (1), 1-31, 2003 | 54 | 2003 |
| Reasoning about probabilistic lossy channel systems P Abdulla, C Baier, P Iyer, B Jonsson International Conference on Concurrency Theory, 320-333, 2000 | 45 | 2000 |
| Probabilistic temporal logics via the modal mu-calculus R Cleaveland, SP Iyer, M Narasimha Theoretical Computer Science 342 (2-3), 316-350, 2005 | 42 | 2005 |
| Analysis of a class of communicating finite state machines W Peng, S Purushothaman Acta Informatica 29 (6), 499-522, 1992 | 35 | 1992 |
| An adequate operational semantics of sharing in lazy evaluation S Purushothaman, J Seaman European symposium on programming, 435-450, 1992 | 32 | 1992 |
| SAT-solving the coverability problem for Petri nets PA Abdulla, SP Iyer, A Nylén Formal Methods in System Design 24 (1), 25-43, 2004 | 30 | 2004 |
| Unfoldings of unbounded Petri nets PA Abdulla, SP Iyer, A Nylén International Conference on Computer Aided Verification, 495-507, 2000 | 30 | 2000 |
| Probabilistic temporal logics via the modal mu-calculus M Narasimha, R Cleaveland, P Iyer International Conference on Foundations of Software Science and Computation …, 1999 | 30 | 1999 |
| Reasoning about probabilistic behavior in concurrent systems S Purushothaman, PA Subrahmanyam IEEE transactions on software engineering, 740-745, 1987 | 29 | 1987 |
| C wolf-a toolset for extracting models from c programs DCD Varney, SP Iyer International Conference on Formal Techniques for Networked and Distributed …, 2002 | 23 | 2002 |
| Deadlock detection in communicating finite state machines by even reachability analysis W Peng Mobile Networks and Applications 2 (3), 251-257, 1997 | 23 | 1997 |
| An operational semantics of sharing in lazy evaluation J Seaman, SP Iyer Science of Computer Programming 27 (3), 289-322, 1996 | 23 | 1996 |
Rance CleavelandDepartment of Computer Science, University of MarylandGeverifieerd e-mailadres voor cs.umd.edu
