Model Checking of Concurrent Software Systems via Heuristic-Guided SAT Solving

In this paper, we present a constraint-oriented state-based proof methodology for concurrent software systems which exploits compositionality and abstraction for the reduction of the verification problem under investigation. Formal basis for this methodology are Modal Transition Systems allowing loose state-based specifications, which can be refined by successively adding constraints. Key concepts of our method are projective views, separation of proof obligations, Skolemization and abstraction. The method is even applicable to real time systems

Download Full-text

A Quantitative Partial Model-Checking Function and Its Optimisation

10.29007/rb2p ◽

2018 ◽

Author(s):

Stefano Bistarelli ◽

Fabio Martinelli ◽

Ilaria Matteucci ◽

Francesco Santini

Keyword(s):

Model Checking ◽

Modal Logic ◽

Algebraic Structure ◽

Process Algebra ◽

Software Systems ◽

Efficient Tool ◽

Combinatorial Explosion ◽

Loosely Coupled ◽

Partial Model ◽

Final Score

Partial Model-Checking (PMC) is an efficient tool to reduce the combinatorial explosion of a state-space, arising in the verification of loosely-coupled software systems. At the same time, it is useful to consider quantitative temporal-modalities. This allows for checking whether satisfying such a desired modality is too costly, by comparing the final score consisting of how much the system spends to satisfy the policy, to a given threshold. We stir these two ingredients together in order to provide a Quantitative PMC function (QPMC), based on the algebraic structure of semirings. We design a method to extract part of the weight during QPMC, with the purpose to avoid the evaluation of a modality as soon as the threshold is crossed. Moreover, we extend classical heuristics to be quantitative, and we investigate the complexity of QPMC.Keyword: Partial Model Checking, Semirings, Optimisation, Quantitative Modal Logic Quantitative Process Algebra, Quantitative Evaluation of Systems.

Download Full-text

Bounded Model Checking Combining Symbolic Trajectory Evaluation Abstraction with Hybrid Three-Valued SAT Solving

Computer Supported Cooperative Work in Design III - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72863-4_31 ◽

2007 ◽

pp. 297-307

Author(s):

Shujun Deng ◽

Weimin Wu ◽

Jinian Bian

Keyword(s):

Model Checking ◽

Bounded Model Checking ◽

Sat Solving ◽

Symbolic Trajectory Evaluation ◽

Symbolic Trajectory

Download Full-text