Parthasarathy, Madhusudan - Department of Computer Science, University of Illinois at Urbana-Champaign

• A Formal Framework for Reflective Database Access Control Policies
• Branching Time Controllers for Discrete Event Systems
• A Decidable Class of Asynchronous Distributed Controllers
• BMC'03 Preliminary Version Symbolic Computational Techniques for
• Model-checking Parameterized Concurrent Programs using Linear Interfaces
• Dynamic Message Sequence Charts Martin Leucker 1;2? , P. Madhusudan 2?? , Supratik Mukhopadhyay 2
• Symbolic Compositional Veri cation by Learning Assumptions ?
• Synthesizing Reactive Programs P. Madhusudan
• Welcome to CS 598MP Software Verification
• Modular Strategies for Recursive Game Graphs ? ??
• Parallel Computing Research at Illinois The UPCRC Agenda
• Programming B. Wegbreit Languages Editor
• Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs
• Efficient Algorithms for Deciding Properties of Heaps using STRAND
• A Robust Class of Context-Sensitive Languages Salvatore La Torre
• Playing Games with Boxes and Diamonds ? ?? Rajeev Alur 1 , Salvatore La Torre 2 , and P. Madhusudan 1
• Modelchecking Trace Event Structures P. Madhusudan
• Thread Contracts for Safe Parallelism Rajesh K. Karmani P. Madhusudan Brandon M. Moore
• Visibly Pushdown Games Christof Loding 1;? P. Madhusudan 2;?? Olivier Serre 1;?
• Timed control synthesis for external speci cations
• CONTROL AND SYNTHESIS OF OPEN REACTIVE SYSTEMS
• Synthesis of Interface Specifications for Java Classes Rajeev Alur Pavol
• Analyzing Recursive Programs using a Fixed-point Calculus Salvatore La Torre
• Theoretical Computer Science 354 (2006) 230249 www.elsevier.com/locate/tcs
• Distributed Controller Synthesis for Local Speci cations
• Controllers for Discrete Event Systems via P. Madhusudan 1 and P. S. Thiagarajan 2 ?
• Compositionality Entails Sequentializability Pranav Garg and P. Madhusudan
• PENELOPE: Weaving Threads to Expose Atomicity Violations
• Meta-analysis for Atomicity Violations under Nested Locking
• The Complexity of Predicting Atomicity Azadeh Farzan1
• CANDID: Dynamic Candidate Evaluations for Automatic Prevention of SQL Injection Attacks
• An Infinite Automaton Characterization of Double Exponential Time
• Monitoring Atomicity in Concurrent Programs Azadeh Farzan1
• Visibly Pushdown Automata for Streaming XML Viraj Kumar
• Causal Dataflow Analysis for Concurrent Programs
• The MSO Theory of Connectedly Communicating Processes
• Visibly Pushdown Languages Rajeev Alur P. Madhusudan
• Theoretical Computer Science 274 (2002) 117149 www.elsevier.com/locate/tcs
• Query Automata for Nested Words P. Madhusudan Mahesh Viswanathan
• Context-Bounded Analysis of Concurrent Queue Systems
• Query Automata for Nested Words P. Madhusudan and Mahesh Viswanathan
• Adding Nesting Structure to Words Rajeev Alur1
• Onthefly Verification for ProductLTL Deepak D'Souza \Lambda P. Madhusudan y
• A Fixpoint Calculus for Local and Global Program Flows Rajeev Alur
• ABSTRACT IN ENGLISH iii ABSTRACT IN TAMIL v
• Open Systems in Reactive Environments: Control and Synthesis ?
• The MSO Theory of Connectedly Communicating Processes
• Adding Nesting Structure to Words RAJEEV ALUR
• Congruences for Visibly Pushdown Languages # Rajeev Alur 1 , Viraj Kumar 2 , P. Madhusudan 2 , and Mahesh Viswanathan 2
• Causal Atomicity Azadeh Farzan P. Madhusudan
• Decidable Logics Combining Heap Structures and Data P. Madhusudan
• Synthesizing Monitors for Safety Properties This Time With Calls and Returns
• VEX: Vetting Browser Extensions For Security Vulnerabilities Sruthi Bandhakavi Samuel T. King P. Madhusudan Marianne Winslett
• Computational Learning Theory Learning Regular Languages
• Beyond Message Sequence Graphs P. Madhusudan 1 and B. Meenakshi 2
• A Temporal Logic of Nested Calls and Returns ? Rajeev Alur 1 , Kousha Etessami 2 , and P. Madhusudan 1
• The Tree Width of Auxiliary Storage P. Madhusudan
• Efficient Decision Procedures for Heaps using P. Madhusudan and Xiaokang Qiu
• Synthesizing Reactive Programs P. Madhusudan
• Recursive Proofs for Inductive Tree Data-Structures P. Madhusudan Xiaokang Qiu Andrei Stefanescu
• Recursive Proofs for Inductive Tree Data-Structures P. Madhusudan
• Reachability under Contextual Locking Rohit Chadha1