Year |
Citation |
Score |
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 |
0.317 |
|
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 |
0.351 |
|
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 |
0.655 |
|
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 |
0.585 |
|
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 |
0.389 |
|
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 |
0.417 |
|
2006 |
Emerson EA, Hager KD, Konieczka JH. Molecular model checking International Journal of Foundations of Computer Science. 17: 733-741. DOI: 10.1142/S0129054106004078 |
0.325 |
|
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 |
0.36 |
|
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 |
0.388 |
|
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 |
0.599 |
|
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 |
0.595 |
|
2005 |
Sahoo D, Jain J, Iyer SK, Dill DL, Emerson EA. Multi-threaded reachability Proceedings - Design Automation Conference. 467-470. |
0.56 |
|
2005 |
Emerson EA, Wahl T. Dynamic symmetry reduction Lecture Notes in Computer Science. 3440: 382-396. |
0.585 |
|
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 |
0.394 |
|
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 |
0.621 |
|
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. |
0.733 |
|
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. |
0.329 |
|
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 |
0.385 |
|
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.43 |
|
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 |
0.722 |
|
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. |
0.756 |
|
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 |
0.389 |
|
2000 |
Emerson EA. Automated formal methods: model checking and beyond Acm Sigsoft Software Engineering Notes. 25: 49. DOI: 10.1145/340855.340886 |
0.394 |
|
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. |
0.339 |
|
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. |
0.751 |
|
1999 |
Emerson EA, Jutla CS. The Complexity of Tree Automata and Logics of Programs Siam Journal On Computing. 29: 132-158. DOI: 10.1137/S0097539793304741 |
0.382 |
|
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.372 |
|
1998 |
Attie PC, Emerson EA. Synthesis of concurrent systems with many similar processes Acm Transactions On Programming Languages and Systems. 20: 51-115. DOI: 10.1145/271510.271519 |
0.336 |
|
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.336 |
|
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 |
0.31 |
|
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.375 |
|
1992 |
Emerson EA, Mok AK, Sistla AP, Srinivasan J. Quantitative temporal reasoning Real-Time Systems. 4: 331-352. DOI: 10.1007/BF00355298 |
0.322 |
|
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 |
0.358 |
|
1987 |
Emerson EA, Lei C. Modalities for model checking: branching time logic strikes back Science of Computer Programming. 8: 275-306. DOI: 10.1016/0167-6423(87)90036-0 |
0.47 |
|
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.594 |
|
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 |
0.376 |
|
1983 |
Emerson EA. Alternative semantics for temporal logics Theoretical Computer Science. 26: 121-130. DOI: 10.1016/0304-3975(83)90082-8 |
0.366 |
|
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 |
0.614 |
|
Show low-probability matches. |