An application of parallel satisfiability solving to the verification of complex embedded systems

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Model checking has reached a maturity level that allows its techniques to be applied to the verification of industrial systems. Several algorithms and methods have been proposed to increase its effectiveness to tackle models of increasing complexity. In this chapter we present an application of Parallel Satisfiability Solving to the verification of embedded control systems. The adopted toolchain is part of the Formal Specs Verifier framework for the formal verification of Simulink/Stateflow models. The experiments we performed show that the use of a parallel satisfiability solver allows for an average speedup of an order of magnitude or more on industrial strength models.

Cite

CITATION STYLE

APA

Ferrante, O., Ferrari, A., Sofronis, C., Mangeruca, L., & Benvenuti, L. (2018). An application of parallel satisfiability solving to the verification of complex embedded systems. In Handbook of Parallel Constraint Reasoning (pp. 617–632). Springer International Publishing. https://doi.org/10.1007/978-3-319-63516-3_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free