• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 2,222
Next 10 →

The 4+1 view model of architecture

by Philippe B. Kruchten - IEEE SOFTWARE , 1995
"... The 4+1 View Model organizes a description of a software architecture using five concurrent views, each of which addresses a specific set of concerns. Architects capture their design decisions in four views and use the fifth view to illustrate and validate them. ..."
Abstract - Cited by 563 (4 self) - Add to MetaCart
The 4+1 View Model organizes a description of a software architecture using five concurrent views, each of which addresses a specific set of concerns. Architects capture their design decisions in four views and use the fifth view to illustrate and validate them.

Concurrent Constraint Programming

by Vijay A. Saraswat, Martin Rinard , 1993
"... This paper presents a new and very rich class of (con-current) programming languages, based on the notion of comput.ing with parhal information, and the con-commitant notions of consistency and entailment. ’ In this framework, computation emerges from the inter-action of concurrently executing agent ..."
Abstract - Cited by 502 (16 self) - Add to MetaCart
This paper presents a new and very rich class of (con-current) programming languages, based on the notion of comput.ing with parhal information, and the con-commitant notions of consistency and entailment. ’ In this framework, computation emerges from the inter-action of concurrently executing

Concurrent Viewing of Multiple Attribute-Specific Subspaces

by Robert Sisneros, C. Ryan Johnson, Jian Huang - Proc. of EuroVis'08 (Eurographics/IEEE VGTC Symposium on Visualization , 2008
"... In this work we present a point classification algorithm for multi-variate data. Our method is based on the concept of attribute subspaces, which are derived from a set of user specified attribute target values. Our classification approach enables users to visually distinguish regions of saliency th ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
through concurrent viewing of these subspaces in single images. We also allow a user to threshold the data according to a specified distance from attribute target values. Based on the degree of thresholding, the remaining data points are assigned radii of influence that are used for the final coloring

A Truly Concurrent View of Linda Interprocess Communication

by N. Busi, R. Gorrieri, G. Zavattaro , 1997
"... S. All local authors can be reached via e-mail at the address last-name@cs.unibo.it. Questions and comments should be addressed to tr-admin@cs.unibo.it. Recent Titles from the UBLCS Technical Report Series 95-8 Building Hypermedia for Learning: a Framework Based on the Design of User Interface, S ..."
Abstract - Cited by 5 (4 self) - Add to MetaCart
July 1995). 95-11 The Inherent Cost of Strong-Partial View-Synchronous Communication, O. Babao glu, R. Davoli, L.-A. Giachini, P. Sabattini, April 1995. 95-12 On the Complexity of Beta-Reduction, A. Asperti, July 1995. 95-13 Optimal Multi-Block Read Schedules for Partitioned Signature Files, P. Ciaccia

Statecharts: A Visual Formalism For Complex Systems

by David Harel , 1987
"... We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discrete-event systems, such as multi-computer real-time systems, communication protocols and digital control units. Our diagrams, which we cal ..."
Abstract - Cited by 2704 (56 self) - Add to MetaCart
call statecharts, extend conventional state-transition diagrams with essentially three olements, dealing, respectively, with the notions of hierarchy, concurrency and communication. These transform the language of state diagrams into a highly structured' and economical description language

Relations in Concurrency

by Glynn Winskel
"... The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated via spans of event structures, and the seman ..."
Abstract - Cited by 305 (36 self) - Add to MetaCart
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated via spans of event structures

Concurrent View Maintenance Scheme for Soft Real-Time Data Warehouse Systems

by Namgyu Kim, Songchun Moon
"... The data warehouse should be refreshed periodically or aperiodically in order to prevent OLAP transactions from reading extremely stale data. This refreshing process is referred to as view maintenance. There have been many researches on ways to preserve data consistency during the process of view ma ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
propose a new algorithm for performing view maintenance without blocking OLAP transactions. Our algorithm improves data freshness by allowing one or more maintenance transactions and OLAP transactions to be executed concurrently. We introduce the details of algorithm with some examples, present proofs

Modelling Concurrency with Partial Orders

by Vaughan Pratt , 1986
"... Concurrency has been expressed variously in terms of formal languages (typically via the shuffle operator), partial orders, and temporal logic, inter alia. In this paper we extract from these three approaches a single hybrid approach having a rich language that mixes algebra and logic and having a n ..."
Abstract - Cited by 260 (17 self) - Add to MetaCart
natural class of models of concurrent processes. The heart of the approach is a notion of partial string derived from the view of a string as a linearly ordered multiset by relaxing the linearity constraint, thereby permitting partially ordered multisets or pomsets. Just as sets of strings form languages

Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving

by Makoto Yokoo, Toru Ishida, Edmund H. Durfee, Kazuhiro Kuwabara , 1992
"... Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs). In particul ..."
Abstract - Cited by 295 (23 self) - Add to MetaCart
Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs

Views: Compositional Reasoning for Concurrent Programs

by Thomas Dinsdale-young, Lars Birkedal, Matthew Parkinson, Hongseok Yang
"... Compositional abstractions underly many reasoning principles for concurrent programs: the concurrent environment is abstracted in order to reason about a thread in isolation; and these abstractions are composed to reason about a program consisting of many threads. For instance, separation logic uses ..."
Abstract - Cited by 33 (7 self) - Add to MetaCart
variables. In this paper, we present the “Concurrent Views Framework”, a metatheory of concurrent reasoning principles. The theory is parameterised by an abstraction of state with a notion of composition, which we call views. The metatheory is remarkably simple, but highly applicable: the rely
Next 10 →
Results 1 - 10 of 2,222
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University