Displaying similar documents to “Formalization of the Advanced Encryption Standard. Part I”

Mizar Analysis of Algorithms: Algorithms over Integers

Grzegorz Bancerek (2008)

Formalized Mathematics

Similarity:

This paper is a continuation of [5] and concerns if-while algebras over integers. In these algebras the only elementary instructions are assignment instructions. The instruction assigns to a (program) variable a value which is calculated for the current state according to some arithmetic expression. The expression may include variables, constants, and a limited number of arithmetic operations. States are functions from a given set of locations into integers. A variable is a function...

Semantics of MML Query

Grzegorz Bancerek (2012)

Formalized Mathematics

Similarity:

In the paper the semantics of MML Query queries is given. The formalization is done according to [4]

Abstract initiality

Lutz Schröder, Horst Herrlich (2000)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We study morphisms that are initial w.r.t. all functors in a given conglomerate. Several results and counterexamples are obtained concerning the relation of such properties to different notions of subobject. E.g., strong monomorphisms are initial w.r.t. all faithful adjoint functors, but not necessarily w.r.t. all faithful monomorphism-preserving functors; morphisms that are initial w.r.t. all faithful monomorphism-preserving functors are monomorphisms, but need not be extremal; and...

Model Checking. Part III

Kazuhisa Ishida, Yasunari Shidama (2008)

Formalized Mathematics

Similarity:

This text includes verification of the basic algorithm in Simple On-the-fly Automatic Verification of Linear Temporal Logic (LTL). LTL formula can be transformed to Buchi automaton, and this transforming algorithm is mainly used at Simple On-the-fly Automatic Verification. In this article, we verified the transforming algorithm itself. At first, we prepared some definitions and operations for transforming. And then, we defined the Buchi automaton and verified the transforming algorithm.MML...

A categorical concept of completion of objects

Guillaume C. L. Brümmer, Eraldo Giuli (1992)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We introduce the concept of firm classes of morphisms as basis for the axiomatic study of completions of objects in arbitrary categories. Results on objects injective with respect to given morphism classes are included. In a finitely well-complete category, firm classes are precisely the coessential first factors of morphism factorization structures.

Bertrand’s Ballot Theorem

Karol Pąk (2014)

Formalized Mathematics

Similarity:

In this article we formalize the Bertrand’s Ballot Theorem based on [17]. Suppose that in an election we have two candidates: A that receives n votes and B that receives k votes, and additionally n ≥ k. Then this theorem states that the probability of the situation where A maintains more votes than B throughout the counting of the ballots is equal to (n − k)/(n + k). This theorem is item #30 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/. ...

Collective Operations on Number-Membered Sets

Artur Korniłowicz (2009)

Formalized Mathematics

Similarity:

The article starts with definitions of sets of opposite and inverse numbers of a given number membered set. Next, collective addition, subtraction, multiplication and division of two sets are defined. Complex numbers cases and extended real numbers ones are introduced separately and unified for reals. Shortcuts for singletons cases are also defined.