# S. Purushothaman Iyer

According to our database

Collaborative distances:

^{1}, S. Purushothaman Iyer authored at least 44 papers between 1986 and 2013.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2013

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

CoRR, 2013

2007

Error Report Driven Post-Mortem Analysis.

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

Analyzing network traffic to detect self-decrypting exploit code.

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

2006

A Formal Methods Approach to Medical Device Review.

IEEE Computer, 2006

Using Abstraction-driven Slicing for Postmortem Analysis of Software.

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

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

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

2005

Probabilistic temporal logics via the modal mu-calculus.

Theor. Comput. Sci., 2005

Simulating perfect channels with probabilistic lossy channels.

Inf. Comput., 2005

An Approach to Unfolding Asynchronous Communication Protocols.

Proceedings of the FM 2005: Formal Methods, 2005

2004

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

STTT, 2004

Introductory paper.

STTT, 2004

SAT-Solving the Coverability Problem for Petri Nets.

Formal Methods in System Design, 2004

2003

Well-abstracted transition systems: application to FIFO automata.

Inf. Comput., 2003

2002

Towards fast solid state DNA sequencing.

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

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

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

2000

Branching-Time Probalistic Model Checking.

ICALP Satellite Workshops, 2000

Well-Abstracted Transition Systems.

Proceedings of the CONCUR 2000, 2000

Reasoning about Probabilistic Lossy Channel Systems.

Proceedings of the CONCUR 2000, 2000

Unfoldings of Unbounded Petri Nets.

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

1999

The role of observations in probabilistic open systems.

Electr. Notes Theor. Comput. Sci., 1999

Probabilistic Temporal Logics via the Modal Mu-Calculus.

Proceedings of the Foundations of Software Science and Computation Structure, 1999

1997

Probabilistic Lossy Channel Systems.

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

1996

An Operational Semantics of Sharing in Lazy Evaluation.

Sci. Comput. Program., 1996

Unreliable Channels are Easier to Verify Than Perfect Channels.

Inf. Comput., 1996

1995

A New Typee of Pushdown Automata on Infinite Trees.

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

Optimality in Abstractions of Model Checking

Proceedings of the Static Analysis, 1995

1994

Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels.

Proceedings of the SIGSOFT '94, 1994

1993

A Uniform Treatment of Order of Evalaution and Aggregate Update.

Theor. Comput. Sci., 1993

From Operational Definitions to Abstract Semantics.

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

Experiments in Data flow analysis of Communicating Finite State Machines.

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

1992

Analysis of a Class of Communicating Finite State Machines.

Acta Inf., 1992

An Adequate Operational Semantics for Sharing in Lazy Evaluation.

Proceedings of the ESOP '92, 1992

Empty Stack Pushdown Omega-Tree Automata.

Proceedings of the CAAP '92, 1992

1991

Data Flow Analysis of Communicating Finite State Machines.

ACM Trans. Program. Lang. Syst., 1991

1990

A Compositional Analysis of Evaluation-Order and Its Application.

LISP and Functional Programming, 1990

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

Proceedings of the Computer-Aided Verification, 1990

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

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

1989

Mechanical Certification of Systolic Algorithms.

J. Autom. Reasoning, 1989

Towards Dataflow Analysis of Communicating Finite State Machines.

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

Analysis of communicating processes for non-progress.

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

1988

Reasoning about Systolic Algorithms.

J. Parallel Distrib. Comput., 1988

1987

Reasoning About Probabilistic Behavior in Concurrent Systems.

IEEE Trans. Software Eng., 1987

Reasoning About Modular Systolic Algorithms.

Proceedings of the International Conference on Parallel Processing, 1987

1986

On Synthesizing Systolic Arrays from Recurrence Equations with Linear Dependencies.

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