119 search results - page 6 / 24 » Assertion Application in Theorem Proving and Proof Planning |
TOC
2010
13 years 2 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
TPHOL
1999
IEEE
13 years 11 months ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
SAC
2004
ACM
14 years 26 days ago
2004
ACM
In this paper we present an approach for developing adaptable software applications. The problem we are facing is that of a (possibly mobile) user who wants to download and execut...
CPP
2011
12 years 7 months ago
2011
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
JAR
2008
13 years 7 months ago
2008
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...