Safety verification and refutation by k-invariants and k-induction
Most software verification tools can be classified into one of a number of established families, each of which has their own focus and strengths. For example, concrete counterexample generation in model checking, invariant inference in abstract interpretation and completeness via annotation for dedu...
Main Authors: | Brain, M, Joshi, S, Kroening, D, Schrammel, P |
---|---|
Format: | Conference item |
Language: | English |
Published: |
Springer Berlin Heidelberg
2015
|
Similar Items
-
Software verification using k-induction
by: Donaldson, A, et al.
Published: (2011) -
Software Verification Using k−Induction
by: Donaldson, A, et al.
Published: (2011) -
Unbounded Safety Verification for Hardware Using Software Analyzers
by: Mukherjee, R, et al.
Published: (2015) -
Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration
by: Cattaruzza, D, et al.
Published: (2020) -
Restructuring Resolution Refutations for Interpolation
by: D'Silva, V, et al.
Published: (2008)