<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Kolekcja:</title>
    <link>http://hdl.handle.net/11320/10978</link>
    <description />
    <pubDate>Mon, 01 Jun 2026 15:18:31 GMT</pubDate>
    <dc:date>2026-06-01T15:18:31Z</dc:date>
    <item>
      <title>Partial Correctness of an Algorithm Computing Lucas Sequences</title>
      <link>http://hdl.handle.net/11320/10981</link>
      <description>Tytu&amp;#322;: Partial Correctness of an Algorithm Computing Lucas Sequences
Autorzy: Jaszczak, Adrian
Abstrakt: In this paper we define some properties about finite sequences and verify the partial correctness of an algorithm computing n-th element of Lucas sequence [23], [20] with given P and Q coefficients as well as two first elements (x and y). The algorithm is encoded in nominative data language [22] in the Mizar system [3], [1].&#xD;
&#xD;
&#xD;
i := 0&#xD;
&#xD;
s := x&#xD;
&#xD;
b := y&#xD;
&#xD;
c := x&#xD;
&#xD;
while (i &lt;&gt; n)&#xD;
&#xD;
c := s&#xD;
&#xD;
s := b&#xD;
&#xD;
ps := p*s&#xD;
&#xD;
qc := q*c&#xD;
&#xD;
b := ps − qc&#xD;
&#xD;
i := i + j&#xD;
&#xD;
return s&#xD;
&#xD;
This paper continues verification of algorithms [10], [14], [12], [15], [13] written in terms of simple-named complex-valued nominative data [6], [8], [19], [11], [16], [17]. 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 extended Floyd-Hoare logic [2], [4] with partial pre- and post-conditions [18], [21], [7], [5].</description>
      <pubDate>Wed, 01 Jan 2020 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/11320/10981</guid>
      <dc:date>2020-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>General Theory and Tools for Proving Algorithms in Nominative Data Systems</title>
      <link>http://hdl.handle.net/11320/10980</link>
      <description>Tytu&amp;#322;: General Theory and Tools for Proving Algorithms in Nominative Data Systems
Autorzy: Jaszczak, Adrian
Abstrakt: In this paper we introduce some new definitions for sequences of operations and extract general theorems about properties of iterative algorithms encoded in nominative data language [20] in the Mizar system [3], [1] in order to simplify the process of proving algorithms in the future.&#xD;
&#xD;
This paper continues verification of algorithms [10], [13], [12], [14] written in terms of simple-named complex-valued nominative data [6], [8], [18], [11], [15], [16].&#xD;
&#xD;
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 extended Floyd-Hoare logic [2], [4] with partial pre- and postconditions [17], [19], [7], [5].</description>
      <pubDate>Wed, 01 Jan 2020 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/11320/10980</guid>
      <dc:date>2020-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Functional Sequence in Norm Space</title>
      <link>http://hdl.handle.net/11320/10979</link>
      <description>Tytu&amp;#322;: Functional Sequence in Norm Space
Autorzy: Yamazaki, Hiroshi
Abstrakt: In this article, we formalize in Mizar [1], [2] functional sequences and basic operations on functional sequences in norm space based on [5]. In the first section, we define functional sequence in norm space. In the second section, we define pointwise convergence and prove some related theorems. In the last section we define uniform convergence and limit of functional sequence.</description>
      <pubDate>Wed, 01 Jan 2020 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/11320/10979</guid>
      <dc:date>2020-01-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

