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

Timm, Nils; Grüner, Stefan; Sibanda, Prince

doi:10.1007/978-3-319-68972-2_16

Cited by 3 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [POR12] and [TGS17], two frameworks for symbolic model checking of concurrent systems are proposed. [POR12] proposes an approach to perform refinement checking in a symbolic way.…”

Section: Related Workmentioning

confidence: 99%

“…The authors of [POR12], however, admit that their framework is usually much less efficient than traditional explicitstate-exploration techniques for proving that a refinement assertion holds. The authors of [TGS17] propose a boolean encoding for the state space of a system in addition to a set of heuristics that speed up the process of finding error states. They use this approach to create a bounded model checker, which, in particular, cannot guarantee the absence of error states but that they do not exist up to a certain bound i.e.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving

2019

View full text Add to dashboard Cite

This work develops a type of local analysis that can prove concurrent systems deadlock free. As opposed to examining the overall behaviour of a system, local analysis consists of examining the behaviour of small parts of the system to yield a given property. We analyse pairs of interacting components to approximate system reachability and propose a new sound but incomplete/approximate framework that checks deadlock and local-deadlock freedom. By replacing exact reachability by this approximation, it looks for deadlock (or local-deadlock) candidates, namely, blocked (locally-blocked) system states that lie within our approximation. This characterisation improves on the precision of current approximate techniques. In particular, it can tackle non-hereditary deadlock-free systems, namely, deadlock-free systems that have a deadlocking subsystem. These are neglected by most approximate techniques. Furthermore, we demonstrate how SAT checkers can be used to efficiently implement our framework, which, typically, scales better than current techniques for deadlock-freedom analysis. This is demonstrated by a series of practical experiments.

show abstract

“…In [POR12] and [TGS17], two frameworks for symbolic model checking of concurrent systems are proposed. [POR12] proposes an approach to perform refinement checking in a symbolic way.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving

2019

View full text Add to dashboard Cite

show abstract

Satune: synthesizing efficient SAT encoders

Gorjiara

Demsky

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Modern SAT solvers are extremely efficient at solving boolean satisfiability problems, enabling a wide spectrum of techniques for checking, verifying, and validating real-world programs. What remains challenging, though, is how to encode a domain problem (e.g., model checking) into a SAT formula because the same problem can have multiple distinct encodings, which can yield performance results that are orders-of-magnitude apart, regardless of the underlying solvers used. We develop Satune, a tool that can automatically synthesize SAT encoders for different problem domains. Satune employs a DSL that allows developers to express domain problems at a high level and a search algorithm that can effectively find efficient solutions. The search process is guided by observations made over example encodings and their performance for the domain and hence Satune can quickly synthesize a high-performance encoder by incorporating patterns from examples that yield good performance. A thorough evaluation with JMCR, SyPet, Dirk, Hexiom, Sudoku, and KillerSudoku demonstrates that Satune can easily synthesize high-performance encoders for different domains including model checking, synthesis, and games. These encoders generate constraint problems that are often several orders of magnitude faster to solve than the original encodings used by the tools.

show abstract

A Survey on the Applications of Swarm Intelligence to Software Verification

Kumazawa

Takimoto

Kambayashi

2020

Handbook of Research on Fireworks Algorithms and Swarm Intelligence

View full text Add to dashboard Cite

Applying swarm intelligence techniques to software engineering problems has appealed to both researchers and practitioners in the software engineering community. This chapter describes issues and challenges of its application to formal verification, which is one of the core research fields in software engineering. Formal verification, which explores how to effectively verify software products by using mathematical technique, often suffers from two open problems. One is the so-called state explosion problem that verification tools need too many computational resources to make verification feasible. The other problem is that the results of verification have often too much complexity for users to understand. While a number of research projects have addressed these problems in the context of traditional formal verification, recent researches demonstrate that Swarm Intelligence is a promising tool to tackle the problems. This chapter presents how Swarm Intelligence can be applied to formal verification, and surveys the state-of-the-art techniques.

show abstract

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

Cited by 3 publications

References 16 publications

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving

Satune: synthesizing efficient SAT encoders

A Survey on the Applications of Swarm Intelligence to Software Verification

Contact Info

Product

Resources

About