Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induction step. (Counter)model finders are useful for detecting non-theorems, but they will not find any counterexamples for noninductive theorems. We explain how to apply a well-known concept from first-order logic, nonstandard models, to the detection of noninductive invariants. Our work was done in the context of the proof assistant Isabelle/HOL and the counterexample generator Nitpick
We propose a framework for synthesizing inductive invariants for incomplete verification engines, wh...
Bug-fixing in deeply embedded portions of the logic is typically accompanied by the postfacto additi...
This paper reports an investigation into the link between failed proofs and non-theorems. It seeks ...
Induction proofs often fail because the stated theorem is noninductive, in which case the user must ...
This paper addresses a problem arising in automated proof of invariants of transition systems, for e...
Abstract. This paper addresses a problem arising in automated proof of invariants of transition syst...
Abstract. Algorithmic counterexample generation is a central feature of model checking which sets th...
Abstract. The generation of counterexamples is frequently touted as one of the primary advantages of...
Kohlenbach's proof mining program deals with the extraction of effective information from typically ...
4th VERITE : JAIST/TRUST-AIST/CVS joint workshop on VERIfication TEchnologyでの発表資料, 開催:2007年3月6日~3月7日...
We develop a framework for model checking infinite-state systems byautomatically augmenting them wit...
for invariant generation (which is limited by the 300-s bound). Both plots have been drawn, with the...
Abstract. We describe new techniques for model checking in the counterexample guided abstraction-ref...
Since counterexamples generated by model checking tools are only symptoms of faults in the model, a ...
Abstract. We argue that the detection and refutation of non-theorems, and the discovery of appropria...
We propose a framework for synthesizing inductive invariants for incomplete verification engines, wh...
Bug-fixing in deeply embedded portions of the logic is typically accompanied by the postfacto additi...
This paper reports an investigation into the link between failed proofs and non-theorems. It seeks ...
Induction proofs often fail because the stated theorem is noninductive, in which case the user must ...
This paper addresses a problem arising in automated proof of invariants of transition systems, for e...
Abstract. This paper addresses a problem arising in automated proof of invariants of transition syst...
Abstract. Algorithmic counterexample generation is a central feature of model checking which sets th...
Abstract. The generation of counterexamples is frequently touted as one of the primary advantages of...
Kohlenbach's proof mining program deals with the extraction of effective information from typically ...
4th VERITE : JAIST/TRUST-AIST/CVS joint workshop on VERIfication TEchnologyでの発表資料, 開催:2007年3月6日~3月7日...
We develop a framework for model checking infinite-state systems byautomatically augmenting them wit...
for invariant generation (which is limited by the 300-s bound). Both plots have been drawn, with the...
Abstract. We describe new techniques for model checking in the counterexample guided abstraction-ref...
Since counterexamples generated by model checking tools are only symptoms of faults in the model, a ...
Abstract. We argue that the detection and refutation of non-theorems, and the discovery of appropria...
We propose a framework for synthesizing inductive invariants for incomplete verification engines, wh...
Bug-fixing in deeply embedded portions of the logic is typically accompanied by the postfacto additi...
This paper reports an investigation into the link between failed proofs and non-theorems. It seeks ...