Refinement of structural heuristics for model checking of concurrent programs through data mining

2017 ◽  
Vol 47 ◽  
pp. 170-188 ◽  
Author(s):  
Reed Milewicz ◽  
Peter Pirkelbauer
Keyword(s):  
Data Mining ◽  
Model Checking ◽  
Concurrent Programs

Model Checking Concurrent Programs

2018 ◽  
pp. 573-611 ◽  
Author(s):  
Aarti Gupta ◽  
Vineet Kahlon ◽  
Shaz Qadeer ◽  
Tayssir Touili
Keyword(s):  
Model Checking ◽  
Concurrent Programs

scholarly journals Preface to the special issue on improving software quality through program analysis

2021 ◽  
Author(s):  
Matthias Güdemann ◽  
Leonardo Mariani
Keyword(s):  
Data Mining ◽  
Model Checking ◽  
Software Quality ◽  
Program Analysis ◽  
Combine Model ◽  
Test Case Generation ◽  
Functional Equivalence ◽  
Test Case ◽  
Special Issue ◽  
Software Applications

AbstractThis special issue is dedicated to the presentation of novel results in the scope of program analysis, verification, and testing of software to improve its quality. The papers included in the special issue present approaches that successfully combine model-based test case generation, reasoning about functional equivalence, data mining, classification, and the combination of abstraction with model-checking, to address real software applications in realistic settings.

scholarly journals Dartagnan: Bounded Model Checking for Weak Memory Models (Competition Contribution)

2020 ◽  
pp. 378-382
Author(s):  
Hernán Ponce-de-León ◽  
Florian Furbach ◽  
Keijo Heljanko ◽  
Roland Meyer
Keyword(s):  
Model Checking ◽  
Bounded Model Checking ◽  
Memory Models ◽  
Memory Model ◽  
Complete Analysis ◽  
Concurrent Programs ◽  
Sequential Consistency ◽  
Model Checker ◽  
Safety Properties ◽  
C Programs

Abstract Dartagnanis a bounded model checker for concurrent programs under weak memory models. What makes it different from other tools is that the memory model is not hard-coded inside Dartagnanbut taken as part of the input. For SV-COMP’20, we take as input sequential consistency (i.e. the standard interleaving memory model) extended by support for atomic blocks. Our point is to demonstrate that a universal tool can be competitive and perform well in SV-COMP. Being a bounded model checker, Dartagnan’s focus is on disproving safety properties by finding counterexample executions. For programs with bounded loops, Dartagnanperforms an iterative unwinding that results in a complete analysis. The SV-COMP’20 version of Dartagnanworks on Boogiecode. The C programs of the competition are translated internally to Boogieusing SMACK.

Sign in / Sign up

Export Citation Format

Share Document