ADA, Object-Oriented Techniques, and Concurrency in Teaching Data Structures and File Management

1993 ◽  
Author(s):  
Henry G. Gordon
Keyword(s):  
Data Structures ◽  
Object Oriented ◽  
File Management

Type-based confinement

2005 ◽  
Vol 16 (1) ◽  
pp. 83-128 ◽  
Author(s):  
TIAN ZHAO ◽  
JENS PALSBERG ◽  
JAN VITEK
Keyword(s):  
Data Structures ◽  
Type System ◽  
Object Oriented ◽  
Point Of View ◽  
Generic Extension ◽  
Practical Point ◽  
Related Research ◽  
Language Based Security ◽  
Object Graphs ◽  
Object Oriented Systems

Confinement properties impose a structure on object graphs which can be used to enforce encapsulation properties. From a practical point of view, encapsulation is essential for building secure object-oriented systems as security requires that the interface between trusted and untrusted components of a system be clearly delineated and restricted to the smallest possible set of operations and data structures. This paper investigates the notion of package-level confinement and proposes a type system that enforces this notion for a call-by-value object calculus as well as a generic extension thereof. We give a proof of soundness of this type system, and establish links between this work and related research in language-based security.

Description Mirror Features and Data Structures in an Optical CAD System

2014 ◽  
Vol 513-517 ◽  
pp. 796-799
Author(s):  
Jun Hai Jiang ◽  
Xiao Hui Yang
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
Optical System ◽  
Simple Structure ◽  
Optical Design ◽  
Object Oriented ◽  
Optical Lens ◽  
Cad System ◽  
System Components ◽  
Object Oriented Methods

CAD is presented in optical design, the use of object-oriented methods, optical lens structure described. Using object-oriented techniques to describe the object lens, and with VC++ language features to build such systems, construct a data structure of the optical system components. This method has a simple structure, portability, reusability of characteristics.

scholarly journals A Modal Proof Theory for Polynomial Coalgebras

2021 ◽  
Author(s):  
◽  
David Friggens
Keyword(s):  
Modal Logic ◽  
Computer Science ◽  
Programming Languages ◽  
Data Structures ◽  
Proof Theory ◽  
Object Oriented ◽  
Object Oriented Programming ◽  
Algebraic Methods ◽  
Mathematical Structures ◽  
Finite Constant

<p>The abstract mathematical structures known as coalgebras are of increasing interest in computer science for their use in modelling certain types of data structures and programs. Traditional algebraic methods describe objects in terms of their construction, whilst coalgebraic methods describe objects in terms of their decomposition, or observational behaviour. The latter techniques are particularly useful for modelling infinite data structures and providing semantics for object-oriented programming languages, such as Java. There have been many different logics developed for reasoning about coalgebras of particular functors, most involving modal logic. We define a modal logic for coalgebras of polynomial functors, extending Rößiger’s logic [33], whose proof theory was limited to using finite constant sets, by adding an operator from Goldblatt [11]. From the semantics we define a canonical coalgebra that provides a natural construction of a final coalgebra for the relevant functor. We then give an infinitary axiomatization and syntactic proof relation that is sound and complete for functors constructed from countable constant sets.</p>

scholarly journals MULTI-LEVEL PARALLEL FRAMEWORK

2014 ◽  
pp. 20-28
Author(s):  
Mitica Craus ◽  
Laurentiu Rudeanu
Keyword(s):  
Data Structures ◽  
Parallel Implementation ◽  
Object Oriented ◽  
Traveling Salesman ◽  
Problem Instance ◽  
Ant Colony Optimization Algorithm ◽  
Object Oriented Design ◽  
Multi Level ◽  
The Traveling Salesman Problem ◽  
Central Data

This article deals with the pyramidal framework designed to be used in the parallelization of the ant-like algorithms. Such algorithms have several things in common: they run in cycles and the process can be divided among different "processing units". The parallel implementation of the Ant Colony Optimization algorithm for the Traveling Salesman Problem is an application of this system. The topology of the framework architecture is similar to a B-tree and contains three types of processing nodes: a single master (the root), several sub-masters corresponding to the internal nodes of the tree and several slaves as leaves. First the master reads the problem instance, wraps it up in a message that is sent to all the other processing nodes and initializes the central data structures. Then, the slaves take over the control by starting the algorithm while the master and the sub-masters are waiting for requests to update the data. The framework has an object-oriented design and was implemented in C++, using the MPI library.

Object-oriented programming

2018 ◽  
Author(s):  
Michael Metcalf ◽  
John Reid ◽  
Malcolm Cohen
Keyword(s):  
Data Structures ◽  
Object Oriented ◽  
Object Oriented Programming ◽  
Language Support ◽  
Data Object ◽  
Object Oriented Approach ◽  
Definition Of ◽  
Abstract Types ◽  
Oriented Approach ◽  
Special Language

The object-oriented approach to programming and design is characterized by its focus on the data structures of a program rather than the procedures. Often, invoking a procedure with a data object as its principal argument is thought of as ‘sending a message’ to the object. Special language support is typically available for collecting these procedures (sometimes known as ‘methods’) together with the definition of the type of the object. This approach is supported in Fortran by type extension, polymorphic variables, type-bound procedures, abstract types, and finalization.

Sign in / Sign up

Export Citation Format

Share Document