|
Search the dblp DataBase
Nina Amla:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Nina Amla, E. Allen Emerson, Robert P. Kurshan, Kedar S. Namjoshi
Rtdt: A Front-End for Efficient Model Checking of Synchronous Timing Diagrams. [Citation Graph (0, 0)][DBLP] CAV, 2001, pp:387-390 [Conf]
- Nina Amla, Xiaoqun Du, Andreas Kuehlmann, Robert P. Kurshan, Kenneth L. McMillan
An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment. [Citation Graph (0, 0)][DBLP] CHARME, 2005, pp:254-268 [Conf]
- Nina Amla, E. Allen Emerson, Kedar S. Namjoshi
Efficient Decompositional Model Checking for Regular Timing Diagrams. [Citation Graph (0, 0)][DBLP] CHARME, 1999, pp:67-81 [Conf]
- Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Richard J. Trefler
Abstract Patterns of Compositional Reasoning. [Citation Graph (0, 0)][DBLP] CONCUR, 2003, pp:423-438 [Conf]
- Nina Amla, E. Allen Emerson, Robert P. Kurshan, Kedar S. Namjoshi
Model Checking Synchronous Timing Diagrams. [Citation Graph (0, 0)][DBLP] FMCAD, 2000, pp:283-298 [Conf]
- Nina Amla, Kenneth L. McMillan
A Hybrid of Counterexample-Based and Proof-Based Abstraction. [Citation Graph (0, 0)][DBLP] FMCAD, 2004, pp:260-274 [Conf]
- Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Richard J. Trefler
Visual Specifications for Modular Reasoning about Asynchronous Systems. [Citation Graph (0, 0)][DBLP] FORTE, 2002, pp:226-242 [Conf]
- Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Richard J. Trefler
Assume-Guarantee Based Compositional Reasoning for Synchronous Timing Diagrams. [Citation Graph (0, 0)][DBLP] TACAS, 2001, pp:465-479 [Conf]
- Nina Amla, Robert P. Kurshan, Kenneth L. McMillan, Ricardo Medel
Experimental Analysis of Different Techniques for Bounded Model Checking. [Citation Graph (0, 0)][DBLP] TACAS, 2003, pp:34-48 [Conf]
- Kenneth L. McMillan, Nina Amla
Automatic Abstraction without Counterexamples. [Citation Graph (0, 0)][DBLP] TACAS, 2003, pp:2-17 [Conf]
- Nina Amla, Kenneth L. McMillan
Combining Abstraction Refinement and SAT-Based Model Checking. [Citation Graph (0, 0)][DBLP] TACAS, 2007, pp:405-419 [Conf]
A Single-Instance Incremental SAT Formulation of Proof- and Counterexample-Based Abstraction [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|