Results 231 to 240 of about 45,469 (261)
Some of the next articles are maybe not open access.
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
Formal derivation of a list processing program
Information Processing Letters, 1980No abstract.
openaire +2 more sources
Formal Derivation of a Distributed Program in Event B
2011Achieving high dependability of distributed systems remains a major challenge due to complexity arising from concurrency and communication. There are a number of formal approaches to verification of properties of distributed algorithms. However, there is still a lack of methods that enable a transition from a verified formal model of communication to a
Alexei Iliasov +3 more
openaire +2 more sources
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM, 1975So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state. For the formal derivation of programs expressed in terms of these
openaire +3 more sources
FORMAL DERIVATION OF OBJECT-ORIENTED DESIGNS [PDF]
Formal methods provide rigorous approaches and proof mechanisms for the development and verification of software systems. Much of the work in this field has focussed on refinement, which models the relationship between abstract specifications and more concrete specifications.
openaire +2 more sources
Formal derivation of a loadable asynchronous counter
1998A loadable asynchronous counter is designed in a disciplined and formal manner. First, the behaviour of the counter is specified in terms of the way in which it handshakes with its environment. Next, the counter is decomposed into a linear array of cells, in which only adjacent cells can communicate, again by handshaking.
openaire +2 more sources
Formal derivation of a class of computers.
2004The aim of this thesis is to investigate how to use logic-based specification, construction, and proof methods to formally derive a class of computers. Differing from the traditional concepts of specification, verification and synthesis, the emphasis will be on the formal design process and the notion of derivation.
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 functional architectural design
Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004., 2004Ridha Khédri, Imen Bourguiba
openaire +2 more sources