Results 161 to 170 of about 655 (188)
Colony Binary Classification Based on Persistent Homology Feature Extraction and Improved EfficientNet. [PDF]
Bioengineering (Basel)Wang Z +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
The Algebraic Specification of Abstract Data Types
Acta Informatica, 1978There have been many recent proposals for embedding abstract data types in programming languages. In order to reason about programs using abstract data types, it is desirable to specify their properties at an abstract level, independent of any particular implementation.
John V. Guttag, James J. Horning
openaire +2 more sources
Specification of abstract data types using real-time process algebra (RTFA)
CCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH37436), 2004The real-time process algebra (RTFA) provides a new approach to the specification and refinement of real-time systems. This paper presents a study on the specification of a set of abstract data types (ADTs) by using RTPA. The objectives of this work are to demonstrate the expressiveness of the RTPA notations and specification method, and to build a ...
X. Tan, null Yingxu Wang
openaire +1 more source
Direct Implementation of Algebraic Specification of Abstract Data Types
IEEE Transactions on Software Engineering, 1982Algebraic specification is now an established way of formally defining abstract data types. For its practical use, however, a segment of program which conforms with the specification has to be generated. Such program segments can be manually produced and must then be verified.
openaire +1 more source
1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century, 2002
A transition graph is a formal tool dedicated to the specification of communicant processes. However, we show that it is a useful way to analyse and specify the behaviour of objects of the real world in order to model them in the form of classes. This paper presents the transition graphs theory. The class model features and establishes the relationship
R. Guetari, A. Haurat
openaire +1 more source
A transition graph is a formal tool dedicated to the specification of communicant processes. However, we show that it is a useful way to analyse and specify the behaviour of objects of the real world in order to model them in the form of classes. This paper presents the transition graphs theory. The class model features and establishes the relationship
R. Guetari, A. Haurat
openaire +1 more source
Algebraic specification of abstract data types
2001It is widely accepted that the quality of software can be improved if its design is systematically based on the principles of modularization and formalization. Modularization consists in replacing a problem by several “smaller” ones. Formalization consists in using a formal language; it obliges the software designer to be precise and principally allows
J. Loeckx, H.-D. Ehrich
openaire +1 more source
Limits of the "algebraic" specification of abstract data types
ACM SIGPLAN Notices, 1977This paper deals with the feasibility of the algebraic specification technique for abstract data types, which consists of a declaration of the operations of a data type and a finite set of "axioms" for the operations. We discuss some inherent difficulties arising from this technique and present a simple example of an abstract type for which the method ...
openaire +1 more source
1981
A generalization of our terminal algebra semantics approach is presented. We then give a uniform initial/terminal semantics of parameterized data type specifications.
Günter Hornung, Peter Raulefs
openaire +1 more source
A generalization of our terminal algebra semantics approach is presented. We then give a uniform initial/terminal semantics of parameterized data type specifications.
Günter Hornung, Peter Raulefs
openaire +1 more source
On Algebraic Specifications of Abstract Data Types
2003In this paper we address long standing open problems of Bergstra and Tucker about specifications of abstract data types by means of equations and conditional equations. By an abstract data type we mean the isomorphism type of an algebra. An algebra is algebraically specified if the algebra can be defined uniquely, in a certain precise sense, in terms ...
openaire +1 more source