| 2009 |
|---|
| 44 | EE | Azadeh Farzan,
P. Madhusudan:
The Complexity of Predicting Atomicity Violations.
TACAS 2009: 155-169 |
| 2008 |
|---|
| 43 | EE | 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 | EE | Azadeh Farzan,
P. Madhusudan:
Monitoring Atomicity in Concurrent Programs.
CAV 2008: 52-65 |
| 41 | EE | Salvatore La Torre,
P. Madhusudan,
Gennaro Parlato:
An Infinite Automaton Characterization of Double Exponential Time.
CSL 2008: 33-48 |
| 40 | EE | Salvatore La Torre,
P. Madhusudan,
Gennaro Parlato:
Context-Bounded Analysis of Concurrent Queue Systems.
TACAS 2008: 299-314 |
| 39 | EE | 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 | EE | 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 | EE | Salvatore La Torre,
Parthasarathy Madhusudan,
Gennaro Parlato:
A Robust Class of Context-Sensitive Languages.
LICS 2007: 161-170 |
| 36 | EE | Azadeh Farzan,
P. Madhusudan:
Causal Dataflow Analysis for Concurrent Programs.
TACAS 2007: 102-116 |
| 35 | EE | P. Madhusudan:
Learning Algorithms and Formal Verification (Invited Tutorial).
VMCAI 2007: 214 |
| 34 | EE | Viraj Kumar,
P. Madhusudan,
Mahesh Viswanathan:
Visibly pushdown automata for streaming XML.
WWW 2007: 1053-1062 |
| 2006 |
|---|
| 33 | EE | Azadeh Farzan,
P. Madhusudan:
Causal Atomicity.
CAV 2006: 315-328 |
| 32 | EE | Rajeev Alur,
Swarat Chaudhuri,
P. Madhusudan:
Languages of Nested Trees.
CAV 2006: 329-342 |
| 31 | EE | Viraj Kumar,
P. Madhusudan,
Mahesh Viswanathan:
Minimization, Learning, and Conformance Testing of Boolean Programs.
CONCUR 2006: 203-217 |
| 30 | EE | Rajeev Alur,
P. Madhusudan:
Adding Nesting Structure to Words.
Developments in Language Theory 2006: 1-13 |
| 29 | EE | Rajeev Alur,
Swarat Chaudhuri,
P. Madhusudan:
A fixpoint calculus for local and global program flows.
POPL 2006: 153-165 |
| 28 | EE | Rajeev Alur,
Salvatore La Torre,
P. Madhusudan:
Modular strategies for recursive game graphs.
Theor. Comput. Sci. 354(2): 230-249 (2006) |
| 2005 |
|---|
| 27 | EE | Rajeev Alur,
P. Madhusudan,
Wonhong Nam:
Symbolic Compositional Verification by Learning Assumptions.
CAV 2005: 548-562 |
| 26 | EE | P. Madhusudan,
P. S. Thiagarajan,
Shaofa Yang:
The MSO Theory of Connectedly Communicating Processes.
FSTTCS 2005: 201-212 |
| 25 | EE | Rajeev Alur,
Salvatore La Torre,
P. Madhusudan:
Perturbed Timed Automata.
HSCC 2005: 70-85 |
| 24 | EE | Rajeev Alur,
Viraj Kumar,
P. Madhusudan,
Mahesh Viswanathan:
Congruences for Visibly Pushdown Languages.
ICALP 2005: 1102-1114 |
| 23 | EE | Rajeev Alur,
Pavol Cerný,
P. Madhusudan,
Wonhong Nam:
Synthesis of interface specifications for Java classes.
POPL 2005: 98-109 |
| 22 | EE | Rajeev Alur,
Swarat Chaudhuri,
Kousha Etessami,
P. Madhusudan:
On-the-Fly Reachability and Cycle Detection for Recursive State Machines.
TACAS 2005: 61-76 |
| 21 | EE | Rajeev Alur,
P. Madhusudan,
Wonhong Nam:
Symbolic computational techniques for solving games.
STTT 7(2): 118-128 (2005) |
| 2004 |
|---|
| 20 | EE | Christof Löding,
P. Madhusudan,
Olivier Serre:
Visibly Pushdown Games.
FSTTCS 2004: 408-420 |
| 19 | EE | Rajeev Alur,
Mikhail Bernadsky,
P. Madhusudan:
Optimal Reachability for Weighted Timed Games.
ICALP 2004: 122-133 |
| 18 | EE | Rajeev Alur,
P. Madhusudan:
Decision Problems for Timed Automata: A Survey.
SFM 2004: 1-24 |
| 17 | EE | Rajeev Alur,
P. Madhusudan:
Visibly pushdown languages.
STOC 2004: 202-211 |
| 16 | EE | Rajeev Alur,
Kousha Etessami,
P. Madhusudan:
A Temporal Logic of Nested Calls and Returns.
TACAS 2004: 467-481 |
| 2003 |
|---|
| 15 | EE | Patricia Bouyer,
Deepak D'Souza,
P. Madhusudan,
Antoine Petit:
Timed Control with Partial Observability.
CAV 2003: 180-192 |
| 14 | EE | Rajeev Alur,
Salvatore La Torre,
P. Madhusudan:
Modular Strategies for Infinite Games on Recursive Graphs.
CAV 2003: 67-79 |
| 13 | EE | Rajeev Alur,
Salvatore La Torre,
P. Madhusudan:
Playing Games with Boxes and Diamonds.
CONCUR 2003: 127-141 |
| 12 | EE | P. Madhusudan:
Model-checking Trace Event Structures.
LICS 2003: 371-380 |
| 11 | EE | Rajeev Alur,
Salvatore La Torre,
P. Madhusudan:
Modular Strategies for Recursive Game Graphs.
TACAS 2003: 363-378 |
| 10 | EE | P. Madhusudan,
Wonhong Nam,
Rajeev Alur:
Symbolic computational techniques for solving games.
Electr. Notes Theor. Comput. Sci. 89(4): (2003) |
| 2002 |
|---|
| 9 | EE | P. Madhusudan,
P. S. Thiagarajan:
A Decidable Class of Asynchronous Distributed Controllers.
CONCUR 2002: 145-160 |
| 8 | EE | Martin Leucker,
P. Madhusudan,
Supratik Mukhopadhyay:
Dynamic Message Sequence Charts.
FSTTCS 2002: 253-264 |
| 7 | EE | Deepak D'Souza,
P. Madhusudan:
Timed Control Synthesis for External Specifications.
STACS 2002: 571-582 |
| 6 | EE | P. Madhusudan,
P. S. Thiagarajan:
Branching time controllers for discrete event systems.
Theor. Comput. Sci. 274(1-2): 117-149 (2002) |
| 2001 |
|---|
| 5 | EE | P. Madhusudan,
B. Meenakshi:
Beyond Message Sequence Graphs.
FSTTCS 2001: 256-267 |
| 4 | EE | P. Madhusudan,
P. S. Thiagarajan:
Distributed Controller Synthesis for Local Specifications.
ICALP 2001: 396-407 |
| 3 | EE | P. Madhusudan:
Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs.
ICALP 2001: 809-820 |
| 2000 |
|---|
| 2 | EE | Orna Kupferman,
P. Madhusudan,
P. S. Thiagarajan,
Moshe Y. Vardi:
Open Systems in Reactive Environments: Control and Synthesis.
CONCUR 2000: 92-107 |
| 1998 |
|---|
| 1 | EE | P. Madhusudan,
P. S. Thiagarajan:
Controllers for Discrete Event Systems via Morphisms.
CONCUR 1998: 18-33 |
