S. Purushothaman Iyer

Citado por

	Total	Desde 2020
Citas	1570	143
Índice h	21	7
Índice i10	34	4

198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420256 14 11 21 23 26 32 25 46 42 44 47 39 40 38 42 53 62 74 83 72 73 51 48 55 72 52 40 54 35 48 35 20 39 29 30 20 5

Coautores

Rance CleavelandDepartment of Computer Science, University of MarylandDirección de correo verificada de cs.umd.edu
Raoul JetleyABB Corporate ResearchDirección de correo verificada de alumni.ncsu.edu
Parosh AbdullaProfessor of Computer Science, Uppsala UniversityDirección de correo verificada de it.uu.se
Paul L. JonesU.S. Food and Drug AdministrationDirección de correo verificada de fda.hhs.gov
Christel BaierTU DresdenDirección de correo verificada de tu-dresden.de
Douglas ReevesProfessor of Computer Science, N.C. State UniversityDirección de correo verificada de ncsu.edu
Peng NingGoogleDirección de correo verificada de google.com
Grégoire SutreResearch Fellow, CNRS, University of BordeauxDirección de correo verificada de labri.fr
Bengt JonssonProfessor of Computer Systems, Uppsala UniversityDirección de correo verificada de it.uu.se
Aletta NylénUppsala UniversityDirección de correo verificada de it.uu.se
Cohan Sujay CarlosResearcher, Natural Language Processing, Aiaioo LabsDirección de correo verificada de aiaioo.com
James RielyProfessor of Computing, DePaul UniversityDirección de correo verificada de cs.depaul.edu
Jan F. PrinsProfessor of Computer Science, UNC Chapel HillDirección de correo verificada de cs.unc.edu
Yu LeiUniversity of Texas at ArlingtonDirección de correo verificada de cse.uta.edu
Deepti R. BathulaAssociate Professor, Indian Institute of Technology RoparDirección de correo verificada de iitrpr.ac.in

Seguir

S. Purushothaman Iyer

ARO (Network Science) and NCSU (Compuer Science)

Dirección de correo verificada de ncsu.edu - Página principal

Formal Methods Network Science


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Unreliable channels are easier to verify than perfect channels G Cécé, A Finkel, SP Iyer Information and Computation 124 (1), 20-31, 1996	178	1996
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	119	1986
A formal methods approach to medical device review R Jetley, SP Iyer, P Jones Computer 39 (4), 61-67, 2006	111	2006
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	98	2007
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	93	1991
Optimality in abstractions of model checking R Cleaveland, P Iyer, D Yankelevich Static Analysis: Second International Symposium, SAS'95 Glasgow, UK …, 1995	88	1995
Reasoning about complementary intrusion evidence Y Zhai, P Ning, P Iyer, DS Reeves 20th Annual Computer Security Applications Conference, 39-48, 2004	87	2004
Probabilistic lossy channel systems P Iyer, M Narasimha Colloquium on Trees in Algebra and Programming, 667-681, 1997	70	1997
Well-abstracted transition systems: Application to FIFO automata A Finkel, SP Iyer, G Sutre Information and Computation 181 (1), 1-31, 2003	55	2003
Reasoning about probabilistic lossy channel systems P Abdulla, C Baier, P Iyer, B Jonsson CONCUR 2000—Concurrency Theory: 11th International Conference University …, 2000	52	2000
Probabilistic temporal logics via the modal mu-calculus R Cleaveland, SP Iyer, M Narasimha Theoretical Computer Science 342 (2-3), 316-350, 2005	50	2005
Analysis of a class of communicating finite state machines W Peng, S Purushothaman Acta Informatica 29 (6), 499-522, 1992	42	1992
Unfoldings of unbounded Petri nets PA Abdulla, SP Iyer, A Nylén Computer Aided Verification: 12th International Conference, CAV 2000 …, 2000	34	2000
Probabilistic temporal logics via the modal mu-calculus M Narasimha, R Cleaveland, P Iyer Foundations of Software Science and Computation Structures: Second …, 1999	31	1999
An adequate operational semantics of sharing in lazy evaluation S Purushothaman, J Seaman European symposium on programming, 435-450, 1992	31	1992
Reasoning about probabilistic behavior in concurrent systems S Purushothaman, PA Subrahmanyam IEEE transactions on software engineering, 740-745, 1987	30	1987
An operational semantics of sharing in lazy evaluation J Seaman, SP Iyer Science of Computer Programming 27 (3), 289-322, 1996	29	1996
SAT-solving the coverability problem for Petri nets PA Abdulla, SP Iyer, A Nylén Formal Methods in System Design 24, 25-43, 2004	28	2004
Deadlock detection in communicating finite state machines by even reachability analysis W Peng Mobile Networks and Applications 2, 251-257, 1997	26	1997
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	22	2002

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores