S. Purushothaman Iyer
S. Purushothaman Iyer
ARO (Network Science) and NCSU (Compuer Science)
Verified email at ncsu.edu - Homepage
Title
Cited by
Cited by
Year
Unreliable channels are easier to verify than perfect channels
G Cécé, A Finkel, SP Iyer
Information and Computation 124 (1), 20-31, 1996
1691996
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
941986
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
922007
A formal methods approach to medical device review
R Jetley, SP Iyer, P Jones
Computer 39 (4), 61-67, 2006
912006
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
841991
Optimality in abstractions of model checking
R Cleaveland, P Iyer, D Yankelevich
International Static Analysis Symposium, 51-63, 1995
821995
Reasoning about complementary intrusion evidence
Y Zhai, P Ning, P Iyer, DS Reeves
20th Annual Computer Security Applications Conference, 39-48, 2004
812004
Probabilistic lossy channel systems
P Iyer, M Narasimha
Colloquium on Trees in Algebra and Programming, 667-681, 1997
601997
Well-abstracted transition systems: Application to FIFO automata
A Finkel, SP Iyer, G Sutre
Information and Computation 181 (1), 1-31, 2003
552003
Reasoning about probabilistic lossy channel systems
P Abdulla, C Baier, P Iyer, B Jonsson
International Conference on Concurrency Theory, 320-333, 2000
402000
Probabilistic temporal logics via the modal mu-calculus
R Cleaveland, SP Iyer, M Narasimha
Theoretical Computer Science 342 (2-3), 316-350, 2005
372005
Analysis of a class of communicating finite state machines
W Peng, S Purushothaman
Acta Informatica 29 (6-7), 499-522, 1992
341992
An adequate operational semantics of sharing in lazy evaluation
S Purushothaman, J Seaman
European symposium on programming, 435-450, 1992
331992
Unfoldings of unbounded Petri nets
PA Abdulla, SP Iyer, A Nylén
International Conference on Computer Aided Verification, 495-507, 2000
292000
Probabilistic temporal logics via the modal mu-calculus
M Narasimha, R Cleaveland, P Iyer
International Conference on Foundations of Software Science and Computation …, 1999
271999
Reasoning about probabilistic behavior in concurrent systems
S Purushothaman, PA Subrahmanyam
IEEE transactions on software engineering, 740-745, 1987
261987
An operational semantics of sharing in lazy evaluation
J Seaman, SP Iyer
Science of Computer Programming 27 (3), 289-322, 1996
231996
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
222004
Deadlock detection in communicating finite state machines by even reachability analysis
W Peng
Mobile Networks and Applications 2 (3), 251-257, 1997
221997
A compositional analysis of evaluation-order and its application
M Draghicescu, S Purushothaman
Proceedings of the 1990 ACM conference on LISP and functional programming …, 1990
221990
The system can't perform the operation now. Try again later.
Articles 1–20