Database systems are widely used to store and query data. Test oracles have been
proposed to find logic bugs in such systems, that is, bugs that cause the database system to …

Removing bugs in programs–even when location of faulty statements is known–is tedious
and error-prone, particularly because of the increased likelihood of introducing new bugs as …

Given a grammar (or other sorts of meta-data), one can trivially derive combinatorially
exhaustive test-data sets up to a specified depth. Without further efforts, such test-data sets …

The ever increasing expansion of mobile applications into nearly every aspect of modern
life, from banking to healthcare systems, is making their security more important than ever …

Model transformations are central to Model-Driven Engineering (MDE), where they are used
to transform models between different languages; to refactor and simulate models; or to …

Database Management Systems (DBMSs) provide efficient data retrieval and manipulation
for many applications through Structured Query Language (SQL). Incorrect implementations …

An approach is described for checking the methods of a class against a full specification. It
shares with traditional model checking the idea of exhausting the entire space of executions …

SAT-based bounded verification of annotated code consists of translating the code together
with the annotations to a propositional formula, and analyzing the formula for specification …

Consensus algorithms are fundamental building blocks for fault-tolerant distributed systems
and their correctness is critical. However, there are currently no fully-automated methods for …

Systems code must obey many rules, such as" opened files must be closed." One approach
to verifying rules is static analysis, but this technique cannot infer precise runtime effects of …