scholarly journals Craig Interpolation for Linear Temporal Languages

Author(s):  
Amélie Gheerbrant ◽  
Balder ten Cate
Keyword(s):  
2012 ◽  
pp. 260-269
Author(s):  
George S. Boolos ◽  
John P. Burgess ◽  
Richard C. Jeffrey

2015 ◽  
Vol 49 (7) ◽  
pp. 413-419 ◽  
Author(s):  
Marat Akhin ◽  
Sam Kolton ◽  
Vladimir Itsykson

2013 ◽  
Vol 572 ◽  
pp. 115-118
Author(s):  
Zhi Yuan Chen ◽  
Shao Bin Huang ◽  
Li Li Han

Model checking technique can give a specific counterexample which explains how the system violates some assertion when model does not satisfy the specification. However, it is a tedious work to understand the long counterexamples. We propose a genetic algorithm to enhance the efficiency of understanding long counterexample by computing the minimal unsatisfiable subformula. Besides, we also propose a Craig interpolation computation-based method to understand counterexample. The causes which are responsible for model failure are extracted by deriving interpolation from the proof of the nonsatisfiability of the initial state and the weakest precondition of counterexample. Experimental results show that our methods improve the efficiency of understanding counterexamples and debugging significantly.


2014 ◽  
Vol 21 (6) ◽  
pp. 7-17
Author(s):  
Marat Akhin ◽  
Sam Kolton ◽  
Vladimir Itsykson

2013 ◽  
Vol 19 ◽  
pp. 39-50
Author(s):  
А.С. Карпенко

In this paper von Wright’s truth-logic T__ is considered. It seems that it is a De Morgan four-valued logic DM4 (or Belnap’s four-valued logic) with endomorphism e2. In connection with this many other issues are discussed: twin truth operators, a truth-logic with endomorphism g (or logic Tr), the lattice of extensions of DM4, modal logic V2, Craig interpolation property, von Wright–Segerberg’s tense logic W, and so on.


10.29007/9rxz ◽  
2018 ◽  
Author(s):  
Philipp Rümmer

Craig interpolation is a versatile tool in formal verification, in particular for generating intermediate assertions in safety analysis and model checking. Over the last years, a variety of interpolation procedures for linear integer arithmetic (and extensions) have been developed. I will give an overview of the existing algorithms and design choices, and then discuss implementations of such procedures within theorem provers and SMT solvers. In particular, I will describe an implementation done using the multi-paradigm language Scala, which is built on top of the Java runtime infrastructure, and evaluate performance and engineering aspects.


Sign in / Sign up

Export Citation Format

Share Document