Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 3,094 papers for “concurrent objects”

Concurrent objects

Maurice Herlihy, Nir Shavit, Victor Luchangco et al. · Elsevier eBooks · 2020

Cited by 0

Concurrent Objects

In Process Calculus, Benjamin C. Pierce, David N. Turner · 1995

Cited by 0

concurrent objects

Denys Duchier, Céline Kuttler · 2008

In recent years, there has been increasing interest in computational models of biological systems based on various calculi of communicating processes, such as the stochastic pi-calculus. These models make it possible to simulate and eventually visualize the dynamic evolution of complex biosystems in time and under varying environmental conditions. While the elegance of the pi-calculus lies in its minimality, this is also a drawback when it comes to modeling because much effort must be devoted to encoding highlevel ideas into the low-level means that the language affords us. In this paper, we describe an on-going effort to design a new higher-level programming language that provides direct ontological support for the concepts which are used to formulate, organize and structure models of biomolecular systems. Our language has an object-oriented flavour where we view molecular components as agents with finite sets of behaviours (states). Reactions are modeled as exchanges over connected ports that may cause agents to switch states. Key words: biological systems, stochastic pi-calculus, communicating agents, systems biology, simulation, programming 1

Cited by 0

Concurrent organizational objects

Peter de Jong · 1991

A concurrent organizational object, called the Ubik Configurator, is described. This object generalizes the Actor model to provide support for the following collections of Actors: organizations - referenced collections, Sponsors - executing collections, message sets - mail queue collections, and active messages - cooperative behavior on collections of Actors.

Cited by 1

Composing concurrent objects

Lodewijk Bergmans · 1994

Adopting the object-oriented paradigm for the development of large and complex software systems offers several advantages, of which increased extensibility and reusability are the most prominent ones. The object-oriented model is also quite suitable for modelling concurrent systems. However, it appears that extensibility and reusability of concurrent applications is far from trivial. In addition, very little attention has been paid by the conventional object-oriented development methodologies to the analysis and design of synchronisation constraints for concurrent objects.

Cited by 70Open access

Designing concurrent objects

Robert G. Clark · 1987

article Designing concurrent objects Share on Author: Robert G. Clark Univ. of Stirling, Stirling, Scotland Univ. of Stirling, Stirling, ScotlandView Profile Authors Info & Claims ACM SIGAda Ada LettersVolume VIIIssue 6Fall 1987 pp 107–109https://doi.org/10.1145/36792.36814Online:01 October 1987Publication History 1citation98DownloadsMetricsTotal Citations1Total Downloads98Last 12 Months2Last 6 weeks0 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 SiteGet Access

Cited by 0

On Concurrent Internet Objects

Wouter Joosen, Frank Matthijs, Johan Van Oeyen et al. · 1996

: CORRELATE is a concurrent object-oriented language with a flexible run time system that enables the instantiation of application specific run time objects. Recently we have exploited this capability in the development of mobile agents for large scale distributed computing systems, such as the Internet. Our aim is to integrate CORRELATE with WWW. In the simple case, CORRELATE objects reside on a WWW server; they can be used via the gateway mechanism. In addition to that, the user (client) can launch CORRELATE objects as well, thus instantiating (possibly mobile) agents at the client side. Our environment is experimental, we hope to discuss ongoing work and future enhancements on the OOPSLA96 workshop. 1 Introduction The concept of an agent is evolving to become widely applied in the development of new application software, ranging from entities such as mobile Internet agents Researcher for the Flemish I.W.T. y Research Assistant of the Belgian National Fund for Scientific Resear...

Cited by 0

Concurrent Objects and Beyond

Gul Agha, 五十嵐 淳, Atsushi Igarashi et al. · Tokyo Tech Research Repository (Tokyo Institute of Technology) · 2015

Cited by 0

Axioms for Concurrent Objects

Maurice Herlihy, Jennette M. Wing · 1987

Specification and verification techniques for abstract data types that have been successful for sequential programs can be extended in a natural way to provide the same benefits for concurrent programs.We propose an approach to specifying and verifying concurrent objects based on a novel correctness condition, which we call linearizability.Linearizability provides the illusion that each operation takes effect instantaneously at some point between its invocation and its response, implying that the meaning of a concurrent object's operations can still be given by pre-and postconditions.In this paper, we will define and discuss linearizability, and then give examples of how to reason about concurrent objects and verify their implementations based on their (sequential) axiomatic specifications.

Cited by 33

