Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

James Vera

dblp:67/5693 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 5 · 1 first-authorSystems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Requirements engineering and software design · 100%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Distributed systems · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Requirements engineering and software design › software architecture › architecture description
architecture description language
0.021995
An Event-Based Architecture Definition Language · IEEE Trans. Software Eng. 1995
Specification and Analysis of System Architecture Using Rapide · IEEE Trans. Software Eng. 1995
Requirements engineering and software design
software architecture
0.021995
An Event-Based Architecture Definition Language · IEEE Trans. Software Eng. 1995
Specification and Analysis of System Architecture Using Rapide · IEEE Trans. Software Eng. 1995
Distributed systems
distributed coordination
0.011991
Exploiting Locality in Maintaining Potential Causality · PODC 1991
Distributed systems › distributed algorithms
logical clocks
0.011991
Exploiting Locality in Maintaining Potential Causality · PODC 1991
Logic in computer science
causality
0.011991
Exploiting Locality in Maintaining Potential Causality · PODC 1991
Distributed systems › distributed database
distributed transactions
0.011995
Specification and Analysis of System Architecture Using Rapide · IEEE Trans. Software Eng. 1995

Methods — techniques the papers use, named apart from their topics

poset execution model · 0.0event-based simulation · 0.0event-based modeling · 0.0causal event modeling · 0.0locality exploitation · 0.0
YearPublicationVenuePosition
1999 Event-Based Execution Architectures for Dynamic Software Systems
James Vera, Louis Perrochon, David C. Luckham
WICSA1
1995 Specification and Analysis of System Architecture Using Rapide
abstract
Rapide is an event-based, concurrent, object-oriented language specifically designed for prototyping system architectures. Two principle design goals are: (1) to provide constructs for defining executable prototypes of architectures and (2) to adopt an execution model in which the concurrency, synchronization, dataflow, and timing properties of a prototype are explicitly represented. This paper describes the partially ordered event set (poset) execution model and outlines with examples some of the event-based features for defining communication architectures and relationships between architectures. Various features of Rapide are illustrated by excerpts from a prototype of the X/Open distributed transaction processing reference architecture.>
David C. Luckham, John J. Kenney, Larry M. Augustin, James Vera, Doug Bryan, Walter Mann
IEEE Trans. Software Eng.4
1995 Correction to "Specification and Analysis of System Architecture Using Rapide"
David C. Luckham, John J. Kenney, Larry M. Augustin, James Vera, Doug Bryan, Walter Mann
IEEE Trans. Software Eng.4
1995 An Event-Based Architecture Definition Language
abstract
This paper discusses general requirements for architecture definition languages, and describes the syntax and semantics of the subset of the Rapide language that is designed to satisfy these requirements. Rapide is a concurrent event-based simulation language for defining and simulating the behavior of system architectures. Rapide is intended for modelling the architectures of concurrent and distributed systems, both hardware and software in order to represent the behavior of distributed systems in as much detail as possible. Rapide is designed to make the greatest possible use of event-based modelling by producing causal event simulations. When a Rapide model is executed it produces a simulation that shows not only the events that make up the model's behavior, and their timestamps, but also which events caused other events, and which events happened independently. The architecture definition features of Rapide are described: event patterns, interfaces, architectures and event pattern mappings. The use of these features to build causal event models of both static and dynamic architectures is illustrated by a series of simple examples from both software and hardware. Also we give a detailed example of the use of event pattern mappings to define the relationship between two architectures at different levels of abstraction. Finally, we discuss briefly how Rapide is related to other event-based languages.>
David C. Luckham, James Vera
IEEE Trans. Software Eng.2
1993 Partial orderings of event sets and their application to prototyping concurrent, timed systems
abstract
RAPIDE is a concurrent, object-oriented language specifically designed for prototyping large concurrent systems. One of the principle design goals has been to adopt a computation model in which the synchronization, concurrency, data flow, and timing aspects of a prototype are explicitly represented and easily accessible both to the prototype itself and to the prototyper. This article describes the partially ordered event set (poset) computation model and the features of RAPIDE for using posets in reactive prototypes and for automatically checking posets. An example prototyping scenario illustrates uses of the poset computation model, with and without timing.
David C. Luckham, James Vera, Doug Bryan, Larry M. Augustin, Frank C. Belz
J. Syst. Softw.2
1991 Exploiting Locality in Maintaining Potential Causality
abstract
In distributed systems it is often important to be able to determine the temporal relationships between events generated by differentprocesses.An algorithm
Sigurd Meldal, Sriram Sankar, James Vera
PODC3