Parthasarathy Madhusudan
List of publications from the DBLP Bibliography Server - FAQ
| 2009 | ||
|---|---|---|
| 49 | Azadeh Farzan, P. Madhusudan, Francesco Sorrentino: Meta-analysis for Atomicity Violations under Nested Locking. CAV 2009: 248-262 | |
| 48 | Salvatore La Torre, P. Madhusudan, Gennaro Parlato: Reducing Context-Bounded Concurrent Reachability to Sequential Reachability. CAV 2009: 477-492 | |
| 47 | P. Madhusudan, Mahesh Viswanathan: Query Automata for Nested Words. MFCS 2009: 561-573 | |
| 46 | Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato: Analyzing recursive programs using a fixed-point calculus. PLDI 2009: 211-222 | |
| 45 | Azadeh Farzan, P. Madhusudan: The Complexity of Predicting Atomicity Violations. TACAS 2009: 155-169 | |
| 44 | Rajeev Alur, P. Madhusudan: Adding nesting structure to words. J. ACM 56(3): (2009) | |
| 2008 | ||
| 43 | Lars E. Olson, Carl A. Gunter, P. Madhusudan: A formal framework for reflective database access control policies. ACM Conference on Computer and Communications Security 2008: 289-298 | |
| 42 | Azadeh Farzan, P. Madhusudan: Monitoring Atomicity in Concurrent Programs. CAV 2008: 52-65 | |
| 41 | Salvatore La Torre, P. Madhusudan, Gennaro Parlato: An Infinite Automaton Characterization of Double Exponential Time. CSL 2008: 33-48 | |
| 40 | Salvatore La Torre, P. Madhusudan, Gennaro Parlato: Context-Bounded Analysis of Concurrent Queue Systems. TACAS 2008: 299-314 | |
| 39 | Wonhong Nam, P. Madhusudan, Rajeev Alur: Automatic symbolic compositional verification by learning assumptions. Formal Methods in System Design 32(3): 207-234 (2008) | |
| 2007 | ||
| 38 | Sruthi Bandhakavi, Prithvi Bisht, P. Madhusudan, V. N. Venkatakrishnan: CANDID: preventing sql injection attacks using dynamic candidate evaluations. ACM Conference on Computer and Communications Security 2007: 12-24 | |
| 37 | Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato: A Robust Class of Context-Sensitive Languages. LICS 2007: 161-170 | |
| 36 | Azadeh Farzan, P. Madhusudan: Causal Dataflow Analysis for Concurrent Programs. TACAS 2007: 102-116 | |
| 35 | P. Madhusudan: Learning Algorithms and Formal Verification (Invited Tutorial). VMCAI 2007: 214 | |
| 34 | Viraj Kumar, P. Madhusudan, Mahesh Viswanathan: Visibly pushdown automata for streaming XML. WWW 2007: 1053-1062 | |
| 2006 | ||
| 33 | Azadeh Farzan, P. Madhusudan: Causal Atomicity. CAV 2006: 315-328 | |
| 32 | Rajeev Alur, Swarat Chaudhuri, P. Madhusudan: Languages of Nested Trees. CAV 2006: 329-342 | |
| 31 | Viraj Kumar, P. Madhusudan, Mahesh Viswanathan: Minimization, Learning, and Conformance Testing of Boolean Programs. CONCUR 2006: 203-217 | |
| 30 | Rajeev Alur, P. Madhusudan: Adding Nesting Structure to Words. Developments in Language Theory 2006: 1-13 | |
| 29 | Rajeev Alur, Swarat Chaudhuri, P. Madhusudan: A fixpoint calculus for local and global program flows. POPL 2006: 153-165 | |
| 28 | Rajeev Alur, Salvatore La Torre, P. Madhusudan: Modular strategies for recursive game graphs. Theor. Comput. Sci. 354(2): 230-249 (2006) | |
| 2005 | ||
| 27 | Rajeev Alur, P. Madhusudan, Wonhong Nam: Symbolic Compositional Verification by Learning Assumptions. CAV 2005: 548-562 | |
| 26 | P. Madhusudan, P. S. Thiagarajan, Shaofa Yang: The MSO Theory of Connectedly Communicating Processes. FSTTCS 2005: 201-212 | |
| 25 | Rajeev Alur, Salvatore La Torre, P. Madhusudan: Perturbed Timed Automata. HSCC 2005: 70-85 | |
| 24 | Rajeev Alur, Viraj Kumar, P. Madhusudan, Mahesh Viswanathan: Congruences for Visibly Pushdown Languages. ICALP 2005: 1102-1114 | |
| 23 | Rajeev Alur, Pavol Cerný, P. Madhusudan, Wonhong Nam: Synthesis of interface specifications for Java classes. POPL 2005: 98-109 | |
| 22 | Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P. Madhusudan: On-the-Fly Reachability and Cycle Detection for Recursive State Machines. TACAS 2005: 61-76 | |
| 21 | Rajeev Alur, P. Madhusudan, Wonhong Nam: Symbolic computational techniques for solving games. STTT 7(2): 118-128 (2005) | |
| 2004 | ||
| 20 | Christof Löding, P. Madhusudan, Olivier Serre: Visibly Pushdown Games. FSTTCS 2004: 408-420 | |
| 19 | Rajeev Alur, Mikhail Bernadsky, P. Madhusudan: Optimal Reachability for Weighted Timed Games. ICALP 2004: 122-133 | |
| 18 | Rajeev Alur, P. Madhusudan: Decision Problems for Timed Automata: A Survey. SFM 2004: 1-24 | |
| 17 | Rajeev Alur, P. Madhusudan: Visibly pushdown languages. STOC 2004: 202-211 | |
| 16 | Rajeev Alur, Kousha Etessami, P. Madhusudan: A Temporal Logic of Nested Calls and Returns. TACAS 2004: 467-481 | |
| 2003 | ||
| 15 | Patricia Bouyer, Deepak D'Souza, P. Madhusudan, Antoine Petit: Timed Control with Partial Observability. CAV 2003: 180-192 | |
| 14 | Rajeev Alur, Salvatore La Torre, P. Madhusudan: Modular Strategies for Infinite Games on Recursive Graphs. CAV 2003: 67-79 | |
| 13 | Rajeev Alur, Salvatore La Torre, P. Madhusudan: Playing Games with Boxes and Diamonds. CONCUR 2003: 127-141 | |
| 12 | P. Madhusudan: Model-checking Trace Event Structures. LICS 2003: 371-380 | |
| 11 | Rajeev Alur, Salvatore La Torre, P. Madhusudan: Modular Strategies for Recursive Game Graphs. TACAS 2003: 363-378 | |
| 10 | P. Madhusudan, Wonhong Nam, Rajeev Alur: Symbolic computational techniques for solving games. Electr. Notes Theor. Comput. Sci. 89(4): (2003) | |
| 2002 | ||
| 9 | P. Madhusudan, P. S. Thiagarajan: A Decidable Class of Asynchronous Distributed Controllers. CONCUR 2002: 145-160 | |
| 8 | Martin Leucker, P. Madhusudan, Supratik Mukhopadhyay: Dynamic Message Sequence Charts. FSTTCS 2002: 253-264 | |
| 7 | Deepak D'Souza, P. Madhusudan: Timed Control Synthesis for External Specifications. STACS 2002: 571-582 | |
| 6 | P. Madhusudan, P. S. Thiagarajan: Branching time controllers for discrete event systems. Theor. Comput. Sci. 274(1-2): 117-149 (2002) | |
| 2001 | ||
| 5 | P. Madhusudan, B. Meenakshi: Beyond Message Sequence Graphs. FSTTCS 2001: 256-267 | |
| 4 | P. Madhusudan, P. S. Thiagarajan: Distributed Controller Synthesis for Local Specifications. ICALP 2001: 396-407 | |
| 3 | P. Madhusudan: Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs. ICALP 2001: 809-820 | |
| 2000 | ||
| 2 | Orna Kupferman, P. Madhusudan, P. S. Thiagarajan, Moshe Y. Vardi: Open Systems in Reactive Environments: Control and Synthesis. CONCUR 2000: 92-107 | |
| 1998 | ||
| 1 | P. Madhusudan, P. S. Thiagarajan: Controllers for Discrete Event Systems via Morphisms. CONCUR 1998: 18-33 | |
| 1 | Rajeev Alur | [10] [11] [13] [14] [16] [17] [18] [19] [21] [22] [23] [24] [25] [27] [28] [29] [30] [32] [39] [44] |
| 2 | Sruthi Bandhakavi | [38] |
| 3 | Mikhail Bernadsky | [19] |
| 4 | Prithvi Bisht | [38] |
| 5 | Patricia Bouyer | [15] |
| 6 | Pavol Cerný | [23] |
| 7 | Swarat Chaudhuri | [22] [29] [32] |
| 8 | Deepak D'Souza | [7] [15] |
| 9 | Kousha Etessami | [16] [22] |
| 10 | Azadeh Farzan | [33] [36] [42] [45] [49] |
| 11 | Carl A. Gunter | [43] |
| 12 | Viraj Kumar | [24] [31] [34] |
| 13 | Orna Kupferman | [2] |
| 14 | Martin Leucker | [8] |
| 15 | Christof Löding | [20] |
| 16 | B. Meenakshi | [5] |
| 17 | Supratik Mukhopadhyay | [8] |
| 18 | Wonhong Nam | [10] [21] [23] [27] [39] |
| 19 | Lars E. Olson | [43] |
| 20 | Gennaro Parlato | [37] [40] [41] [46] [48] |
| 21 | Antoine Petit | [15] |
| 22 | Olivier Serre | [20] |
| 23 | Francesco Sorrentino | [49] |
| 24 | P. S. Thiagarajan | [1] [2] [4] [6] [9] [26] |
| 25 | Salvatore La Torre | [11] [13] [14] [25] [28] [37] [40] [41] [46] [48] |
| 26 | Moshe Y. Vardi | [2] |
| 27 | V. N. Venkatakrishnan | [38] |
| 28 | Mahesh Viswanathan | [24] [31] [34] [47] |
| 29 | Shaofa Yang | [26] |