An application of formal verification (using the proof assistant Isabelle/HOL) for ensuring the correctness of scientific data processing software in the crystallographic domain is presented. The proposed process consists of writing a pseudocode that describes an algorithm in a succinct but mathematically...
To guarantee the correctness of these algorithms, it's important to apply formal method to them.We propose an approach to proving the correctness of geometric algorithms. The main contribution of the paper is that a set of proof decomposition rules is proposed which can help improve the ...
We explain the parallel algorithm used and give ... EL Lusk,WW Mccune,J Slaney - Springer Berlin Heidelberg 被引量: 61发表: 1992年 Performance effects of information sharing in a distributed multiprocessor real-time scheduler Two questions are examined, regarding real-time multiprocessor scheduling...
Function Definition Correctness Proof These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves. References S. Abramsky. The lazy lambda calculus. In Author information Authors and Affiliations Diku, ...
An algorithm for Software Transactional Memory (STM) is correct if it guarantees a proclaimed degree of isolation between concurrently executing transactions. A correctness proof requires explicit modeling of the effects of transaction bodies and the non-deterministic scheduling of their operations. ...
The model was improved and checked satisfactorily for a fixed number of processes. To achieve a correctness result for an arbitrary number of processes the model was converted to a theorem prover with which it was proven. 展开 关键词: Model checking Theorem proving Readers–writers algorithm Spin...
Clearly we need to build a computer program that can mathematically prove the correctness of other computer programs. Then we simply need to mathematically prove the correctness of that. Jl•October 2, 2009 8:02 AM Yup, it’s only as secure as the properties you’ve defined and proven. ...
correctnesspropertiesofprograms, queriesfordatabasesearch, Inferencemechanismshelpto provecorrectnessofspecifications, answersearchqueries, AshishTiwari,SRIEfficientDecisionProceduresusingExtendedSignatures:2 FormalLogic Applicationsusuallyinvolvemanydifferent“theories”. ...
as well as make it easier to prove theorems that could have been proved otherwise. But there can be negative consequences of adding additional axioms, consequences which may go beyond concerns about their correctness. In particular, the use of axioms bears on the computational content of definition...
The protocol of [BDLN16] can be thought of as a cut-and-choose protocol, thus more reveals intuitively implies a higher probability of the correctness of the non-revealed parts. If we introduce a parameter α, then the prover produces T=ακn elements hj in the first part, sends them ...