The Kind 2 Model Checker

Champion, Adrien; Mebsout, Alain; Sticksel, Christoph; Tinelli, Cesare

doi:10.1007/978-3-319-41540-6_29

Cited by 70 publications

(54 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, symbolic model checking has been applied in many different application domains. For example, TAMARIN [Meier et al 2013] focuses on security protocols, and Kind 2 [Champion et al 2016] is designed for the dataflow language Lustre.…”

Section: Model Checkers For Specialized Languagesmentioning

confidence: 99%

TLA+ model checking made symbolic

Konnov

Kukovec²,

Tran³

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

TLA + is a language for formal specification of all kinds of computer systems. System designers use this language to specify concurrent, distributed, and fault-tolerant protocols, which are traditionally presented in pseudo-code. TLA + is extremely concise yet expressive: The language primitives include Booleans, integers, functions, tuples, records, sequences, and sets thereof, which can be also nested. This is probably why the only model checker for TLA + (called TLC) relies on explicit enumeration of values and states. In this paper, we present APALACHE Ð a first symbolic model checker for TLA +. Like TLC, it assumes that all specification parameters are fixed and all states are finite structures. Unlike TLC, APALACHE translates the underlying transition relation into quantifier-free SMT constraints, which allows us to exploit the power of SMT solvers. Designing this translation is the central challenge that we address in this paper. Our experiments show that APALACHE outperforms TLC on examples with large state spaces. CCS Concepts: • Theory of computation → Logic and verification; • Software and its engineering → Model checking; Specification languages.

show abstract

Section: Model Checkers For Specialized Languagesmentioning

confidence: 99%

TLA+ model checking made symbolic

Konnov

Kukovec²,

Tran³

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…Later, many different works addressing various classes of infinite-state systems and/or parameterised topologies have been published, using combinations of approaches, often including predicate abstraction and SMT satisfiability (e.g. [1,16,20,21,25]). With respect to these, we use symbolic representations not only to get a finite representation of infinite spaces, but also to express the (data-sensitive) synchronisations with the environment, making our models suitable for compositional verification.…”

Section: Related Workmentioning

confidence: 99%

Verification of Concurrent Design Patterns with Data

Bliudze

Henrio

Madelaine

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We provide a solution for the design of safe concurrent systems by compositional application of verified design patterns-called architectures-to a small set of functional components. To this end, we extend the theory of architectures developed previously for the BIP framework with the elements necessary for handling data: definition and operations on data domains, syntax and semantics of composition operators involving data transfer. We provide a set of conditions under which composition of architectures preserves their characteristic safety properties. To verify that individual architectures do enforce their associated properties, we provide an encoding into open pNets, an intermediate model that supports SMT-based verification. The approach is illustrated by a case study based on a previously developed BIP model of a nanosatellite on-board software.

show abstract

“…We evaluated the performance of JKind against Kind 2 [8], Zustre [20], Generalized PDR in Z3 [19], and IC3 in nuXmv [9]. We used the default options for each tool (using check invar ic3 for nuXmv).…”

Section: Experimental Evaluationmentioning

confidence: 99%

The JKind Model Checker

Gacek

Backes

Whalen

et al. 2018

Computer Aided Verification

View full text Add to dashboard Cite

JKind is an open-source industrial model checker developed by Rockwell Collins and the University of Minnesota. JKind uses multiple parallel engines to prove or falsify safety properties of infinite state models. It is portable, easy to install, performance competitive with other state-of-the-art model checkers, and has features designed to improve the results presented to users: inductive validity cores for proofs and counterexample smoothing for test-case generation. It serves as the back-end for various industrial applications. Functionality and Main FeaturesJKind is structured as several parallel engines that coordinate to prove properties, mimicking the design of PKind and Kind 2 [8,21]. Some engines are

show abstract

The Kind 2 Model Checker

Cited by 70 publications

References 16 publications

TLA+ model checking made symbolic

TLA+ model checking made symbolic

Verification of Concurrent Design Patterns with Data

The JKind Model Checker

Contact Info

Product

Resources

About