default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDP. Madhusudan
Parthasarathy Madhusudan
Person information
- affiliation: University of Illinois, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j26]Adithya Murali
, Cody Rivera, P. Madhusudan:
Predictable Verification using Intrinsic Definitions. Proc. ACM Program. Lang. 8(PLDI): 1804-1829 (2024)- [i18]Adithya Murali, Cody Rivera, P. Madhusudan:
Predictable Verification using Intrinsic Definitions. CoRR abs/2404.04515 (2024) - 2023
- [j25]Paul Krogmeier, P. Madhusudan:
Languages with Decidable Learning: A Meta-theorem. Proc. ACM Program. Lang. 7(OOPSLA1): 143-171 (2023) - [j24]Adithya Murali, Lucas Peña, Ranjit Jhala, P. Madhusudan:
Complete First-Order Reasoning for Properties of Functional Programs. Proc. ACM Program. Lang. 7(OOPSLA2): 1063-1092 (2023) - [j23]Angello Astorga, Chiao Hsieh, P. Madhusudan, Sayan Mitra:
Perception Contracts for Safety of ML-Enabled Systems. Proc. ACM Program. Lang. 7(OOPSLA2): 2196-2223 (2023) - [j22]Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan:
A First-order Logic with Frames. ACM Trans. Program. Lang. Syst. 45(2): 7:1-7:44 (2023) - [i17]Paul Krogmeier, P. Madhusudan:
Languages With Decidable Learning: A Meta-Theorem. CoRR abs/2302.05741 (2023) - 2022
- [j21]Paul Krogmeier, Zhengyao Lin, Adithya Murali, P. Madhusudan:
Synthesizing axiomatizations using logic learning. Proc. ACM Program. Lang. 6(OOPSLA2): 1697-1725 (2022) - [j20]Adithya Murali, Lucas Peña, Eion Blanchard, Christof Löding, P. Madhusudan:
Model-guided synthesis of inductive lemmas for FOL with least fixpoints. Proc. ACM Program. Lang. 6(OOPSLA2): 1873-1902 (2022) - [j19]Paul Krogmeier, P. Madhusudan:
Learning formulas in finite variable logics. Proc. ACM Program. Lang. 6(POPL): 1-28 (2022) - [c89]Adithya Murali, Atharva Sehgal, Paul Krogmeier, P. Madhusudan:
Composing Neural Learning and Symbolic Reasoning with an Application to Visual Discrimination. IJCAI 2022: 3358-3365 - 2021
- [j18]Angello Astorga, Shambwaditya Saha, Ahmad Dinkins, Felicia Wang, P. Madhusudan, Tao Xie:
Synthesizing contracts correct modulo a test generator. Proc. ACM Program. Lang. 5(OOPSLA): 1-27 (2021) - [i16]Paul Krogmeier, P. Madhusudan:
Learning Formulas in Finite Variable Logics. CoRR abs/2111.03534 (2021) - 2020
- [j17]Daniel Neider, P. Madhusudan, Shambwaditya Saha, Pranav Garg, Daejun Park:
A Learning-Based Approach to Synthesizing Invariants for Incomplete Verification Engines. J. Autom. Reason. 64(7): 1523-1552 (2020) - [j16]Umang Mathur, Adithya Murali, Paul Krogmeier, P. Madhusudan, Mahesh Viswanathan:
Deciding memory safety for single-pass heap-manipulating programs. Proc. ACM Program. Lang. 4(POPL): 35:1-35:29 (2020) - [c88]Paul Krogmeier, Umang Mathur, Adithya Murali, P. Madhusudan, Mahesh Viswanathan:
Decidable Synthesis of Programs with Uninterpreted Functions. CAV (2) 2020: 634-657 - [c87]Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan:
A First-Order Logic with Frames. ESOP 2020: 515-543 - [c86]Umang Mathur, P. Madhusudan, Mahesh Viswanathan:
What's Decidable About Program Verification Modulo Axioms? TACAS (2) 2020: 158-177 - [i15]Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan:
Synthesizing Lemmas for Inductive Reasoning. CoRR abs/2009.10207 (2020)
2010 – 2019
- 2019
- [j15]Umang Mathur, P. Madhusudan, Mahesh Viswanathan:
Decidable verification of uninterpreted programs. Proc. ACM Program. Lang. 3(POPL): 46:1-46:29 (2019) - [c85]Faria Kalim, Karl Palmskog, Jayasi Mehar, Adithya Murali, Indranil Gupta, P. Madhusudan:
Kaizen: Building a Performant Blockchain System Verified for Consensus and Integrity. FMCAD 2019: 96-104 - [c84]Salvatore La Torre, Parthasarathy Madhusudan:
Reachability in Concurrent Uninterpreted Programs. FSTTCS 2019: 46:1-46:16 - [c83]Angello Astorga, P. Madhusudan, Shambwaditya Saha, Shiyu Wang, Tao Xie:
Learning stateful preconditions modulo a test generator. PLDI 2019: 775-787 - [c82]Daniel Neider, Shambwaditya Saha, Pranav Garg, P. Madhusudan:
Sorcar: Property-Driven Algorithms for Learning Conjunctive Invariants. SAS 2019: 323-346 - [i14]Christof Löding, P. Madhusudan, Adithya Murali, Lucas Peña:
A First Order Logic with Frames. CoRR abs/1901.09089 (2019) - [i13]Umang Mathur, Adithya Murali, Paul Krogmeier, P. Madhusudan, Mahesh Viswanathan:
Deciding Memory Safety for Forest Datastructures. CoRR abs/1907.00298 (2019) - [i12]Adithya Murali, P. Madhusudan:
Augmenting Neural Nets with Symbolic Synthesis: Applications to Few-Shot Learning. CoRR abs/1907.05878 (2019) - [i11]Paul Krogmeier, Umang Mathur, Adithya Murali, P. Madhusudan, Mahesh Viswanathan:
Decidable Synthesis of Programs with Uninterpreted Functions. CoRR abs/1910.09744 (2019) - [i10]Umang Mathur, P. Madhusudan, Mahesh Viswanathan:
What's Decidable About Program Verification Modulo Axioms? CoRR abs/1910.10889 (2019) - 2018
- [j14]P. Ezudheen, Daniel Neider, Deepak D'Souza, Pranav Garg, P. Madhusudan:
Horn-ICE learning for synthesizing invariants and contracts. Proc. ACM Program. Lang. 2(OOPSLA): 131:1-131:25 (2018) - [j13]Christof Löding, P. Madhusudan, Lucas Peña:
Foundations for natural proofs and quantifier instantiation. Proc. ACM Program. Lang. 2(POPL): 10:1-10:30 (2018) - [j12]Daniel Neider, Shambwaditya Saha, P. Madhusudan:
Compositional Synthesis of Piece-Wise Functions by Learning Classifiers. ACM Trans. Comput. Log. 19(2): 10:1-10:23 (2018) - [c81]P. Madhusudan, Umang Mathur, Shambwaditya Saha, Mahesh Viswanathan:
A Decidable Fragment of Second Order Logic With Applications to Synthesis. CSL 2018: 31:1-31:19 - [c80]P. Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey O. Shallit:
Lagrange's Theorem for Binary Squares. MFCS 2018: 18:1-18:14 - [c79]Daniel Neider, Pranav Garg, P. Madhusudan, Shambwaditya Saha, Daejun Park:
Invariant Synthesis for Incomplete Verification Engines. TACAS (1) 2018: 232-250 - [i9]Umang Mathur, P. Madhusudan, Mahesh Viswanathan:
Decidable Verification of Uninterpreted Programs. CoRR abs/1811.00192 (2018) - 2017
- [c78]Alex Gyori, Pranav Garg, Edgar Pek, P. Madhusudan:
Efficient Incrementalized Runtime Checking of Linear Measures on Lists. ICST 2017: 310-320 - [i8]Parthasarathy Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey O. Shallit:
Lagrange's Theorem for Binary Squares. CoRR abs/1710.04247 (2017) - [i7]P. Madhusudan, Umang Mathur, Shambwaditya Saha, Mahesh Viswanathan:
A Decidable Fragment of Second Order Logic With Applications to Synthesis. CoRR abs/1712.05513 (2017) - [i6]Daniel Neider, Pranav Garg, P. Madhusudan, Shambwaditya Saha, Daejun Park:
Invariant Synthesis for Incomplete Verification Engines. CoRR abs/1712.05581 (2017) - [i5]Deepak D'Souza, P. Ezudheen, Pranav Garg, P. Madhusudan, Daniel Neider:
Horn-ICE Learning for Synthesizing Invariants and Contracts. CoRR abs/1712.09418 (2017) - [i4]Edgar Pek, Pranav Garg, Muntasir Raihan Rahman, Karl Palmskog, Indranil Gupta, P. Madhusudan:
Inferring Formal Properties of Production Key-Value Stores. CoRR abs/1712.10056 (2017) - 2016
- [c77]Pranav Garg, Daniel Neider, P. Madhusudan, Dan Roth:
Learning invariants using decision trees and implication counterexamples. POPL 2016: 499-512 - [c76]Christof Löding, P. Madhusudan, Daniel Neider:
Abstract Learning Frameworks for Synthesis. TACAS 2016: 167-185 - [c75]Daniel Neider, Shambwaditya Saha, P. Madhusudan:
Synthesizing Piece-Wise Functions by Learning Classifiers. TACAS 2016: 186-203 - [e2]Pavol Cerný, Viktor Kuncak, Parthasarathy Madhusudan:
Proceedings Fourth Workshop on Synthesis, SYNT 2015, San Francisco, CA, USA, 18th July 2015. EPTCS 202, 2016 [contents] - 2015
- [j11]Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider:
Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists. Formal Methods Syst. Des. 47(1): 120-157 (2015) - [c74]Shambwaditya Saha, Pranav Garg, P. Madhusudan:
Alchemist: Learning Guarded Affine Functions. CAV (1) 2015: 440-446 - [c73]Shambwaditya Saha, Santhosh Prabhu, P. Madhusudan:
NetGen: synthesizing data-plane configurations for network policies. SOSR 2015: 17:1-17:6 - [p1]Rajeev Alur, Rastislav Bodík, Eric Dallal, Dana Fisman, Pranav Garg, Garvit Juniwal, Hadas Kress-Gazit, P. Madhusudan, Milo M. K. Martin, Mukund Raghothaman, Shambwaditya Saha, Sanjit A. Seshia, Rishabh Singh, Armando Solar-Lezama, Emina Torlak, Abhishek Udupa:
Syntax-Guided Synthesis. Dependable Software Systems Engineering 2015: 1-25 - [i3]Christof Löding, P. Madhusudan, Daniel Neider:
Abstract Learning Frameworks for Synthesis. CoRR abs/1507.05612 (2015) - 2014
- [j10]Emre Uzun, Vijayalakshmi Atluri, Jaideep Vaidya, Shamik Sural, Anna Lisa Ferrara, Gennaro Parlato, P. Madhusudan:
Security analysis for temporal role based access control. J. Comput. Secur. 22(6): 961-996 (2014) - [c72]Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider:
ICE: A Robust Framework for Learning Invariants. CAV 2014: 69-87 - [c71]Anna Lisa Ferrara, P. Madhusudan, Truc L. Nguyen, Gennaro Parlato:
Vac - Verifier of Administrative Role-Based Access Control Policies. CAV 2014: 184-191 - [c70]Andrew Cross, Balasubramanyan Ashok, Srinath Bala, Edward Cutrell, Naren Datha, Rahul Kumar, Viraj Kumar, Parthasarathy Madhusudan, Siddharth Prakash, Sriram K. Rajamani, Satish Sangameswaran, Deepika Sharma, William Thies:
Online learning versus blended learning: an exploratory study. L@S 2014: 179-180 - [c69]Ankush Desai, Pranav Garg, P. Madhusudan:
Natural proofs for asynchronous programs using almost-synchronous reductions. OOPSLA 2014: 709-725 - [c68]Edgar Pek, P. Madhusudan:
Explicit and symbolic techniques for fast and scalable points-to analysis. SOAP@PLDI 2014: 4:1-4:6 - [c67]Edgar Pek, Xiaokang Qiu, P. Madhusudan:
Natural proofs for data structure manipulation in C using separation logic. PLDI 2014: 440-451 - 2013
- [j9]Rémi Bonnet, Rohit Chadha, P. Madhusudan, Mahesh Viswanathan:
Reachability under Contextual Locking. Log. Methods Comput. Sci. 9(3) (2013) - [c66]Haohui Mai, Edgar Pek, Hui Xue, Samuel Talmadge King, Parthasarathy Madhusudan:
Verifying security invariants in ExpressOS. ASPLOS 2013: 293-304 - [c65]Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider:
Learning Universally Quantified Invariants of Linear Data Structures. CAV 2013: 813-829 - [c64]Xiaokang Qiu, Pranav Garg, Andrei Stefanescu, Parthasarathy Madhusudan:
Natural proofs for structure, data, and separation. PLDI 2013: 231-242 - [c63]Pranav Garg, P. Madhusudan, Gennaro Parlato:
Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists. SAS 2013: 172-193 - [c62]Anna Lisa Ferrara, P. Madhusudan, Gennaro Parlato:
Policy Analysis for Self-administrated Role-Based Access Control. TACAS 2013: 432-447 - [i2]Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider:
Learning Universally Quantified Invariants of Linear Data Structures. CoRR abs/1302.2273 (2013) - [i1]Pranav Garg, P. Madhusudan, Gennaro Parlato:
Quantified Data Automata on Skinny Trees: an Abstract Domain for Lists. CoRR abs/1304.0660 (2013) - 2012
- [c61]Anna Lisa Ferrara, P. Madhusudan, Gennaro Parlato:
Security Analysis of Role-Based Access Control through Program Verification. CSF 2012: 113-125 - [c60]Parthasarathy Madhusudan:
Automated Reasoning and Natural Proofs for Programs Manipulating Data Structures. FSTTCS 2012: 34-35 - [c59]Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Stefanescu:
Recursive proofs for inductive tree data-structures. POPL 2012: 123-136 - [c58]Emre Uzun, Vijayalakshmi Atluri, Shamik Sural, Jaideep Vaidya, Gennaro Parlato, Anna Lisa Ferrara, Parthasarathy Madhusudan:
Analyzing temporal role based access control models. SACMAT 2012: 177-186 - [c57]Azadeh Farzan, P. Madhusudan, Niloofar Razavi, Francesco Sorrentino:
Predicting null-pointer dereferences in concurrent programs. SIGSOFT FSE 2012: 47 - [c56]Rohit Chadha, P. Madhusudan, Mahesh Viswanathan:
Reachability under Contextual Locking. TACAS 2012: 437-450 - [c55]Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
Sequentializing Parameterized Programs. FIT 2012: 34-47 - [e1]P. Madhusudan, Sanjit A. Seshia:
Computer Aided Verification - 24th International Conference, CAV 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings. Lecture Notes in Computer Science 7358, Springer 2012, ISBN 978-3-642-31423-0 [contents] - 2011
- [j8]Sruthi Bandhakavi, Nandit Tiku, Wyatt Pittman, Samuel T. King, P. Madhusudan, Marianne Winslett:
Vetting browser extensions for security vulnerabilities with VEX. Commun. ACM 54(9): 91-99 (2011) - [j7]Rajeev Alur, Swarat Chaudhuri, P. Madhusudan:
Software model checking using languages of nested trees. ACM Trans. Program. Lang. Syst. 33(5): 15:1-15:45 (2011) - [c54]Parthasarathy Madhusudan:
Synthesizing Reactive Programs. CSL 2011: 428-442 - [c53]P. Madhusudan, Gennaro Parlato:
The tree width of auxiliary storage. POPL 2011: 283-294 - [c52]P. Madhusudan, Gennaro Parlato, Xiaokang Qiu:
Decidable logics combining heap structures and data. POPL 2011: 611-622 - [c51]Rajesh K. Karmani, P. Madhusudan, Brandon M. Moore:
Thread contracts for safe parallelism. PPoPP 2011: 125-134 - [c50]P. Madhusudan, Xiaokang Qiu:
Efficient Decision Procedures for Heaps Using STRAND. SAS 2011: 43-59 - [c49]Pranav Garg, P. Madhusudan:
Compositionality Entails Sequentializability. TACAS 2011: 26-40 - 2010
- [j6]Prithvi Bisht, Parthasarathy Madhusudan, V. N. Venkatakrishnan:
CANDID: Dynamic candidate evaluations for automatic prevention of SQL injection attacks. ACM Trans. Inf. Syst. Secur. 13(2): 14:1-14:39 (2010) - [c48]Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces. CAV 2010: 629-644 - [c47]Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato:
The Language Theory of Bounded Context-Switching. LATIN 2010: 96-107 - [c46]Francesco Sorrentino, Azadeh Farzan, P. Madhusudan:
PENELOPE: weaving threads to expose atomicity violations. SIGSOFT FSE 2010: 37-46 - [c45]Sruthi Bandhakavi, Samuel T. King, P. Madhusudan, Marianne Winslett:
VEX: Vetting Browser Extensions for Security Vulnerabilities. USENIX Security Symposium 2010: 339-354
2000 – 2009
- 2009
- [j5]Rajeev Alur, P. Madhusudan:
Adding nesting structure to words. J. ACM 56(3): 16:1-16:43 (2009) - [c44]Azadeh Farzan, P. Madhusudan, Francesco Sorrentino:
Meta-analysis for Atomicity Violations under Nested Locking. CAV 2009: 248-262 - [c43]Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability. CAV 2009: 477-492 - [c42]P. Madhusudan, Mahesh Viswanathan:
Query Automata for Nested Words. MFCS 2009: 561-573 - [c41]Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato:
Analyzing recursive programs using a fixed-point calculus. PLDI 2009: 211-222 - [c40]Azadeh Farzan, P. Madhusudan:
The Complexity of Predicting Atomicity Violations. TACAS 2009: 155-169 - 2008
- [j4]Wonhong Nam, P. Madhusudan, Rajeev Alur:
Automatic symbolic compositional verification by learning assumptions. Formal Methods Syst. Des. 32(3): 207-234 (2008) - [c39]Azadeh Farzan, P. Madhusudan:
Monitoring Atomicity in Concurrent Programs. CAV 2008: 52-65 - [c38]Lars E. Olson, Carl A. Gunter, P. Madhusudan:
A formal framework for reflective database access control policies. CCS 2008: 289-298 - [c37]Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
An Infinite Automaton Characterization of Double Exponential Time. CSL 2008: 33-48 - [c36]Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
Context-Bounded Analysis of Concurrent Queue Systems. TACAS 2008: 299-314 - 2007
- [c35]Sruthi Bandhakavi, Prithvi Bisht, P. Madhusudan, V. N. Venkatakrishnan:
CANDID: preventing sql injection attacks using dynamic candidate evaluations. CCS 2007: 12-24 - [c34]Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato:
A Robust Class of Context-Sensitive Languages. LICS 2007: 161-170 - [c33]Azadeh Farzan, P. Madhusudan:
Causal Dataflow Analysis for Concurrent Programs. TACAS 2007: 102-116 - [c32]P. Madhusudan:
Learning Algorithms and Formal Verification (Invited Tutorial). VMCAI 2007: 214 - [c31]Viraj Kumar, P. Madhusudan, Mahesh Viswanathan:
Visibly pushdown automata for streaming XML. WWW 2007: 1053-1062 - 2006
- [j3]Rajeev Alur, Salvatore La Torre, P. Madhusudan:
Modular strategies for recursive game graphs. Theor. Comput. Sci. 354(2): 230-249 (2006) - [c30]Azadeh Farzan, P. Madhusudan:
Causal Atomicity. CAV 2006: 315-328 - [c29]Rajeev Alur, Swarat Chaudhuri, P. Madhusudan:
Languages of Nested Trees. CAV 2006: 329-342 - [c28]Viraj Kumar, P. Madhusudan, Mahesh Viswanathan:
Minimization, Learning, and Conformance Testing of Boolean Programs. CONCUR 2006: 203-217 - [c27]Rajeev Alur, P. Madhusudan:
Adding Nesting Structure to Words. Developments in Language Theory 2006: 1-13 - [c26]Rajeev Alur, Swarat Chaudhuri, P. Madhusudan:
A fixpoint calculus for local and global program flows. POPL 2006: 153-165 - 2005
- [j2]Rajeev Alur, P. Madhusudan, Wonhong Nam:
Symbolic computational techniques for solving games. Int. J. Softw. Tools Technol. Transf. 7(2): 118-128 (2005) - [c25]Rajeev Alur, P. Madhusudan, Wonhong Nam:
Symbolic Compositional Verification by Learning Assumptions. CAV 2005: 548-562 - [c24]P. Madhusudan, P. S. Thiagarajan, Shaofa Yang:
The MSO Theory of Connectedly Communicating Processes. FSTTCS 2005: 201-212 - [c23]Rajeev Alur, Salvatore La Torre, P. Madhusudan:
Perturbed Timed Automata. HSCC 2005: 70-85 - [c22]Rajeev Alur, Viraj Kumar, P. Madhusudan, Mahesh Viswanathan:
Congruences for Visibly Pushdown Languages. ICALP 2005: 1102-1114 - [c21]Rajeev Alur, Pavol Cerný, P. Madhusudan, Wonhong Nam:
Synthesis of interface specifications for Java classes. POPL 2005: 98-109 - [c20]Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P. Madhusudan:
On-the-Fly Reachability and Cycle Detection for Recursive State Machines. TACAS 2005: 61-76 - 2004
- [c19]Christof Löding, P. Madhusudan, Olivier Serre:
Visibly Pushdown Games. FSTTCS 2004: 408-420 - [c18]Rajeev Alur, Mikhail Bernadsky, P. Madhusudan:
Optimal Reachability for Weighted Timed Games. ICALP 2004: 122-133 - [c17]Rajeev Alur, P. Madhusudan:
Decision Problems for Timed Automata: A Survey. SFM 2004: 1-24 - [c16]Rajeev Alur, P. Madhusudan:
Visibly pushdown languages. STOC 2004: 202-211 - [c15]Rajeev Alur, Kousha Etessami, P. Madhusudan:
A Temporal Logic of Nested Calls and Returns. TACAS 2004: 467-481 - 2003
- [c14]Rajeev Alur, Salvatore La Torre, P. Madhusudan:
Modular Strategies for Infinite Games on Recursive Graphs. CAV 2003: 67-79 - [c13]Patricia Bouyer, Deepak D'Souza, P. Madhusudan, Antoine Petit:
Timed Control with Partial Observability. CAV 2003: 180-192 - [c12]Rajeev Alur, Salvatore La Torre, P. Madhusudan:
Playing Games with Boxes and Diamonds. CONCUR 2003: 127-141 - [c11]P. Madhusudan:
Model-checking Trace Event Structures. LICS 2003: 371-380 - [c10]Rajeev Alur, Salvatore La Torre, P. Madhusudan:
Modular Strategies for Recursive Game Graphs. TACAS 2003: 363-378 - [c9]P. Madhusudan, Wonhong Nam, Rajeev Alur:
Symbolic computational techniques for solving games. BMC@CAV 2003: 578-592 - 2002
- [j1]P. Madhusudan, P. S. Thiagarajan:
Branching time controllers for discrete event systems. Theor. Comput. Sci. 274(1-2): 117-149 (2002) - [c8]P. Madhusudan, P. S. Thiagarajan:
A Decidable Class of Asynchronous Distributed Controllers. CONCUR 2002: 145-160 - [c7]Martin Leucker, P. Madhusudan, Supratik Mukhopadhyay:
Dynamic Message Sequence Charts. FSTTCS 2002: 253-264 - [c6]Deepak D'Souza, P. Madhusudan:
Timed Control Synthesis for External Specifications. STACS 2002: 571-582 - 2001
- [c5]P. Madhusudan, B. Meenakshi:
Beyond Message Sequence Graphs. FSTTCS 2001: 256-267 - [c4]P. Madhusudan, P. S. Thiagarajan:
Distributed Controller Synthesis for Local Specifications. ICALP 2001: 396-407 - [c3]P. Madhusudan:
Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs. ICALP 2001: 809-820 - 2000
- [c2]Orna Kupferman, P. Madhusudan, P. S. Thiagarajan, Moshe Y. Vardi:
Open Systems in Reactive Environments: Control and Synthesis. CONCUR 2000: 92-107
1990 – 1999
- 1998
- [c1]P. Madhusudan, P. S. Thiagarajan:
Controllers for Discrete Event Systems via Morphisms. CONCUR 1998: 18-33
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-10-07 21:18 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:
