Results 11  20
of
655,385
Escape Analysis: Correctness Proof, Implementation and Experimental Results
 In Conference Record of the 25th Annual ACM Symposium on Principles of Programming Languages
, 1998
"... We describe an escape analysis [32, 14], used to determine whether the lifetime of data exceeds its static scope. We give a new correctness proof starting directly from a semantics. Contrary to previous proofs, it takes into account all the features of functional languages, including imperative fea ..."
Abstract

Cited by 67 (3 self)
 Add to MetaCart
We describe an escape analysis [32, 14], used to determine whether the lifetime of data exceeds its static scope. We give a new correctness proof starting directly from a semantics. Contrary to previous proofs, it takes into account all the features of functional languages, including imperative
Formal Correctness Proof for DPLL Procedure ∗
, 2008
"... Abstract. The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware verification. Most of the modern SAT solvers are based on this procedure, extending it with different heuristics. I ..."
Abstract
 Add to MetaCart
. In this paper we present a formal proof that the DPLL procedure is correct. As far as we know, this is the first such proof. The proof was formalized within the Isabelle/Isar proof assistant system. This proof adds to the growing body of formalized mathematical knowledge and it also provides a number of lemmas
CORRECTNESS PROOF OF AN INPLACE PERMUTATION
"... The correctness of an inplace permutation algorithm is proved. The algorithm exchanges elements belonging to a permutation cycle. A suitable assertion is constructed from which the correctness can be deduced after completion of the algorithm. An inplace rectangular matrix transposition algorithm ..."
Abstract
 Add to MetaCart
algorithm is given as an example. Key words and phrases: Proof of programs, algorithm, program correctness, theory of programming. Introduction. The inplace permutat ion problem deals with the rearrangement of the elements of a given vector VEC[i], i = 1(1)(7, G> _ 1, using an arbitrary permutat ion f
Correctness Proof For A Network Synchronizer
, 1993
"... In this paper we offer a formal, rigorous proof of the correctness of Awerbuch's algorithm for network synchronization [1]. We specify both the algorithm and the correctness condition using the I/O automaton model. Our proof of correctness follows Awerbuch's intuitive arguments closely ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we offer a formal, rigorous proof of the correctness of Awerbuch's algorithm for network synchronization [1]. We specify both the algorithm and the correctness condition using the I/O automaton model. Our proof of correctness follows Awerbuch's intuitive arguments closely
Correctness proofs General Terms Verification
"... SPARK is useful for developing reliable software for safetycritical systems, using the ‘correctnessbyconstruction ’ approach. It also has verification tools that can be used to produce verified software. To tackle largerscale development of verified software, components are useful. In this paper ..."
Abstract
 Add to MetaCart
SPARK is useful for developing reliable software for safetycritical systems, using the ‘correctnessbyconstruction ’ approach. It also has verification tools that can be used to produce verified software. To tackle largerscale development of verified software, components are useful
Open Access Review CORRECTED PROOF
"... The ecological, economic and public health impacts of nuisance chironomids and their potential as aquatic invaders ..."
Abstract
 Add to MetaCart
The ecological, economic and public health impacts of nuisance chironomids and their potential as aquatic invaders
TO BE RETURNED SIGNED ALONG WITH THE CORRECTED PROOFS
"... and other research outputs Odysseus’s nostos and the Odyssey’s nostoi: rivalry within the epic cycle ..."
Abstract
 Add to MetaCart
and other research outputs Odysseus’s nostos and the Odyssey’s nostoi: rivalry within the epic cycle
The knowledge complexity of interactive proof systems
 in Proc. 27th Annual Symposium on Foundations of Computer Science
, 1985
"... Abstract. Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/nonHamiltoni ..."
Abstract

Cited by 1267 (42 self)
 Add to MetaCart
/nonHamiltonian. In this paper a computational complexity theory of the "knowledge " contained in a proof is developed. Zeroknowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zeroknowledge proof systems are given
Correctness Proof Of A Geometric Constraint Solver
, 1993
"... We present a correctness proof of a graphdirected variational geometric constraint solver. First, we prove that the graph reduction that establishes the sequence in which to apply the construction steps defines a terminating confluent reduction system, in the case of wellconstrained graphs. For ov ..."
Abstract

Cited by 37 (8 self)
 Add to MetaCart
We present a correctness proof of a graphdirected variational geometric constraint solver. First, we prove that the graph reduction that establishes the sequence in which to apply the construction steps defines a terminating confluent reduction system, in the case of wellconstrained graphs
Correctness Proof of the Standardized Algorithm for ABR Conformance
 In Formal Methods 99, LNCS 1708
, 1999
"... Abstract. Conformance control for ATM cells is based on a realtime reactive algorithm which delivers a value depending on inputs from the network. This value must always agree with a well de ned theoretical value. We present here the correctness proof of the algorithm standardized for the ATM trans ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. Conformance control for ATM cells is based on a realtime reactive algorithm which delivers a value depending on inputs from the network. This value must always agree with a well de ned theoretical value. We present here the correctness proof of the algorithm standardized for the ATM
Results 11  20
of
655,385