E Allen Emerson - Publications

Affiliations: 
University of Texas at Austin, Austin, Texas, U.S.A. 
Area:
Computer Science

62 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2013 Olivo O, Emerson EA. Improved binary decision diagram constraint propagation for satisfiability problems Proceedings - International Conference of the Chilean Computer Science Society, Sccc. 95-104. DOI: 10.1109/SCCC.2012.41  1
2011 Deshmukh JV, Emerson EA, Sankaranarayanan S. Symbolic modular deadlock analysis Automated Software Engineering. 18: 325-362. DOI: 10.1007/s10515-011-0085-0  1
2011 Emerson EA, Samanta R. An algorithmic framework for synthesis of concurrent programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6996: 522-530. DOI: 10.1007/978-3-642-24372-1_41  1
2011 Olivo O, Emerson EA. A more efficient BDD-based QBF solver Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6876: 675-690. DOI: 10.1007/978-3-642-23786-7_51  1
2010 Emerson EA. Meanings of model checking Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5930: 237-249. DOI: 10.1007/978-3-642-11512-7_15  1
2009 Clarke EM, Emerson EA, Sifakis J. Model checking: Algorithmic verification and debugging Communications of the Acm. 52: 74-84. DOI: 10.1145/1592761.1592781  1
2009 Deshmukh J, Emerson EA. Verification of recursive methods on tree-like data structures 9th International Conference Formal Methods in Computer Aided Design, Fmcad 2009. 33-40. DOI: 10.1109/FMCAD.2009.5351144  1
2009 Deshmukh J, Emerson EA, Sankaranarayanan S. Symbolic deadlock analysis in concurrent libraries and their clients Ase2009 - 24th Ieee/Acm International Conference On Automated Software Engineering. 480-491. DOI: 10.1109/ASE.2009.14  1
2008 Samanta R, Deshmukh JV, Emerson EA. Automatic generation of local repairs for boolean programs Proceedings of the 2008 International Conference On Formal Methods in Computer-Aided Design, Fmcad. DOI: 10.1109/FMCAD.2008.ECP.31  1
2008 Wahl T, Blanc N, Emerson EA. SVISS: Symbolic verification of symmetric systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4963: 459-462. DOI: 10.1007/978-3-540-78800-3_34  1
2008 Emerson EA. The beginning of model checking: A personal perspective Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5000: 27-45. DOI: 10.1007/978-3-540-69850-0_2  1
2007 Vasudevan S, Emerson EA, Abraham JA. Improved verification of hardware designs through antecedent conditioned slicing International Journal On Software Tools For Technology Transfer. 9: 89-101. DOI: 10.1007/S10009-006-0022-X  1
2006 Emerson EA, Hager KD, Konieczka JH. Molecular model checking International Journal of Foundations of Computer Science. 17: 733-741. DOI: 10.1142/S0129054106004078  1
2006 Iyer S, Sahoo D, Emerson EA, Jain J. On partitioning and symbolic model checking Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 25: 780-788. DOI: 10.1109/Tcad.2006.870410  1
2006 Iyer S, Jain J, Sahoo D, Emerson EA. Under-approximation heuristics for grid-based bounded model checking Electronic Notes in Theoretical Computer Science. 135: 31-46. DOI: 10.1016/J.Entcs.2005.10.017  1
2006 Emerson EA, Namjoshi KS. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics: Preface Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3855.  1
2005 Vasudevan S, Emerson EA, Abraham JA. Efficient model checking of hardware using conditioned slicing Electronic Notes in Theoretical Computer Science. 128: 279-294. DOI: 10.1016/J.Entcs.2005.04.017  1
2005 Emerson EA, Wahl T. Efficient Reduction Techniques for Systems with Many Components Electronic Notes in Theoretical Computer Science. 130: 379-399. DOI: 10.1016/J.Entcs.2005.03.019  1
2005 Sahoo D, Jain J, Iyer SK, Dill D, Emerson EA. Predictive reachability using a sample-based approach Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3725: 388-392. DOI: 10.1007/11560548_38  1
2005 Emerson EA, Wahl T. Dynamic symmetry reduction Lecture Notes in Computer Science. 3440: 382-396.  1
2005 Sahoo D, Jain J, Iyer SK, Dill DL, Emerson EA. Multi-threaded reachability Proceedings - Design Automation Conference. 467-470.  1
2004 Attie PC, Arora A, Emerson EA. Synthesis of Fault-Tolerant Concurrent Programs Acm Transactions On Programming Languages and Systems. 26: 125-185. DOI: 10.1145/963778.963782  1
2003 Emerson EA, Namjoshi KS. On reasoning about rings International Journal of Foundations of Computer Science. 14: 527-549. DOI: 10.1142/S0129054103001881  1
2003 Emerson EA, Kahlon V. Exact and efficient verification of parameterized cache coherence protocols Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2860: 247-262. DOI: 10.1007/978-3-540-39724-3_22  1
2003 Emerson EA, Wahl T. On combining symmetry reduction and symbolic representation for efficient model checking Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2860: 216-230. DOI: 10.1007/978-3-540-39724-3_20  1
2003 Amla N, Emerson EA, Namjoshi K, Trefler R. Abstract patterns of compositional reasoning Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2761: 431-445.  1
2003 Emerson EA, Kahlon V. Model checking guarded protocols Proceedings - Symposium On Logic in Computer Science. 361-370.  1
2003 Emerson EA, Kahlon V. Rapid parameterized model checking of snoopy cache coherence protocols Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2619: 144-159.  1
2002 Emerson EA, Kahlon V. Model checking large-scale and parameterized resource allocation systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2280: 251-265.  1
2001 Attie PC, Emerson EA. Synthesis of Concurrent Programs for an Atomic Read/Write Model of Computation Acm Transactions On Programming Languages and Systems. 23: 187-242. DOI: 10.1145/383043.383044  1
2001 Emerson EA, Jutla CS, Sistla AP. On model checking for the m-calculus and its fragments Theoretical Computer Science. 258: 491-522. DOI: 10.1016/S0304-3975(00)00034-7  0.6
2001 Amla N, Emerson EA, Kurshan RP, Namjoshi K. RTDT: A front-end for efficient model checking of synchronous timing diagrams Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2102: 387-390. DOI: 10.1007/3-540-44585-4_38  1
2001 Amla N, Emerson EA, Namjoshi K, Trefler R. Assume-guarantee based compositional reasoning for synchronous timing diagrams Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2031: 465-479.  1
2000 Sistla AP, Gyuris V, Emerson EA. SMC: A symmetry-based model checker for verification of safety and liveness properties Acm Transactions On Software Engineering and Methodology. 9: 133-166. DOI: 10.1145/350887.350891  1
2000 Emerson EA, Kahlon V. Reducing model checking of the many to the few Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 1831: 236-254.  1
2000 Amla N, Emerson EA, Kurshan RP, Namjoshi KS. Model checking synchronous timing diagrams Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1954: 283-298.  1
2000 Emerson EA. Model checking: Theory into practice Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1974: 1-10.  1
1999 Amla N, Allen Emerson E, Namjoshi KS. Efficient decompositional model checking for regular timing diagrams Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1703: 67-81. DOI: 10.1007/3-540-48153-2_7  0.68
1999 Emerson EA, Trefler RJ. From asymmetry to full symmetry: New techniques for symmetry reduction in model checking Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1703: 142-157. DOI: 10.1007/3-540-48153-2_12  0.56
1999 Emerson EA, Jutla CS. Complexity of tree automata and logics of programs Siam Journal On Computing. 29: 132-158.  1
1998 Clarke EM, Emerson EA, Jha S, Sistla AP. Symmetry reductions in model checking Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1427: 147-158.  1
1998 Emerson EA, Namjoshi KS. Verification of a parameterized bus arbitration protocol Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1427: 452-463.  1
1998 Emerson EA, Trefler RJ. Model checking real-time properties of symmetric systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1450: 427-436.  1
1997 Emerson EA, Trefler RJ. Generalized quantitative temporal reasoning: An automata-theoretic approach Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1214: 189-200.  0.56
1997 Emerson EA, Sistla AP. Utilizing Symmetry when Model-Checking under Fairness Assumptions: An Automata-Theoretic Approach Acm Transactions On Programming Languages and Systems. 19: 617-638.  1
1996 Attie PC, Singh MP, Emerson EA, Sheth A, Rusinkiewicz M. Scheduling workflows by enforcing intertask dependencies Distributed Systems Engineering. 3: 222-238. DOI: 10.1088/0967-1846/3/4/003  1
1996 Emerson EA, Sistla AP. Symmetry and model checking Formal Methods in System Design. 9: 105-131.  1
1995 Emerson EA. Methods for Mu-calculus model checking: A tutorial Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 939: 141.  1
1995 Emerson EA. Model checking and efficient automation of temporal reasoning Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 962: 393-394.  1
1995 Emerson EA, Sistla AP. Utilizing symmetry when model checking under fairness assumptions: An automata-theoretic approach Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 939: 309-324.  1
1993 Wang F, Mok AK, Emerson EA. Distributed Real-Time System Specification and Verification in APTL Acm Transactions On Software Engineering and Methodology (Tosem). 2: 346-378. DOI: 10.1145/158431.158434  0.56
1992 Emerson EA, Mok AK, Sistla AP, Srinivasan J. Quantitative temporal reasoning Real-Time Systems. 4: 331-352. DOI: 10.1007/BF00355298  1
1991 Emerson EA, Jutla CS. Tree automata, mu-calculus and determinacy Annual Symposium On Foundations of Computer Science (Proceedings). 368-377.  1
1989 Streett RS, Emerson EA. An automata theoretic decision procedure for the propositional mu-calculus Information and Computation. 81: 249-264. DOI: 10.1016/0890-5401(89)90031-X  1
1987 Emerson EA. Uniform inevitability is tree automation ineffable Information Processing Letters. 24: 77-79. DOI: 10.1016/0020-0190(87)90097-4  1
1986 Clarke EM, Emerson EA, Sistla AP. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications Acm Transactions On Programming Languages and Systems (Toplas). 8: 244-263. DOI: 10.1145/5397.5399  0.56
1986 Emerson EA, Halpern JY. “Sometimes” and “Not Never” Revisited: On Branching Versus Linear Time Temporal Logic Journal of the Acm (Jacm). 33: 151-178. DOI: 10.1145/4904.4999  1
1985 Emerson EA, Halpern JY. Decision procedures and expressiveness in the temporal logic of branching time Journal of Computer and System Sciences. 30: 1-24. DOI: 10.1016/0022-0000(85)90001-7  1
1984 Emerson EA, Sistla AP. Deciding full branching time logic Information and Control. 61: 175-201. DOI: 10.1016/S0019-9958(84)80047-9  1
1983 Emerson EA. Alternative semantics for temporal logics Theoretical Computer Science. 26: 121-130. DOI: 10.1016/0304-3975(83)90082-8  1
1983 Clarke EM, Emerson EA, Sistla AP. AUTOMATIC VERIFICATION OF FINITE STATE CONCURRENT SYSTEMS USING TEMPORAL LOGIC SPECIFICATIONS: A PRACTICAL APPROACH Conference Record of the Annual Acm Symposium On Principles of Programming Languages. 117-126.  1
1982 Emerson EA, Clarke EM. Using branching time temporal logic to synthesize synchronization skeletons Science of Computer Programming. 2: 241-266. DOI: 10.1016/0167-6423(83)90017-5  1
Show low-probability matches.