In this paper we introduce some notions to facilitate formulating and proving properties of iterative algorithms encoded in nominative data language [19] in the Mizar system [3], [1]. It is tested on verification of the partial correctness of an algorithm computing n-th Fibonacci number: i := 0 s := 0 b := 1 c := 0 while (i n) c := s s := b b := c + s i := i + 1 return s This paper continues verification of algorithms [10], [13], [12] written in terms of simple-named complex-valued nominative data [6], [8], [17], [11], [14], [15]. The validity of the algorithm is presented in terms of semantic Floyd-Hoare triples over such data [9]. Proofs of the correctness are based on an inference system for an e...
The Borsuk-Ulam theorem about antipodals is proven, [18, pp. 32-33].This work has been supported by ...
[EN] We report on the new version of mu-term, a tool for proving termination properties of variants ...
We formalize, in two different ways, that “the n-dimensional Euclidean metric space is a complete me...
In this paper we present a formalization in the Mizar system [3],[1] of the partial correctness of t...
This work continues a formal verification of algorithms written in terms of simple-named complex-val...
In this paper we introduce some new definitions for sequences of operations and extract general theo...
This paper continues formalization in the Mizar system [2, 1] of basic notions of the composition-no...
SummaryIn this paper we give a formal definition of the notion of nominative data with simple names ...
This paper continues formalization in Mizar [2, 1] of basic notions of the composition-nominative ap...
In this paper we define some properties about finite sequences and verify the partial correctness of...
We show that the set of all partial predicates over a set D together with the disjunction, conjuncti...
[EN] In program analysis, the synthesis of models of logical theories representing the program seman...
In this paper we present a formalization in the Mizar system [2, 1] of the correctness of the subtra...
[EN] In the realm of term rewriting, given terms s and t, a reachability condition s>>t is called...
Two construction functors: simple term with a variable and compound term with an operation and argum...
The Borsuk-Ulam theorem about antipodals is proven, [18, pp. 32-33].This work has been supported by ...
[EN] We report on the new version of mu-term, a tool for proving termination properties of variants ...
We formalize, in two different ways, that “the n-dimensional Euclidean metric space is a complete me...
In this paper we present a formalization in the Mizar system [3],[1] of the partial correctness of t...
This work continues a formal verification of algorithms written in terms of simple-named complex-val...
In this paper we introduce some new definitions for sequences of operations and extract general theo...
This paper continues formalization in the Mizar system [2, 1] of basic notions of the composition-no...
SummaryIn this paper we give a formal definition of the notion of nominative data with simple names ...
This paper continues formalization in Mizar [2, 1] of basic notions of the composition-nominative ap...
In this paper we define some properties about finite sequences and verify the partial correctness of...
We show that the set of all partial predicates over a set D together with the disjunction, conjuncti...
[EN] In program analysis, the synthesis of models of logical theories representing the program seman...
In this paper we present a formalization in the Mizar system [2, 1] of the correctness of the subtra...
[EN] In the realm of term rewriting, given terms s and t, a reachability condition s>>t is called...
Two construction functors: simple term with a variable and compound term with an operation and argum...
The Borsuk-Ulam theorem about antipodals is proven, [18, pp. 32-33].This work has been supported by ...
[EN] We report on the new version of mu-term, a tool for proving termination properties of variants ...
We formalize, in two different ways, that “the n-dimensional Euclidean metric space is a complete me...