S. Purushothaman Iyer

According to our database, S. Purushothaman Iyer authored at least 45 papers between 1986 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2013

Application of polynomial vector (pv) processing to improve the estimation performance of bio diesel in variable compression ratio diesel engine

M. Suresh, Maheswar Dutta, S. Purushothaman

CoRR, 2013

2007

Error Report Driven Post-Mortem Analysis.

Yi Zhang, S. Purushothaman Iyer

Proceedings of the 15th International Conference on Program Comprehension (ICPC 2007), 2007

Analyzing network traffic to detect self-decrypting exploit code.

Qinghua Zhang, Douglas S. Reeves, Peng Ning, S. Purushothaman Iyer

Proceedings of the 2007 ACM Symposium on Information, Computer and Communications Security, 2007

2006

A Formal Methods Approach to Medical Device Review.

Raoul Praful Jetley, S. Purushothaman Iyer, Paul L. Jones

Computer, 2006

Using Abstraction-driven Slicing for Postmortem Analysis of Software.

Raoul Praful Jetley, Yi Zhang, S. Purushothaman Iyer

Proceedings of the 14th International Conference on Program Comprehension (ICPC 2006), 2006

A Formal Approach to Pre-Market Review for Medical Device Software.

Raoul Praful Jetley, S. Purushothaman Iyer, Paul L. Jones, William Spees

Proceedings of the 30th Annual International Computer Software and Applications Conference, 2006

2005

Probabilistic temporal logics via the modal mu-calculus.

Rance Cleaveland, S. Purushothaman Iyer, Murali Narasimha

Theor. Comput. Sci., 2005

Simulating perfect channels with probabilistic lossy channels.

Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson

Inf. Comput., 2005

An Approach to Unfolding Asynchronous Communication Protocols.

Yu Lei, S. Purushothaman Iyer

Proceedings of the FM 2005: Formal Methods, 2005

2004

A case study on applying formal methods to medical devices: computer-aided resuscitation algorithm.

Raoul Praful Jetley, Cohan Carlos, S. Purushothaman Iyer

Int. J. Softw. Tools Technol. Transf., 2004

Introductory paper.

S. Purushothaman Iyer, David Hislop, Paul L. Jones, Jaime Lee, Frederick Pearce, Stephen Van Albert

Int. J. Softw. Tools Technol. Transf., 2004

SAT-Solving the Coverability Problem for Petri Nets.

Parosh Aziz Abdulla, S. Purushothaman Iyer, Aletta Nylén

Formal Methods Syst. Des., 2004

2003

Well-abstracted transition systems: application to FIFO automata.

Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre

Inf. Comput., 2003

2002

Towards fast solid state DNA sequencing.

S. Purushothaman, Christofer Toumazou, Julius Georgiou

Proceedings of the 2002 International Symposium on Circuits and Systems, 2002

C Wolf - A Toolset for Extracting Models from C Programs.

Daniel C. DuVarney, S. Purushothaman Iyer

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2002

2000

Branching-Time Probalistic Model Checking.

Rance Cleaveland, S. Purushothaman Iyer

Proceedings of the ICALP Workshops 2000, 2000

Well-Abstracted Transition Systems.

Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre

Proceedings of the CONCUR 2000, 2000

Reasoning about Probabilistic Lossy Channel Systems.

Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson

Proceedings of the CONCUR 2000, 2000

Unfoldings of Unbounded Petri Nets.

Parosh Aziz Abdulla, S. Purushothaman Iyer, Aletta Nylén

Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1998

The role of observations in probabilistic open systems.

Murali Narasimha, Rance Cleaveland, S. Purushothaman Iyer

Proceedings of the 1998 ARO/ONR/NSF/DARPA Monterey Workshop on Engineering Automation for Computer Basesd Systems, 1998

1997

Probabilistic Lossy Channel Systems.

S. Purushothaman Iyer, Murali Narasimha

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1996

