S. Purushothaman Iyer

28 papers A* 1A 3B 5C 2Journal 10Unranked 7
YearRankTypeTitle / Venue / Authors
2007 A conf
Analyzing network traffic to detect self-decrypting exploit code.
AsiaCCS
Qinghua Zhang, Douglas S. Reeves, Peng Ning, S. Purushothaman Iyer
2007 A conf
Error Report Driven Post-Mortem Analysis.
ICPC
Yi Zhang, S. Purushothaman Iyer
2006 — conf
A Formal Approach to Pre-Market Review for Medical Device Software.
COMPSAC (1)
Raoul Praful Jetley, S. Purushothaman Iyer, Paul L. Jones, William Spees
2006 J jnl
A Formal Methods Approach to Medical Device Review.
Computer
Raoul Praful Jetley, S. Purushothaman Iyer, Paul L. Jones
2006 A conf
Using Abstraction-driven Slicing for Postmortem Analysis of Software.
ICPC
Raoul Praful Jetley, Yi Zhang, S. Purushothaman Iyer
2005 B conf
An Approach to Unfolding Asynchronous Communication Protocols.
FM
Yu Lei, S. Purushothaman Iyer
2005 J jnl
Probabilistic temporal logics via the modal mu-calculus.
Theor. Comput. Sci.
Rance Cleaveland, S. Purushothaman Iyer, Murali Narasimha
2005 J jnl
Simulating perfect channels with probabilistic lossy channels.
Inf. Comput.
Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson
2004 J jnl
A case study on applying formal methods to medical devices: computer-aided resuscitation algorithm.
Int. J. Softw. Tools Technol. Transf.
Raoul Praful Jetley, Cohan Carlos, S. Purushothaman Iyer
2004 J jnl
Introductory paper.
Int. J. Softw. Tools Technol. Transf.
S. Purushothaman Iyer, David Hislop, Paul L. Jones, Jaime Lee, Frederick Pearce, Stephen Van Albert
2004 J jnl
SAT-Solving the Coverability Problem for Petri Nets.
Formal Methods Syst. Des.
Parosh Aziz Abdulla, S. Purushothaman Iyer, Aletta Nylén
2003 J jnl
Well-abstracted transition systems: application to FIFO automata.
Inf. Comput.
Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre
2002 C conf
C Wolf - A Toolset for Extracting Models from C Programs.
FORTE
Daniel C. DuVarney, S. Purushothaman Iyer
2000 — conf
Branching-Time Probalistic Model Checking.
ICALP Satellite Workshops
Rance Cleaveland, S. Purushothaman Iyer
2000 B conf
Reasoning about Probabilistic Lossy Channel Systems.
CONCUR
Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson
2000 A* conf
Unfoldings of Unbounded Petri Nets.
CAV
Parosh Aziz Abdulla, S. Purushothaman Iyer, Aletta Nylén
2000 B conf
Well-Abstracted Transition Systems.
CONCUR
Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre
1999 B conf
Probabilistic Temporal Logics via the Modal Mu-Calculus.
FoSSaCS
Murali Narasimha, Rance Cleaveland, S. Purushothaman Iyer
1998 — conf
The role of observations in probabilistic open systems.
Monterey Workshop
Murali Narasimha, Rance Cleaveland, S. Purushothaman Iyer
1997 — conf
Probabilistic Lossy Channel Systems.
TAPSOFT
S. Purushothaman Iyer, Murali Narasimha
1996 J jnl
An Operational Semantics of Sharing in Lazy Evaluation.
Sci. Comput. Program.
Jill Seaman, S. Purushothaman Iyer
1996 J jnl
Unreliable Channels are Easier to Verify Than Perfect Channels.
Inf. Comput.
Gérard Cécé, Alain Finkel, S. Purushothaman Iyer
1995 J jnl
A New Typee of Pushdown Automata on Infinite Trees.
Int. J. Found. Comput. Sci.
Wuxu Peng, S. Purushothaman Iyer
1995 — conf
An Improved Type-Inference Algorithm to Expose Parallelism in Object-Oriented Programs.
LCR
Sandeep Kumar, Dharma P. Agrawal, S. Purushothaman Iyer
1995 B conf
Optimality in Abstractions of Model Checking
SAS
Rance Cleaveland, S. Purushothaman Iyer, Daniel Yankelevich
1994 — conf
Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels.
SIGSOFT FSE
Gérard Cécé, Alain Finkel, S. Purushothaman Iyer
1993 C conf
Experiments in Data flow analysis of Communicating Finite State Machines.
FORTE
S. Purushothaman Iyer
1990 — conf
A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines.
CAV (DIMACS/AMS volume)
Wuxu Peng, S. Purushothaman Iyer