Suivre
S. Purushothaman Iyer
S. Purushothaman Iyer
ARO (Network Science) and NCSU (Compuer Science)
Adresse e-mail validée de ncsu.edu - Page d'accueil
Titre
Citée par
Citée par
Année
Unreliable channels are easier to verify than perfect channels
G Cécé, A Finkel, SP Iyer
Information and computation 124 (1), 20-31, 1996
1771996
On synthesizing systolic arrays from recurrence equations with linear dependencies
SV Rajopadhye, S Purushothaman, RM Fujimoto
Foundations of Software Technology and Theoretical Computer Science: Sixth …, 1986
1061986
A formal methods approach to medical device review
R Jetley, SP Iyer, P Jones
Computer 39 (4), 61-67, 2006
972006
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
962007
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
931991
Optimality in abstractions of model checking
R Cleaveland, P Iyer, D Yankelevich
Static Analysis: Second International Symposium, SAS'95 Glasgow, UK …, 1995
891995
Reasoning about complementary intrusion evidence
Y Zhai, P Ning, P Iyer, DS Reeves
20th Annual Computer Security Applications Conference, 39-48, 2004
862004
Probabilistic lossy channel systems
P Iyer, M Narasimha
TAPSOFT'97: Theory and Practice of Software Development: 7th International …, 1997
671997
Well-abstracted transition systems: Application to FIFO automata
A Finkel, SP Iyer, G Sutre
Information and Computation 181 (1), 1-31, 2003
542003
Reasoning about probabilistic lossy channel systems
P Abdulla, C Baier, P Iyer, B Jonsson
CONCUR 2000—Concurrency Theory: 11th International Conference University …, 2000
462000
Probabilistic temporal logics via the modal mu-calculus
R Cleaveland, SP Iyer, M Narasimha
Theoretical Computer Science 342 (2-3), 316-350, 2005
452005
Analysis of a class of communicating finite state machines
W Peng, S Purushothaman
Acta Informatica 29 (6-7), 499-522, 1992
371992
An adequate operational semantics of sharing in lazy evaluation
S Purushothaman, J Seaman
ESOP'92: 4th European Symposium on Programming Rennes, France, February 26 …, 1992
321992
SAT-solving the coverability problem for Petri nets
PA Abdulla, SP Iyer, A Nylén
Formal Methods in System Design 24, 25-43, 2004
312004
Unfoldings of unbounded Petri nets
PA Abdulla, SP Iyer, A Nylén
Computer Aided Verification: 12th International Conference, CAV 2000 …, 2000
312000
Probabilistic temporal logics via the modal mu-calculus
M Narasimha, R Cleaveland, P Iyer
Lecture notes in computer science 1578, 288-305, 1999
301999
Reasoning about probabilistic behavior in concurrent systems
S Purushothaman, PA Subrahmanyam
IEEE transactions on software engineering, 740-745, 1987
281987
C wolf-a toolset for extracting models from c programs
DC Du Varney, S Purushothaman Iyer
Formal Techniques for Networked and Distributed Sytems—FORTE 2002: 22nd …, 2002
232002
Deadlock detection in communicating finite state machines by even reachability analysis
W Peng
Mobile Networks and Applications 2, 251-257, 1997
231997
An operational semantics of sharing in lazy evaluation
J Seaman, SP Iyer
Science of Computer Programming 27 (3), 289-322, 1996
231996
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20