Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “object-based programming”
What Is Alice · 2008
Alice is a visual programming language. Alice is an object based language. The objects in Alice are 3 dimensional models. The output of Alice programs are 3 dimensional movies. Visual Programming Programming is done by pointing and clicking, dragging and dropping, selecting from menus, and some typing Syntax errors removed from the equation no braces, no semi colons 3
Cited by 0
Libero Nigro, Francesco Tisato · 1988
RTO (Real-Time Objects) is an object-based programming paradigm suited for Real-Time and, in particular, Hard-Real-Time applications. A Real-Time (RT) system must provide (with high probability) response times small in comparison with the time constants of the environment. A Hard-Real-Time (HRT) system is a RT system which must also fulfill deterministic constraints on response times. The aim of RTO is to provide a test bed for the experimentation of concepts which are relevant in the RT area. Then it is focused on those dimensions of Object-Based language design [Wegner 87b] which are tightly related to specific requirements of that area. This paper introduces the rationale for the basic choices of RTO.
Cited by 0
Sergiu S. Simmel · ACM SIGPLAN OOPS Messenger · 1991
article Free Access Share on Object-based visual programming languages Author: Sergiu S. Simmel Oberon Software Inc. Oberon Software Inc.View Profile Authors Info & Claims ACM SIGPLAN OOPS MessengerVolume 3Issue 4Oct. 1, 1992 https://doi.org/10.1145/143776.270578Published:01 September 1991Publication History 0citation420DownloadsMetricsTotal Citations0Total Downloads420Last 12 Months28Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cited by 0
Gabor Grothendieck, Louis Kates, Thomas Petzoldt · 2005
An object oriented system using object-based, also called prototype-based, rather than class-based object oriented ideas.
Cited by 2Open access
Jean-François Perrot · 1992
Cited by 0
Eric Maston · Journal of Bioresource Management · 2006
This course is a basic introduction to object oriented programming utilizing the Visual Basic programming language.
Cited by 0Open access
Jules White, Douglas C. Schmidt, Andrey Nechypurenko · 2008
Abstract. Feature models help to simplify the development of productlines for component-based systems by capturing the key commonalities and variabilities of an application and how they relate to component configuration and composition. Performing requirements-driven feature selection from a feature model, such as selecting a maximal set of features whose constituent components fit within the target infrastructure’s memory, motivates the use of a constraint solver. Building a constraint solver-based feature selection engine is hard, however, since solvers typically have low-level APIs and require complex transformations on data encapsulated in multiple features. To address these challenges, we developed an approach called Role-based Object Constraints (ROCs). This paper provides the following contributions to the study of building reusable feature selection engines for component-based applications: (1) it presents the techniques that can be used to decouple applications and constraint solvers to make solver-based solutions reusable, (2) it shows how to select and coordinate multiple constraint solvers dynamically to increase performance, and (3) it presents results from applying ROCs to a case study that selects software features for mobile devices and shows how ROCs increases modularity, reusability, and performance compared with a tightly-coupled single-solver solution. 1
Cited by 0
Guerraoui, Rachid, ECOOP 1993 Kaiserslautern · 1994
Cited by 0
Roger S. Chin, Samuel T. Chanson · ACM Computing Surveys · 1991
The development of distributed operating systems and object-based programming languages makes possible an environment in which programs consisting of a set of interacting modules, or objects, may execute concurrently on a collection of loosely coupled processors. An object-based programming language encourages a methodology for designing and creating a program as a set of autonomous components, whereas a distributed operating system permits a collection of workstations or personal computers to be treated as a single entity. The amalgamation of these two concepts has resulted in systems that shall be referred to as distributed , object-based programming systems . This paper discusses issues in the design and implementation of such systems. Following the presentation of fundamental concepts and various object models, issues in object management, object interaction management, and physical resource management are discussed. Extensive examples are drawn from existing systems.
Cited by 212Open access
Yoram Atir, David Harel, Asaf Kleinbort et al. · Lecture notes in computer science · 2008
Cited by 9Open access
Marco Servetto, Elena Zucca · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2021
We show that a minimal subset of Java 8 excluding classes supports a simple and natural programming style, which we call λ-based object-oriented programming. That is, on one hand the programmer can use tuples in place of objects (class instances), and tuples can be desugared to lambdas following their classical encoding in the λ-calculus. On the other hand, lambdas can be equipped with additional behaviour, thanks to the fact that they may implement interfaces with default methods, hence inheritance and dynamic dispatch are still supported. We formally describe the encoding by a translation from FJλ, an FJ variant including lambdas and interfaces with default methods, to FJλ-, a subset of FJλ with no classes (hence no constructors and fields). We provide several examples illustrating this novel programming style.
Cited by 0Open access
David M. Kunzman, Laxmikant V. Kalé · Scientific Programming · 2011
Heterogeneous clusters that include accelerators have become more common in the realm of high performance computing because of the high GFlop/s rates such clusters are capable of achieving. However, heterogeneous clusters are typically considered hard to program as they usually require programmers to interleave architecture-specific code within application code. We have extended the Charm++ programming model and runtime system to support heterogeneous clusters (with host cores that differ in their architecture) that include accelerators. We are currently focusing on clusters that include commodity processors, Cell processors, and Larrabee devices. When our extensions are used to develop code, the resulting code is portable between various homogeneous and heterogeneous clusters that may or may not include accelerators. Using a simple example molecular dynamics (MD) code, we demonstrate our programming model extensions and runtime system modifications on a heterogeneous cluster comprised of Xeon and Cell processors. Even though there is no architecture-specific code in the example MD program, it is able to successfully make use of three core types, each with a different ISA (Xeon, PPE, SPE), three SIMD instruction extensions (SSE, AltiVec/VMX and the SPE's SIMD instructions), and two memory models (cache hierarchies and scratchpad memories) in a single execution. Our programming model extensions abstract away hardware complexities while our runtime system modifications automatically adjust application data to account for architectural differences between the various cores.
Cited by 17Open access
David M. Kunzman, Laxmikant V. Kalé · SHILAP Revista de lepidopterología · 2011
Heterogeneous clusters that include accelerators have become more common in the realm of high performance computing because of the high GFlop/s rates such clusters are capable of achieving. However, heterogeneous clusters are typically considered hard to program as they usually require programmers to interleave architecture-specific code within application code. We have extended the Charm++ programming model and runtime system to support heterogeneous clusters (with host cores that differ in their architecture) that include accelerators. We are currently focusing on clusters that include commodity processors, Cell processors, and Larrabee devices. When our extensions are used to develop code, the resulting code is portable between various homogeneous and heterogeneous clusters that may or may not include accelerators. Using a simple example molecular dynamics (MD) code, we demonstrate our programming model extensions and runtime system modifications on a heterogeneous cluster comprised of Xeon and Cell processors. Even though there is no architecture-specific code in the example MD program, it is able to successfully make use of three core types, each with a different ISA (Xeon, PPE, SPE), three SIMD instruction extensions (SSE, AltiVec/VMX and the SPE's SIMD instructions), and two memory models (cache hierarchies and scratchpad memories) in a single execution. Our programming model extensions abstract away hardware complexities while our runtime system modifications automatically adjust application data to account for architectural differences between the various cores.
Cited by 1Open access
A. S. M. Sajeev · 2003
Object-based multiprocessor systems provide facilities for preserving instances of data structures in their original form and manipulating them in parallel. This imposes demands on programming language designs to provide parallel processing with persistent object manipulation. Aleph is a language designed for parallel processing in such an environment. The author describes the main features of Aleph with emphasis on management of persistent objects. Aleph considers objects in a uniform manner. Any object which can have a temporary existence can have a permanent existence and vice versa. Persistent objects of arbitrary structure can be copied into the transient space, manipulated and copied back into the persistent space, or can be more conveniently manipulated in the persistent space itself, avoiding such copying. A persistent object is accessed by a unique capability. Aleph does not define the structure of a capability. This makes it general enough to be implemented in object-based systems which use different concepts of capabilities. Aleph is essentially a parallel processing language where processes act as clients and/or servers to other processes.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 3
Guerraout, Rachid · OpenGrey (Institut de l'Information Scientifique et Technique) · 1992
Cited by 0
Mark R. Laff, Brent Hailpern · 1985
Programming systems traditionally deal with only a few different types of data objects. Operating-system command languages, for example, are concerned with files and programs. Typical programming languages deal with computer-related objects such as integers, strings, arrays, and records. This is in sharp contrast to the variety of real-world objects that people reason about. Smallworld is a programming environment in which the real world is represented by objects that have properties. A property represents a fact about the corresponding real-world entity. Thus Smallworld actions (programs), which operate on objects specified in this simple but general way, are “smart”: they consider all of the relevant facts concerning (that is, all of the properties of) the objects they manipulate.
Cited by 10
Mark R. Laff, Brent Hailpern · ACM SIGPLAN Notices · 1985
Programming systems traditionally deal with only a few different types of data objects. Operating-system command languages, for example, are concerned with files and programs. Typical programming languages deal with computer-related objects such as integers, strings, arrays, and records. This is in sharp contrast to the variety of real-world objects that people reason about. Smallworld is a programming environment in which the real world is represented by objects that have properties . A property represents a fact about the corresponding real-world entity. Thus Smallworld actions (programs), which operate on objects specified in this simple but general way, are “smart”: they consider all of the relevant facts concerning (that is, all of the properties of) the objects they manipulate. Smallworld was strongly influenced by the design of Smalltalk, especially in the organization of objects into classes and superclasses. The two languages differ (1) in their treatment of the difference between classes and objects that are not classes and (2) in their definition of methods that act on classes. Smallworld minimizes the differences between classes and non-class objects, resulting in a simpler and more consistent system. Where Smalltalk is a programming language using a pure object-oriented paradigm and dependent on a powerful graphical interface, Smallworld is a shell language that runs on conventional terminals and allows multiple program paradigms where appropriate.
Cited by 1Open access
2005
Cited by 1
Naftaly H. Minsky, David Rozenshtein · 1987
The central idea behind this paper is that the discipline governing the exchange of messages between objects should be specifiable by the programmer in the form of an explicit law of the system. We show how, starting from a very primitive foundation, which presumes neither encapsulation nor inheritance, one can establish various forms of both, as well as other useful disciplines, simply by means of appropriate laws.
Cited by 50
Naftaly H. Minsky, David Rozenshtein · ACM SIGPLAN Notices · 1987
The central idea behind this paper is that the discipline governing the exchange of messages between objects should be specifiable by the programmer in the form of an explicit law of the system . We show how, starting from a very primitive foundation, which presumes neither encapsulation nor inheritance, one can establish various forms of both, as well as other useful disciplines, simply by means of appropriate laws.
Cited by 5Open access