scholarly journals Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers

2009 ◽  
pp. 509-524 ◽  
Author(s):  
Shuvendu K. Lahiri ◽  
Shaz Qadeer ◽  
Zvonimir Rakamarić
Keyword(s):  
Smt Solvers ◽  
Concurrency Errors

scholarly journals On the unusual effectiveness of type-aware operator mutations for testing SMT solvers

2020 ◽  
Vol 4 (OOPSLA) ◽  
pp. 1-25
Author(s):  
Dominik Winterer ◽  
Chengyu Zhang ◽  
Zhendong Su
Keyword(s):  
Smt Solvers

scholarly journals Isolating and understanding concurrency errors using reconstructed execution fragments

2012 ◽  
Vol 47 (6) ◽  
pp. 378 ◽  
Author(s):  
Brandon Lucia ◽  
Benjamin P. Wood ◽  
Luis Ceze
Keyword(s):  
Concurrency Errors

scholarly journals Integration of SMT-solvers in B and Event-B development environments

2013 ◽  
Vol 78 (3) ◽  
pp. 310-326 ◽  
Author(s):  
David Déharbe
Keyword(s):  
Smt Solvers

scholarly journals Making Automatic Theorem Provers more Versatile

10.29007/n6j7 ◽  
2018 ◽  
Author(s):  
Simon Cruanes
Keyword(s):  
Higher Order ◽  
Order Logic ◽  
Higher Order Logic ◽  
Research Directions ◽  
First Order ◽  
Theorem Provers ◽  
Smt Solvers ◽  
Automatic Theorem Provers ◽  
Automatic Theorem

We argue that automatic theorem provers should become more versatile and should be able to tackle problems expressed in richer input formats. Salient research directions include (i) developing tight combinations of SMT solvers and first-order provers; (ii) adding better handling of theories in first-order provers; (iii) adding support for inductive proving; (iv) adding support for user-defined theories and functions; and (v) bringing to the provers some basic abilities to deal with logics beyond first-order, such as higher-order logic.

Sign in / Sign up

Export Citation Format

Share Document