An Operational Semantics of Sharing in Lazy Evaluation.

Jill Seaman, S. Purushothaman Iyer

Sci. Comput. Program., 1996

Unreliable Channels are Easier to Verify Than Perfect Channels.

Gérard Cécé, Alain Finkel, S. Purushothaman Iyer

Inf. Comput., 1996

1995

A New Typee of Pushdown Automata on Infinite Trees.

Wuxu Peng, S. Purushothaman Iyer

Int. J. Found. Comput. Sci., 1995

Optimality in Abstractions of Model Checking

Rance Cleaveland, S. Purushothaman Iyer, Daniel Yankelevich

Proceedings of the Static Analysis, 1995

An Improved Type-Inference Algorithm to Expose Parallelism in Object-Oriented Programs.

Sandeep Kumar, Dharma P. Agrawal, S. Purushothaman Iyer

Proceedings of the Languages, 1995

1994

Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels.

Gérard Cécé, Alain Finkel, S. Purushothaman Iyer

Proceedings of the Second ACM SIGSOFT Symposium on Foundations of Software Engineering, 1994

1993

A Uniform Treatment of Order of Evalaution and Aggregate Update.

M. Draghicescu, S. Purushothaman

Theor. Comput. Sci., 1993

Book Review: Nets, Terms and Formulas . By E.-R. Olderog. (Cambridge University Press, 1991 . x+267pp. ISBN 0-521-40044-9 . $49.95).

S. Purushothaman

SIGACT News, 1993

From Operational Definitions to Abstract Semantics.

S. Purushothaman, Jill Seaman

Proceedings of the conference on Functional programming languages and computer architecture, 1993

Experiments in Data flow analysis of Communicating Finite State Machines.

S. Purushothaman Iyer

Proceedings of the Formal Description Techniques, VI, Proceedings of the IFIP TC6/WG6.1 Sixth International Conference on Formal Description Techniques, 1993

5 Programming languages and systems.

S. Purushothaman, Jill Seaman

Proceedings of the Computational Statistics., 1993

1992

Analysis of a Class of Communicating Finite State Machines.

Wuxu Peng, S. Purushothaman

Acta Informatica, 1992

An Adequate Operational Semantics for Sharing in Lazy Evaluation.

S. Purushothaman, Jill Seaman

Proceedings of the ESOP '92, 1992

Empty Stack Pushdown Omega-Tree Automata.

Wuxu Peng, S. Purushothaman

Proceedings of the CAAP '92, 1992

1991

Data Flow Analysis of Communicating Finite State Machines.

Wuxu Peng, S. Purushothaman

ACM Trans. Program. Lang. Syst., 1991

1990

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

A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines.

Wuxu Peng, S. Purushothaman

Proceedings of the Computer Aided Verification, 2nd International Workshop, 1990

1989

Mechanical Certification of Systolic Algorithms.

S. Purushothaman, P. A. Subrahmanyam

J. Autom. Reason., 1989

Towards Dataflow Analysis of Communicating Finite State Machines.

Wuxu Peng, S. Purushothaman

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

Analysis of communicating processes for non-progress.

Wuxu Peng, S. Purushothaman

Proceedings of the 9th International Conference on Distributed Computing Systems, 1989

1988

Reasoning about Systolic Algorithms.

S. Purushothaman, P. A. Subrahmanyam

J. Parallel Distributed Comput., 1988

1987

Reasoning About Probabilistic Behavior in Concurrent Systems.

S. Purushothaman, P. A. Subrahmanyam

IEEE Trans. Software Eng., 1987

Reasoning About Modular Systolic Algorithms.

S. Purushothaman

Proceedings of the International Conference on Parallel Processing, 1987

1986

On Synthesizing Systolic Arrays from Recurrence Equations with Linear Dependencies.

Sanjay V. Rajopadhye, S. Purushothaman, Richard Fujimoto

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986