Transition Power Abstractions for Deep Counterexample Detection, Blicha, Martin, Fedyukovich Grigory, Hyvärinen Antti E. J., and Sharygina Natasha , TACAS, (2022)

• Google Scholar
• BibTeX

Theory-Specific Proof Steps Witnessing Correctness of SMT Executions, Otoni, Rodrigo, Blicha Martin, Eugster Patrick, Hyvärinen Antti E. J., and Sharygina Natasha , DAC 2021 - 58th Design Automation Conference, 11/2021, San Francisco, CA, USA, (2021)

• Google Scholar
• BibTeX

Theory Refinement for Program Verification, Hyvärinen, Antti E. J., Asadi Sepideh, Even Mendoza Karine, Fedyukovich Grigory, Chockler Hana, and Sharygina Natasha , SAT 2017, Melbourne, Australia, (2017)

• Google Scholar
• BibTeX

Towards completeness in Bounded Model Checking through Automatic Recursion Depth Detection, Fedyukovich, Grigory, and Sharygina Natasha , Brazilian Symposium on Formal Methods (SBMF), Maceio, Brazil., (2014)

• Google Scholar
• BibTeX

Termination Analysis with Compositional Transition Invariants, Kroening, D., Sharygina Natasha, Tsitovich A., and Wintersteiger C.M. , International Conference on Computer-Aided Verification (CAV), Edinburgh, UK, (2010)

• Google Scholar
• BibTeX