Results 1 
4 of
4
Tool Support for Proof Engineering
"... Modern integrated development environments (IDEs) provide programmers with a variety of sophisticated tools for program visualization and manipulation. These tools assist the programmer in understanding legacy code and making coordinated changes across large parts of a program. Similar tools incorpo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Modern integrated development environments (IDEs) provide programmers with a variety of sophisticated tools for program visualization and manipulation. These tools assist the programmer in understanding legacy code and making coordinated changes across large parts of a program. Similar tools incorporated into an integrated proof environment (IPE) would assist proof developers in understanding and manipulating the increasingly larger proofs that are being developed. In this paper we propose some tools and techniques developed for software engineering that we believe would be equally applicable in proof engineering.
Information Security
"... We present a method for the automatic generation of test cases for HOL formulae containing primitive recursive predicates. These test cases may be used for the animation of specifications as well as for blackboxtesting of external programs. Our method is twostaged: first, the original formula is ..."
Abstract
 Add to MetaCart
(Show Context)
We present a method for the automatic generation of test cases for HOL formulae containing primitive recursive predicates. These test cases may be used for the animation of specifications as well as for blackboxtesting of external programs. Our method is twostaged: first, the original formula is partitioned into test cases by transformation into a Hornclause normal form (CNF). Second, the test cases are analyzed for ground instances satisfying the premises of the clauses. Particular emphasis is put on the control of test hypothesis ' and test hierarchies to avoid intractability. We applied our method to several examples, including AVLtrees and the redblack implementation in the standard library from SML/NJ. Keywords: symbolic test case generations, black box testing, theorem proving, Isabelle/HOL
Centre for Discrete Mathematics and Theoretical Computer ScienceSearching for Spanning kCaterpillars and kTrees
, 2008
"... We consider the problems of finding spanning kcaterpillars and ktrees in graphs. We first show that the problem of whether a graph has a spanning kcaterpillar is NPcomplete, for all k ≥ 1. Then we give a linear time algorithm for finding a spanning 1caterpillar in a graph with treewidth k. Also ..."
Abstract
 Add to MetaCart
(Show Context)
We consider the problems of finding spanning kcaterpillars and ktrees in graphs. We first show that the problem of whether a graph has a spanning kcaterpillar is NPcomplete, for all k ≥ 1. Then we give a linear time algorithm for finding a spanning 1caterpillar in a graph with treewidth k. Also, as a generalized versions of the depthfirst search and the breadthfirst search algorithms, we introduce the ktree search (KTS) algorithm and we use it in a heuristic algorithm for finding a large kcaterpillar in a graph. 1