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

Alma L. Juarez Dominguez

dblp:57/320 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2008
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 3 first-author

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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Embedded and real-time systems · 60% Distributed systems · 40%
Software engineering, system software, and programming languages
2 papers
Program verification · 57% Requirements engineering and software design · 43%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems
cyber-physical systems
0.112008
Feature Interaction Detection in the Automotive Domain · ASE 2008
Distributed systems
compositional reasoning
0.112005
Compositional reasoning for port-based distributed systems · ASE 2005
Program verification
model checking
0.012005
Compositional reasoning for port-based distributed systems · ASE 2005
Program verification
theorem proving
0.012005
Compositional reasoning for port-based distributed systems · ASE 2005

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

model checking · 0.3formal methods · 0.2theorem proving · 0.1
YearPublicationVenuePosition
2008 Modelling feature interactions in the automotive domain
abstract
We propose to use model checking to detect feature interactions in a set of features under design for an automotive embedded system. In this paper, we present (1) the characteristics of the feature interaction problem in the automotive domain that make model checking an appropriate detection technique; (2) our proposal for a general, systematic definition of feature interactions for this domain based on the set of actuators in the vehicle influenced by the features; and (3) our solutions to two modelling issues that arise when creating a description in SMV of the behaviour of an integrated set of automotive features designed in MATLAB's STATEFLOW.
Alma L. Juarez Dominguez, Nancy A. Day, Jeffrey J. Joyce
MiSE1
2008 Feature Interaction Detection in the Automotive Domain
abstract
The main goal of our research is to develop techniques for the detection of feature interactions for embedded systems in the automotive domain. Automotive systems are cyber-physical systems (CPS), which are composed of a "cyber" part that consists of software components running on digital hardware and a "physical" part that is the mechanical processes monitored by the software. Feature interactions in automotive systems arise from the activation of two or more features sending requests to the mechanical processes that create contradictory physical forces, possibly at distinct times, that cause unsafe behaviours. An example is having simultaneous requests to apply the brakes and the throttle. While both actions may be "correct" according to the intended behaviour of each feature, their interaction is undesired and potentially dangerous. To deal with the feature interaction problem, we propose to perform analysis at design time by using formal methods to detect all possible interactions.
Alma L. Juarez Dominguez
ASE1
2005 Compositional reasoning for port-based distributed systems
abstract
Many distributed systems using IP-based communication protocols consist of chains of components that run concurrently and communicate asynchronously with their neighbours through ports. We present a compositional reasoning method using model checking and theorem proving to verify liveness properties of a communication protocol for chains of connections consisting of an unknown number of components. We outline how our method is used to verify properties of the call protocol of AT&T's Distributed Feature Composition (DFC) architecture.
Alma L. Juarez Dominguez, Nancy A. Day
ASE1