Results 241 to 250 of about 338,726 (289)
A Lightweight Key Agreement Protocol for V2X Communications Based on Kyber and Saber. [PDF]
Sensors (Basel)Dai Y, Wang Q, Song X, Wang S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Formalization of Data Derivative Structures
2020 International Conference on Information Science and Communications Technologies (ICISCT), 2020The paper considers the topical issue of formal description of data structures. Data structures are widely used in modern object-oriented programming to solve various practical problems. The paper introduces functions for performing operations with such data structures as stack, queue, and priority queue.
Rustam Vosilovich kabulov +3 more
openaire +1 more source
A formal derivation of Heaps' Law
Information Sciences, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leijenhorst, D.C. van +1 more
openaire +2 more sources
Formal derivation of rule-based programs
IEEE Transactions on Software Engineering, 1993It is shown that a combination of specification and program refinement may be applied to deriving efficient concurrent rule-based programs. Specification refinement is used to generate an initial rule-based program that is refined into a program which is highly concurrent and efficient.
Roman, Gruia-Catalin +2 more
openaire +2 more sources
Formal derivation of algorithms
ACM Transactions on Mathematical Software, 2003In this paper we apply a formal approach for the derivation of dense linear algebra algorithms to the triangular Sylvester equation. The result is a large family of provably correct algorithms. By using a coding style that reflects the algorithms as they are naturally presented, the correctness of the algorithms carries through to the correctness of ...
Quintana-Ortí, Enrique S. +1 more
openaire +2 more sources
Derivations and Formalizations
2017The deductive rules studied in the previous chapters have been implemented in several computational environments such as theorem provers and proof assistants.
Mauricio Ayala-Rincón +1 more
openaire +1 more source
Formally deriving an STG machine
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, 2003Starting from P. Sestoft semantics for lazy evaluation, we define a new semantics in which normal forms consist of variables pointing to lambdas or constructions. This is in accordance with the more recent changes in the Spineless Tagless G-machine (STG) machine, where constructions only appear in closures (lambdas only appeared in closures already in ...
Alberto de la Encina, Ricardo Peña
openaire +1 more source
Journal of Pure and Applied Algebra, 2015
\textit{P. Balmer} [\(K\)-Theory 19, No. 4, 311--363 (2000; Zbl 0953.18003)] gave a definition of Witt groups of a triangulated category with duality and gave a proof of a localization theorem for Witt groups of triangulated categories. This generated a big interest in the study of Witt groups in different contexts.
openaire +2 more sources
\textit{P. Balmer} [\(K\)-Theory 19, No. 4, 311--363 (2000; Zbl 0953.18003)] gave a definition of Witt groups of a triangulated category with duality and gave a proof of a localization theorem for Witt groups of triangulated categories. This generated a big interest in the study of Witt groups in different contexts.
openaire +2 more sources
Formal Derivation of Spanning Trees Algorithms
2003Graphs algorithms and graph-theoretical problems provide a challenging battlefield for the incremental development of proved models. The B event-based approach implements the incremental and proved development of abstract models which are translated into algorithms; we focus our methodology on the minimum spanning tree problem and on Prim's algorithm ...
Abrial, Jean-Raymond +2 more
openaire +2 more sources