Results 1  10
of
5,660
Substructural logic and partial correctness
 Trans. Computational Logic
"... We formulate a noncommutative sequent calculus for partial correctness that subsumes propositional Hoare Logic. Partial correctness assertions are represented by intuitionistic linear implication. We prove soundness and completeness over relational and trace models. As a corollary we obtain a comple ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We formulate a noncommutative sequent calculus for partial correctness that subsumes propositional Hoare Logic. Partial correctness assertions are represented by intuitionistic linear implication. We prove soundness and completeness over relational and trace models. As a corollary we obtain a
Verifying Partial Correctness of Logic . . .
"... In this paper we propose a method for verifying partial correctness of logic programs with delay declarations. The method is based on the notion of specialised derivation. It differs from the definition of SLDderivation since more instantiated general unifiers are computed instead of standard mgus. ..."
Abstract
 Add to MetaCart
In this paper we propose a method for verifying partial correctness of logic programs with delay declarations. The method is based on the notion of specialised derivation. It differs from the definition of SLDderivation since more instantiated general unifiers are computed instead of standard mgus
The Identification of Partially Correct Constructs
"... We show how the RBC model for abstraction in context can be used to follow the emergence of a learner’s knowledge constructs and to identify in detail the learner’s partially correct constructs (PaCCs). These PaCCs are used to explain the learner’s inconsistent answers and provide added insight into ..."
Abstract
 Add to MetaCart
We show how the RBC model for abstraction in context can be used to follow the emergence of a learner’s knowledge constructs and to identify in detail the learner’s partially correct constructs (PaCCs). These PaCCs are used to explain the learner’s inconsistent answers and provide added insight
Proving partial correctness of partial functions
 PROC. CADEWORKSHOP MECHANIZATION OF PARTIAL FUNCTIONS
, 1996
"... We present a method for automated induction proofs about partial functions. This method cannot only be used to verify the partial correctness of functional programs, but it also solves some other challenge problems where reasoning about partial functions is necessary. For a further analysis of part ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present a method for automated induction proofs about partial functions. This method cannot only be used to verify the partial correctness of functional programs, but it also solves some other challenge problems where reasoning about partial functions is necessary. For a further analysis
Consensus in the presence of partial synchrony
 JOURNAL OF THE ACM
, 1988
"... The concept of partial synchrony in a distributed system is introduced. Partial synchrony lies between the cases of a synchronous system and an asynchronous system. In a synchronous system, there is a known fixed upper bound A on the time required for a message to be sent from one processor to ano ..."
Abstract

Cited by 513 (18 self)
 Add to MetaCart
correctly in the partially synchronous system regardless of the actual values of the bounds A and (I,. In another version of partial synchrony, the bounds are known, but are only guaranteed to hold starting at some unknown time T, and protocols must be designed to work correctly regardless of when time
Partial Correctness for Probabilistic Demonic Programs
 THEORETICAL COMPUTER SCIENCE
, 1997
"... Recent work in sequential program semantics has produced both an operational [4] and an axiomatic [13, 17] treatment of total correctness for probabilistic demonic programs, extending Kozen's original work [9, 10] that did not include demonic nondeterminism. For practical applications however ( ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
(eg. combining loop invariants with termination constraints) it is important to retain the traditional distinction between partial and total correctness. Jones [6] defines probabilistic partial correctness for probabilistic, but again not demonic programs. In this paper we combine all the above
Modal Kleene Algebra and Partial Correctness
 INSTITUT FÜR INFORMATIK, UNIVERSITÄT AUGSBURG
, 2003
"... We enrich Kleene algebra by domain and codomain operators. These ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
We enrich Kleene algebra by domain and codomain operators. These
On Refinement Calculus and Partial Correctness (DRAFT)
, 2006
"... This note is intended as the first of a series concerned with a style of system specification in which the claims that can be verified have the form “system p satisfies specification s under normal circumstances”. This notion of correctness is traditionally referred to as partial ..."
Abstract
 Add to MetaCart
This note is intended as the first of a series concerned with a style of system specification in which the claims that can be verified have the form “system p satisfies specification s under normal circumstances”. This notion of correctness is traditionally referred to as partial
Partial Correction for Turbulent Distortions in Telescope
"... INTRODUCTION The spatial frequency spectrum of turbulent distortions is sufficiently wide, and although the lowest frequency wavefront aberrations (slopes and quadratic aberrations) give the largest contribution to the phase fluctuation variance for a telescope of large aperture a compensation for t ..."
Abstract
 Add to MetaCart
INTRODUCTION The spatial frequency spectrum of turbulent distortions is sufficiently wide, and although the lowest frequency wavefront aberrations (slopes and quadratic aberrations) give the largest contribution to the phase fluctuation variance for a telescope of large aperture a compensation for these aberrations does not improve the image quality essentially. Therefore to achieve a sufficiently high level of compensation the wavefront correctors with a large number of degrees of freedom ought to be used. The complexity and cost of such devices grows rapidly with requirements to their spatial resolution. Therefore it is necessary to choose such a configuration of the corrector which, on the one hand, should not lead to excessive complication and cost rise of an adaptive optical system (AOS) and, on the other hand, should be able to provide a sufficient increase in the image quality. Moreover, as the compensation efficiency depends also on the operation of other units of AOS,
Results 1  10
of
5,660