S. Purushothaman
List of publications from the DBLP Bibliography Server - FAQ
| 2007 | ||
|---|---|---|
| 42 | Qinghua Zhang, Douglas S. Reeves, Peng Ning, S. Purushothaman Iyer: Analyzing network traffic to detect self-decrypting exploit code. ASIACCS 2007: 4-12 | |
| 41 | Yi Zhang, S. Purushothaman Iyer: Error Report Driven Post-Mortem Analysis. ICPC 2007: 208-220 | |
| 2006 | ||
| 40 | 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 | |
| 39 | Raoul Praful Jetley, Yi Zhang, S. Purushothaman Iyer: Using Abstraction-driven Slicing for Postmortem Analysis of Software. ICPC 2006: 107-116 | |
| 38 | Raoul Praful Jetley, S. Purushothaman Iyer, Paul L. Jones: A Formal Methods Approach to Medical Device Review. IEEE Computer 39(4): 61-67 (2006) | |
| 2005 | ||
| 37 | Yu Lei, S. Purushothaman Iyer: An Approach to Unfolding Asynchronous Communication Protocols. FM 2005: 334-349 | |
| 36 | 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) | |
| 35 | Rance Cleaveland, S. Purushothaman Iyer, Murali Narasimha: Probabilistic temporal logics via the modal mu-calculus. Theor. Comput. Sci. 342(2-3): 316-350 (2005) | |
| 2004 | ||
| 34 | Parosh Aziz Abdulla, S. Purushothaman Iyer, Aletta Nylén: SAT-Solving the Coverability Problem for Petri Nets. Formal Methods in System Design 24(1): 25-43 (2004) | |
| 33 | S. Purushothaman Iyer, David Hislop, Paul L. Jones, Jaime Lee, Frederick Pearce, Stephen Van Albert: Introductory paper. STTT 5(4): 299-300 (2004) | |
| 32 | Raoul Praful Jetley, Cohan Carlos, S. Purushothaman Iyer: A case study on applying formal methods to medical devices: computer-aided resuscitation algorithm. STTT 5(4): 320-330 (2004) | |
| 2003 | ||
| 31 | Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre: Well-abstracted transition systems: application to FIFO automata. Inf. Comput. 181(1): 1-31 (2003) | |
| 2002 | ||
| 30 | Daniel C. DuVarney, S. Purushothaman Iyer: C Wolf - A Toolset for Extracting Models from C Programs. FORTE 2002: 260-275 | |
| 29 | S. Purushothaman, Christofer Toumazou, Julius Georgiou: Towards fast solid state DNA sequencing. ISCAS (4) 2002: 169-172 | |
| 2000 | ||
| 28 | Parosh Aziz Abdulla, S. Purushothaman Iyer, Aletta Nylén: Unfoldings of Unbounded Petri Nets. CAV 2000: 495-507 | |
| 27 | Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson: Reasoning about Probabilistic Lossy Channel Systems. CONCUR 2000: 320-333 | |
| 26 | Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre: Well-Abstracted Transition Systems. CONCUR 2000: 566-580 | |
| 25 | Rance Cleaveland, S. Purushothaman Iyer: Branching-Time Probalistic Model Checking. ICALP Satellite Workshops 2000: 487-500 | |
| 1999 | ||
| 24 | Murali Narasimha, Rance Cleaveland, S. Purushothaman Iyer: Probabilistic Temporal Logics via the Modal Mu-Calculus. FoSSaCS 1999: 288-305 | |
| 23 | Murali Narasimha, Rance Cleaveland, S. Purushothaman Iyer: The role of observations in probabilistic open systems. Electr. Notes Theor. Comput. Sci. 25: (1999) | |
| 1997 | ||
| 22 | S. Purushothaman Iyer, Murali Narasimha: Probabilistic Lossy Channel Systems. TAPSOFT 1997: 667-681 | |
| 1996 | ||
| 21 | 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) | |
| 20 | Jill Seaman, S. Purushothaman Iyer: An Operational Semantics of Sharing in Lazy Evaluation. Sci. Comput. Program. 27(3): 289-322 (1996) | |
| 1995 | ||
| 19 | Rance Cleaveland, S. Purushothaman Iyer, Daniel Yankelevich: Optimality in Abstractions of Model Checking SAS 1995: 51-63 | |
| 18 | Wuxu Peng, S. Purushothaman Iyer: A New Typee of Pushdown Automata on Infinite Trees. Int. J. Found. Comput. Sci. 6(2): 169-186 (1995) | |
| 1994 | ||
| 17 | Gérard Cécé, Alain Finkel, S. Purushothaman Iyer: Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels. SIGSOFT FSE 1994: 35-43 | |
| 1993 | ||
| 16 | S. Purushothaman, Amy E. Zwarico: NAPAW 92, Proceedings of the First North American Process Algebra Workshop, Stony Brook, New York, USA, 28 Agust 1992 Springer 1993 | |
| 15 | S. Purushothaman Iyer: Experiments in Data flow analysis of Communicating Finite State Machines. FORTE 1993: 141-153 | |
| 14 | S. Purushothaman, Jill Seaman: From Operational Definitions to Abstract Semantics. FPCA 1993: 276-288 | |
| 13 | M. Draghicescu, S. Purushothaman: A Uniform Treatment of Order of Evalaution and Aggregate Update. Theor. Comput. Sci. 118(2): 231-262 (1993) | |
| 1992 | ||
| 12 | Wuxu Peng, S. Purushothaman: Empty Stack Pushdown Omega-Tree Automata. CAAP 1992: 248-264 | |
| 11 | S. Purushothaman, Jill Seaman: An Adequate Operational Semantics for Sharing in Lazy Evaluation. ESOP 1992: 435-450 | |
| 10 | Wuxu Peng, S. Purushothaman: Analysis of a Class of Communicating Finite State Machines. Acta Inf. 29(6/7): 499-522 (1992) | |
| 1991 | ||
| 9 | Wuxu Peng, S. Purushothaman: Data Flow Analysis of Communicating Finite State Machines. ACM Trans. Program. Lang. Syst. 13(3): 399-442 (1991) | |
| 1990 | ||
| 8 | Wuxu Peng, S. Purushothaman: A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines. CAV 1990: 243-252 | |
| 7 | M. Draghicescu, S. Purushothaman: A Compositional Analysis of Evaluation-Order and Its Application. LISP and Functional Programming 1990: 242-250 | |
| 1989 | ||
| 6 | Wuxu Peng, S. Purushothaman: Towards Dataflow Analysis of Communicating Finite State Machines. PODC 1989: 45-58 | |
| 5 | S. Purushothaman, P. A. Subrahmanyam: Mechanical Certification of Systolic Algorithms. J. Autom. Reasoning 5(1): 67-91 (1989) | |
| 1988 | ||
| 4 | S. Purushothaman, P. A. Subrahmanyam: Reasoning about Systolic Algorithms. J. Parallel Distrib. Comput. 5(6): 669-699 (1988) | |
| 1987 | ||
| 3 | S. Purushothaman: Reasoning About Modular Systolic Algorithms. ICPP 1987: 841-843 | |
| 2 | S. Purushothaman, P. A. Subrahmanyam: Reasoning About Probabilistic Behavior in Concurrent Systems. IEEE Trans. Software Eng. 13(6): 740-745 (1987) | |
| 1986 | ||
| 1 | Sanjay V. Rajopadhye, S. Purushothaman, Richard Fujimoto: On Synthesizing Systolic Arrays from Recurrence Equations with Linear Dependencies. FSTTCS 1986: 488-503 | |
| 1 | Parosh Aziz Abdulla | [27] [28] [34] [36] |
| 2 | Stephen Van Albert | [33] |
| 3 | Christel Baier | [27] [36] |
| 4 | Cohan Carlos | [32] |
| 5 | Gérard Cécé | [17] [21] |
| 6 | Rance Cleaveland | [19] [23] [24] [25] [35] |
| 7 | M. Draghicescu | [7] [13] |
| 8 | Daniel C. DuVarney | [30] |
| 9 | Alain Finkel | [17] [21] [26] [31] |
| 10 | Richard M. Fujimoto (Richard Fujimoto) | [1] |
| 11 | Julius Georgiou | [29] |
| 12 | David Hislop | [33] |
| 13 | Raoul Praful Jetley | [32] [38] [39] [40] |
| 14 | Paul L. Jones | [33] [38] [40] |
| 15 | Bengt Jonsson | [27] [36] |
| 16 | Jaime Lee | [33] |
| 17 | Yu Lei | [37] |
| 18 | Murali Narasimha | [22] [23] [24] [35] |
| 19 | Peng Ning | [42] |
| 20 | Aletta Nylén | [28] [34] |
| 21 | Frederick Pearce | [33] |
| 22 | Wuxu Peng | [6] [8] [9] [10] [12] [18] |
| 23 | Sanjay V. Rajopadhye | [1] |
| 24 | Douglas S. Reeves | [42] |
| 25 | Jill Seaman | [11] [14] [20] |
| 26 | William Spees | [40] |
| 27 | P. A. Subrahmanyam | [2] [4] [5] |
| 28 | Grégoire Sutre | [26] [31] |
| 29 | Christofer Toumazou (Chris Toumazou) | [29] |
| 30 | Daniel Yankelevich | [19] |
| 31 | Qinghua Zhang | [42] |
| 32 | Yi Zhang | [39] [41] |
| 33 | Amy E. Zwarico | [16] |