163 search results - page 18 / 33 » Higher-Order Logic and Theorem Proving for Structured Specif... |
IEE
2008
13 years 7 months ago
2008
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
DSD
2002
IEEE
14 years 14 days ago
2002
IEEE
In this paper we describe a methodology for the formal verification of a DSP chip using the HOL theorem prover. We used an iterative method to specify both the behavioral and stru...
ICTAC
2010
Springer
13 years 5 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...