default search action
S. Purushothaman Iyer
Person information
- affiliation: North Carolina State University, Raleigh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [i1]M. Suresh, Maheswar Dutta, S. Purushothaman:
Application of polynomial vector (pv) processing to improve the estimation performance of bio diesel in variable compression ratio diesel engine. CoRR abs/1301.1261 (2013)
2000 – 2009
- 2007
- [c28]Qinghua Zhang, Douglas S. Reeves, Peng Ning, S. Purushothaman Iyer:
Analyzing network traffic to detect self-decrypting exploit code. AsiaCCS 2007: 4-12 - [c27]Yi Zhang
, S. Purushothaman Iyer:
Error Report Driven Post-Mortem Analysis. ICPC 2007: 208-220 - 2006
- [j17]Raoul Praful Jetley, S. Purushothaman Iyer, Paul L. Jones:
A Formal Methods Approach to Medical Device Review. Computer 39(4): 61-67 (2006) - [c26]Raoul Praful Jetley, S. Purushothaman Iyer, Paul L. Jones, William Spees:
A Formal Approach to Pre-Market Review for Medical Device Software. COMPSAC (1) 2006: 169-177 - [c25]Raoul Praful Jetley, Yi Zhang
Using Abstraction-driven Slicing for Postmortem Analysis of Software. ICPC 2006: 107-116 - 2005
- [j16]Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson:
Simulating perfect channels with probabilistic lossy channels. Inf. Comput. 197(1-2): 22-40 (2005) - [j15]Rance Cleaveland, S. Purushothaman Iyer, Murali Narasimha:
Probabilistic temporal logics via the modal mu-calculus. Theor. Comput. Sci. 342(2-3): 316-350 (2005) - [c24]Yu Lei, S. Purushothaman Iyer:
An Approach to Unfolding Asynchronous Communication Protocols. FM 2005: 334-349 - 2004
- [j14]Parosh Aziz Abdulla, S. Purushothaman Iyer, Aletta Nylén
SAT-Solving the Coverability Problem for Petri Nets. Formal Methods Syst. Des. 24(1): 25-43 (2004) - [j13]S. Purushothaman Iyer, David Hislop, Paul L. Jones, Jaime Lee, Frederick Pearce, Stephen Van Albert:
Introductory paper. Int. J. Softw. Tools Technol. Transf. 5(4): 299-300 (2004) - [j12]Raoul Praful Jetley, Cohan Carlos, S. Purushothaman Iyer:
A case study on applying formal methods to medical devices: computer-aided resuscitation algorithm. Int. J. Softw. Tools Technol. Transf. 5(4): 320-330 (2004) - 2003
- [j11]Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre:
Well-abstracted transition systems: application to FIFO automata. Inf. Comput. 181(1): 1-31 (2003) - 2002
- [c23]Daniel C. DuVarney, S. Purushothaman Iyer:
C Wolf - A Toolset for Extracting Models from C Programs. FORTE 2002: 260-275 - [c22]S. Purushothaman, Christofer Toumazou, Julius Georgiou:
Towards fast solid state DNA sequencing. ISCAS (4) 2002: 169-172 - 2000
- [c21]Parosh Aziz Abdulla, S. Purushothaman Iyer, Aletta Nylén:
Unfoldings of Unbounded Petri Nets. CAV 2000: 495-507 - [c20]Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson:
Reasoning about Probabilistic Lossy Channel Systems. CONCUR 2000: 320-333 - [c19]Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre:
Well-Abstracted Transition Systems. CONCUR 2000: 566-580 - [c18]Rance Cleaveland, S. Purushothaman Iyer:
Branching-Time Probalistic Model Checking. ICALP Satellite Workshops 2000: 487-500
1990 – 1999
- 1999
- [c17]Murali Narasimha, Rance Cleaveland, S. Purushothaman Iyer:
Probabilistic Temporal Logics via the Modal Mu-Calculus. FoSSaCS 1999: 288-305 - 1998
- [c16]Murali Narasimha, Rance Cleaveland, S. Purushothaman Iyer:
The role of observations in probabilistic open systems. Monterey Workshop 1998: 133-144 - 1997
- [c15]S. Purushothaman Iyer, Murali Narasimha:
Probabilistic Lossy Channel Systems. TAPSOFT 1997: 667-681 - 1996
- [j10]Gérard Cécé, Alain Finkel, S. Purushothaman Iyer:
Unreliable Channels are Easier to Verify Than Perfect Channels. Inf. Comput. 124(1): 20-31 (1996) - [j9]Jill Seaman, S. Purushothaman Iyer:
An Operational Semantics of Sharing in Lazy Evaluation. Sci. Comput. Program. 27(3): 289-322 (1996) - 1995
- [j8]Wuxu Peng, S. Purushothaman Iyer:
A New Typee of Pushdown Automata on Infinite Trees. Int. J. Found. Comput. Sci. 6(2): 169-186 (1995) - [c14]Sandeep Kumar, Dharma P. Agrawal, S. Purushothaman Iyer:
An Improved Type-Inference Algorithm to Expose Parallelism in Object-Oriented Programs. LCR 1995: 283-286 - [c13]Rance Cleaveland, S. Purushothaman Iyer, Daniel Yankelevich:
Optimality in Abstractions of Model Checking. SAS 1995: 51-63 - 1994
- [c12]Gérard Cécé, Alain Finkel, S. Purushothaman Iyer:
Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels. SIGSOFT FSE 1994: 35-43 - 1993
- [j7]S. Purushothaman:
Book Review: Nets, Terms and Formulas . By E.-R. Olderog. (Cambridge University Press, 1991 . x+267pp. ISBN 0-521-40044-9 . $49.95). SIGACT News 24(1): 26-27 (1993) - [j6]M. Draghicescu, S. Purushothaman:
A Uniform Treatment of Order of Evalaution and Aggregate Update. Theor. Comput. Sci. 118(2): 231-262 (1993) - [c11]S. Purushothaman Iyer:
Experiments in Data flow analysis of Communicating Finite State Machines. FORTE 1993: 141-153 - [c10]S. Purushothaman, Jill Seaman:
From Operational Definitions to Abstract Semantics. FPCA 1993: 276-288 - [p1]S. Purushothaman, Jill Seaman:
5 Programming languages and systems. Computational Statistics 1993: 141-168 - [e1]S. Purushothaman, Amy E. Zwarico:
NAPAW 92, Proceedings of the First North American Process Algebra Workshop, Stony Brook, New York, USA, 28 Agust 1992. Workshops in Computing, Springer 1993, ISBN 3-540-19822-9 [contents] - 1992
- [j5]Wuxu Peng, S. Purushothaman:
Analysis of a Class of Communicating Finite State Machines. Acta Informatica 29(6/7): 499-522 (1992) - [c9]Wuxu Peng, S. Purushothaman:
Empty Stack Pushdown Omega-Tree Automata. CAAP 1992: 248-264 - [c8]S. Purushothaman, Jill Seaman:
An Adequate Operational Semantics for Sharing in Lazy Evaluation. ESOP 1992: 435-450 - 1991
- [j4]Wuxu Peng, S. Purushothaman:
Data Flow Analysis of Communicating Finite State Machines. ACM Trans. Program. Lang. Syst. 13(3): 399-442 (1991) - 1990
- [c7]Wuxu Peng, S. Purushothaman:
A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines. CAV 1990: 243-252 - [c6]Wuxu Peng, S. Purushothaman Iyer:
A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines. CAV (DIMACS/AMS volume) 1990: 395-404 - [c5]M. Draghicescu, S. Purushothaman:
A Compositional Analysis of Evaluation-Order and Its Application. LISP and Functional Programming 1990: 242-250
1980 – 1989
- 1989
- [j3]S. Purushothaman, P. A. Subrahmanyam:
Mechanical Certification of Systolic Algorithms. J. Autom. Reason. 5(1): 67-91 (1989) - [c4]Wuxu Peng, S. Purushothaman:
Analysis of communicating processes for non-progress. ICDCS 1989: 280-287 - [c3]Wuxu Peng, S. Purushothaman:
Towards Dataflow Analysis of Communicating Finite State Machines. PODC 1989: 45-58 - 1988
- [j2]S. Purushothaman, P. A. Subrahmanyam:
Reasoning about Systolic Algorithms. J. Parallel Distributed Comput. 5(6): 669-699 (1988) - 1987
- [j1]S. Purushothaman, P. A. Subrahmanyam:
Reasoning About Probabilistic Behavior in Concurrent Systems. IEEE Trans. Software Eng. 13(6): 740-745 (1987) - [c2]S. Purushothaman:
Reasoning About Modular Systolic Algorithms. ICPP 1987: 841-843 - 1986
- [c1]Sanjay V. Rajopadhye, S. Purushothaman, Richard Fujimoto:
On Synthesizing Systolic Arrays from Recurrence Equations with Linear Dependencies. FSTTCS 1986: 488-503
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: