Relevant bibliographies by topics / Triplet de Hoare

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Triplet de Hoare'

Author: Grafiati
Published: 4 June 2021
Last updated: 9 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Triplet de Hoare.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Triplet de Hoare"

1

Ivanov, Ievgen, Artur Korniłowicz, and Mykola Nikitchenko. "An Inference System of an Extension of Floyd-Hoare Logic for Partial Predicates." Formalized Mathematics 26, no. 2 (2018): 159–64. http://dx.doi.org/10.2478/forma-2018-0013.

Full text
Abstract:
Summary In the paper we give a formalization in the Mizar system [2, 1] of the rules of an inference system for an extended Floyd-Hoare logic with partial pre- and post-conditions which was proposed in [7, 9]. The rules are formalized on the semantic level. The details of the approach used to implement this formalization are described in [5]. We formalize the notion of a semantic Floyd-Hoare triple (for an extended Floyd-Hoare logic with partial pre- and post-conditions) [5] which is a triple of a pre-condition represented by a partial predicate, a program, represented by a partial function wh
APA, Harvard, Vancouver, ISO, and other styles
2

Vega Vice, Jorge, and Valery Mikhailov. "On Methods in the Verification and Elaboration of Development Programs for Agricultural Territories." Modeling and Analysis of Information Systems 25, no. 5 (2018): 481–90. http://dx.doi.org/10.18255/1818-1015-2018-5-481-490.

Full text
Abstract:
Nowadays, the methods of program-targeted management for the development of various socio-economic systems of complex structure, such as agricultural areas, have become universal. Therefore, the current tasks at hand are the verification of already created development programs and the development of "proper" programs for the development of such systems, by analogy with the verification and development of proper computer programs through developed disciplines in theoretical programming. In this paper, in order to solve the problem of verification of development programs for agricultural territo
APA, Harvard, Vancouver, ISO, and other styles
3

BORGSTRÖM, JOHANNES, ANDREW D. GORDON, and RICCARDO PUCELLA. "Roles, stacks, histories: A triple for Hoare." Journal of Functional Programming 21, no. 2 (2010): 159–207. http://dx.doi.org/10.1017/s0956796810000134.

Full text
Abstract:
AbstractBehavioral type and effect systems regulate properties such as adherence to object and communication protocols, dynamic security policies, avoidance of race conditions, and many others. Typically, each system is based on some specific syntax of constraints, and is checked with anad hocsolver. Instead, we advocate types refined with first-order logic formulas as a basis for behavioral type systems, and general purpose automated theorem provers as an effective means of checking programs. To illustrate this approach, we define a triple of security-related type systems: for role-based acce
APA, Harvard, Vancouver, ISO, and other styles
4

Ivanov, Ievgen, Artur Korniłowicz, and Mykola Nikitchenko. "Partial Correctness of GCD Algorithm." Formalized Mathematics 26, no. 2 (2018): 165–73. http://dx.doi.org/10.2478/forma-2018-0014.

Full text
Abstract:
Summary In this paper we present a formalization in the Mizar system [2, 1] of the correctness of the subtraction-based version of Euclid’s algorithm computing the greatest common divisor of natural numbers. The algorithm is written in terms of simple-named complex-valued nominative data [11, 4]. The validity of the algorithm is presented in terms of semantic Floyd-Hoare triples over such data [7]. Proofs of the correctness are based on an inference system for an extended Floyd-Hoare logic with partial pre- and post-conditions [8, 10, 5, 3].
APA, Harvard, Vancouver, ISO, and other styles
5

Jaszczak, Adrian. "General Theory and Tools for Proving Algorithms in Nominative Data Systems." Formalized Mathematics 28, no. 4 (2020): 269–78. http://dx.doi.org/10.2478/forma-2020-0024.

Full text
Abstract:
Summary 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. 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]. The validity of the algorithm is presented in terms of semantic Floyd-Hoare triples over such data [9]. Proofs of the correctness are bas
APA, Harvard, Vancouver, ISO, and other styles
6

Korniłowicz, Artur. "Partial Correctness of a Fibonacci Algorithm." Formalized Mathematics 28, no. 2 (2020): 187–96. http://dx.doi.org/10.2478/forma-2020-0016.

Full text
Abstract:
Summary 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
APA, Harvard, Vancouver, ISO, and other styles
7

Jaszczak, Adrian. "Partial Correctness of an Algorithm Computing Lucas Sequences." Formalized Mathematics 28, no. 4 (2020): 279–88. http://dx.doi.org/10.2478/forma-2020-0025.

Full text
Abstract:
Summary 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]. i := 0 s := x b := y c := x while (i <> n) c := s s := b ps := p*s qc := q*c b := ps − qc i := i + j return s This paper continues verification of algorithms [10], [14], [12], [15], [13] written in terms of simple-named complex-valued nominative data [6], [8]
APA, Harvard, Vancouver, ISO, and other styles
8

Jaszczak, Adrian, and Artur Korniłowicz. "Partial Correctness of a Factorial Algorithm." Formalized Mathematics 27, no. 2 (2019): 181–87. http://dx.doi.org/10.2478/forma-2019-0017.

Full text
Abstract:
Summary In this paper we present a formalization in the Mizar system [3],[1] of the partial correctness of the algorithm: i := val.1 j := val.2 n := val.3 s := val.4 while (i <> n) i := i + j s := s * i return s computing the factorial of given natural number n, where variables i, n, s are located as values of a V-valued Function, loc, as: loc/.1 = i, loc/.3 = n and loc/.4 = s, and the constant 1 is located in the location loc/.2 = j (set V represents simple names of considered nominative data [16]). This work continues a formal verification of algorithms written in terms of simple-named
APA, Harvard, Vancouver, ISO, and other styles
9

Jaszczak, Adrian. "Partial Correctness of a Power Algorithm." Formalized Mathematics 27, no. 2 (2019): 189–95. http://dx.doi.org/10.2478/forma-2019-0018.

Full text
Abstract:
Summary This work continues a formal verification of algorithms written in terms of simple-named complex-valued nominative data [6],[8],[15],[11],[12],[13]. In this paper we present a formalization in the Mizar system [3],[1] of the partial correctness of the algorithm: i := val.1 j := val.2 b := val.3 n := val.4 s := val.5 while (i <> n) i := i + j s := s * b return s computing the natural n power of given complex number b, where variables i, b, n, s are located as values of a V-valued Function, loc, as: loc/.1 = i, loc/.3 = b, loc/.4 = n and loc/.5 = s, and the constant 1 is located in
APA, Harvard, Vancouver, ISO, and other styles
10

YANG, XIAOXIAO, ZHENHUA DUAN, and QIAN MA. "Axiomatic semantics of projection temporal logic programs." Mathematical Structures in Computer Science 20, no. 5 (2010): 865–914. http://dx.doi.org/10.1017/s0960129510000241.

Full text
Abstract:
In this paper, we investigate the axiomatic semantics of the projection temporal logic programming language MSVL. To this end, we employ Propositional Projection Temporal Logic (PPTL) as an assertion language to specify the desired properties. We give a set of state axioms and state inference rules. In order to deduce a program over an interval, we also formalise a set of rules in terms of a Hoare logic-like triple. These rules enable us to deduce a program into its normal form and from the current state to the next one. They also enable us to verify properties over intervals. In this way, an
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Triplet de Hoare"

1

Makhlouf, Amani. "Environnement d'assistance au développement de transformations de graphes correctes." Thesis, Toulouse, INPT, 2019. http://www.theses.fr/2019INPT0027/document.

Full text
Abstract:
Les travaux de cette thèse ont pour cadre la vérification formelle, et plus spécifiquement le projet ANR Blanc CLIMT (Categorical and Logical Methods in Model Transformation) dédié aux grammaires de graphes. Ce projet, qui a démarré en février 2012 pour une durée de 48 mois, a donné lieu à la définition du langage Small-tALC, bâti sur la logique de description ALCQI. Ce langage prend la forme d’un DSL (Domain Specific Language) impératif à base de règles, chacune dérivant structurellement un graphe. Le langage s’accompagne d’un composant de preuve basé sur la logique de Hoare chargé d’automati
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Triplet de Hoare"

1

Borgström, Johannes, Andrew D. Gordon, and Riccardo Pucella. "Roles, Stacks, Histories: A Triple for Hoare." In Reflections on the Work of C.A.R. Hoare. Springer London, 2010. http://dx.doi.org/10.1007/978-1-84882-912-1_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hooman, Jozef. "Compositional verification of real-time systems using extended Hoare triples." In Real-Time: Theory in Practice. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/bfb0031996.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Schwinghammer, Jan, Lars Birkedal, Bernhard Reus, and Hongseok Yang. "Nested Hoare Triples and Frame Rules for Higher-Order Store." In Computer Science Logic. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04027-6_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

He, Pei, Lishan Kang, and Daochang Huang. "Construction of Hoare Triples under Generalized Model with Semantically Valid Genetic Operations." In Advances in Computation and Intelligence. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04843-2_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Triplet de Hoare"

1

Shkarupylo, Vadym, Alexander Chemeris, Valentyna Dusheba, Ravil Kudermetov, and Andrii Oliinyk. "On Hoare Triples Applicability to Dependable System Specification Synthesis." In 2020 IEEE 11th International Conference on Dependable Systems, Services and Technologies (DESSERT). IEEE, 2020. http://dx.doi.org/10.1109/dessert50317.2020.9125074.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Penninckx, Willem, Amin Timany, and Bart Jacobs. "Specifying I/O using abstract nested hoare triples in separation logic." In the 21st Workshop. ACM Press, 2019. http://dx.doi.org/10.1145/3340672.3341118.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gias, Alim Ul, Mirza Rehenuma Tabassum, Amit Seal Ami, et al. "A formal approach to verify software scalability requirements using set theory and Hoare triple." In 2013 16th International Conference on Computer and Information Technology (ICCIT). IEEE, 2014. http://dx.doi.org/10.1109/iccitechn.2014.6997367.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography