Author:Natasha Sharygina

Publications
Lookahead-Based SMT Solving Antti Hyvärinen, Matteo Marescotti, Parvin Sadigova, Hana Chockler and Natasha Sharygina In:LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Function Summarization Modulo Theories Sepideh Asadi, Martin Blicha, Grigory Fedyukovich, Antti Hyvärinen, Karine Even-Mendoza, Natasha Sharygina and Hana Chockler In:LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
SMTS: Distributed, Visualized Constraint Solving Matteo Marescotti, Antti Hyvärinen and Natasha Sharygina In:LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Acceleration-based safety decision procedure for programs with arrays Francesco Alberti, Silvio Ghilardi and Natasha Sharygina In:LPAR-19. 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Reachability Modulo Theory Library Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise and Natasha Sharygina In:SMT 2012. 10th International Workshop on Satisfiability Modulo Theories
Loopfrog — loop summarization for static analysis Daniel Kroening, Natasha Sharygina, Stefano Tonetta, Aliaksei Tsitovich and Christoph M. Wintersteiger In:WING 2010. Workshop on Invariant Generation 2010

Keyphrases

acceleration, Algorithm Portfolios, arrays, Bounded Model Checking, clause learning, Craig interpolation, Distributed IC3, Distributed SMT, Divide and Conquer, Function Summaries, incremental verification, Lookahead Heuristic, loop invariants, loop summarization, Loopfrog, model checking, Reachability Modulo Theories, Satisfiability Modulo Theories, SMT, SMT-LIB, SMT solving, software verification, static analysis, web-based GUI.