The Concurrent Objects Calculus

Qian Zhang, Weihua Li, Chen Shi-hong · 2002

Research in concurrent object-oriented programming languages has suffered from the lack of a widely accepted formal foundation for describing the semantics of concurrent object systems. Based on the /spl pi/-calculus and the actor model respectively, people have tried to define a common semantic framework for concurrent object-oriented programming. In this paper, we try to compromise these two approaches. We define a formalism that enjoys a clean formal definition which allows the reuse of standard results of the theory of concurrency while preserving a high-level object-oriented programming style. We propose an actor algebra and a concurrent object calculus, and then we give the translation relationship between the two.

Cited by 0

Axioms for concurrent objects

Herlihy, Maurice, Wing, Jeannette Marie. · KiltHub Repository · 2018

Computer Science Department

Cited by 0Open access

AXIOMS FOR CONCURRENT OBJECTS

Dtic Tab, Unannounced Li Dtic, L Maurice et al. · 1987

When Government drawings, specifications, or other data are used for any purpose other than in connection with a definitely Government-related procurement, the United States Government incurs no responsibility or any obligation whatsoever. The fact that the Government may have formulated or in any way supplied the said drawings, specifications, or other data, is not to be regarded by implication, or otherwise in any manner construed, as licensing the holder, or any other person or corporation; or as conveying any rights or permission to manufacture, use, or sell any patented invention that may in any way be related thereto. This report has been reviewed by the Office of Public Affairs (ASD/PA)

Cited by 0

Progress of Concurrent Objects

Hongjin Liang, Xinyu Feng · Foundations and Trends® in Programming Languages · 2020

Implementations of concurrent objects should guarantee linearizability and a progress property such as wait-freedom, lock-freedom, starvation-freedom, or deadlock-freedom. These progress properties describe conditions under which a method call is guaranteed to complete. However, they fail to describe how clients are affected, making it difficult to utilize them in layered and modular program verification. Also we lack verification techniques for starvation-free or deadlock-free objects. They are challenging to verify because the fairness assumption introduces complicated interdependencies among progress of threads. Even worse, none of the existing results applies to concurrent objects with partial methods, i.e., methods that are supposed not to return under certain circumstances. A typical example is the lock_acquire method, which must not return when the lock has already been acquired. In this tutorial we examine the progress properties of concurrent objects. We formulate each progress property (together with linearizability as a basic correctness requirement) in terms of contextual refinement. This essentially gives us progress-aware abstraction for concurrent objects. Thus, when verifying clients of the objects, we can soundly replace the concrete object implementations with their abstractions, achieving modular verification. For concurrent objects with partial methods, we formulate two new progress properties, partial starvation-freedom (PSF) and partial deadlock-freedom (PDF). We also design four patterns to write abstractions for PSF or PDF objects under strongly or weakly fair scheduling, so that these objects contextually refine their abstractions. Finally, we introduce a rely-guarantee style program logic LiLi for verifying linearizability and progress together for concurrent objects. It unifies thread-modular reasoning about all the six progress properties (wait-freedom, lock-freedom, starvation-freedom, deadlock-freedom, PSF and PDF) in one framework. We have successfully applied LiLi to verify starvation-freedom or deadlock-freedom of representative algorithms such as lock-coupling lists, optimistic lists and lazy lists, and PSF or PDF of lock algorithms.

Cited by 2Open access

Reification of concurrent objects

Menezes, Paulo F. Blauth · OpenGrey (Institut de l'Information Scientifique et Technique) · 1997

Nonsequential automata constitute a non-interleaving categorical semantic domain for reactive, communicating and concurrent systems. It is based on labeled transition systems, inspired by Meseguer and Montanaril's "Petri Nets are Monoids" where synchronization and encapsulation operations are functional and a class of morphisms stands for reification. It is for our knowledge, the first model for concurrence which satisfies the diagonal compositionality requirement, i.e., reifications compose (vertical) and nonsequential automata, Petri nets and sequential automata are provided extending the approach of Winskel, Nielson and Sassone where a scene for a formal classification of models for concurrence is set. The steps of abstraction involved in moving between models show that nonsequential automata are more concrete than Petri nets and sequential automata. To experiment with the proposed semantic domain, a semantics for a concurrent, object-based language named Nautilus is given. It is a simplified and revised version of the object-oriented specification language GNOME, introducing some special features inspired by the semantic domain such as reification and aggregation. The diagonal composition is an essential property to give semantics in this context

Cited by 1Open access