Design-Time/Run-Time Mapping of Security-Critical Applications in Heterogeneous MPSoCs

2016 ◽  
Author(s):  
Andreas Weichslgartner ◽  
Stefan Wildermann ◽  
Johannes Götzfried ◽  
Felix Freiling ◽  
Michael Glaß ◽  
...  
Keyword(s):  
Design Time ◽  
Run Time

Linking run-time resource management of embedded multi-core platforms with automated design-time exploration

2011 ◽  
Vol 5 (2) ◽  
pp. 123 ◽  
Author(s):  
C. Ykman-Couvreur ◽  
P. Avasare ◽  
G. Mariani ◽  
G. Palermo ◽  
C. Silvano ◽  
...  
Keyword(s):  
Resource Management ◽  
Automated Design ◽  
Design Time ◽  
Run Time ◽  
Time Resource

scholarly journals Model-Based Tool-Assistance for Packet-Filter Design and its Future

2014 ◽  
Vol 13 (1) ◽  
pp. 4053-4057
Author(s):  
Gurvinder Kaur ◽  
Dr. S.N. Panda ◽  
Dr. Dalvinder Singh Dhaliwal
Keyword(s):  
Filter Design ◽  
Packet Filtering ◽  
Packet Filter ◽  
Design Time ◽  
Model Based ◽  
Log Files ◽  
Run Time ◽  
Private Network ◽  
Is Design ◽  
Access Model

Firewall is a device that secure the private network from unauthorized access. Model based  tool assistance  facilitate the design task and has contribute to the correctness of the filters. But the model based tool assistance approach is design time only does not manage actions at run time. So we shall propose model on run time auditing architecture to detect the attack while packet filtering in firewall technology. It is usually based on the log-files of the packet-filters.

scholarly journals A Design-Time/Run-Time Application Mapping Methodology for Predictable Execution Time in MPSoCs

2018 ◽  
Vol 17 (5) ◽  
pp. 1-25 ◽  
Author(s):  
Andreas Weichslgartner ◽  
Stefan Wildermann ◽  
Deepak Gangadharan ◽  
Michael Glaß ◽  
Jürgen Teich
Keyword(s):  
Execution Time ◽  
Application Mapping ◽  
Design Time ◽  
Run Time

A Semantic Approach to Deploying Product-Service Systems

2017 ◽  
Vol 8 (1) ◽  
pp. 24-42
Author(s):  
Robert Andrei Buchmann ◽  
Dimitris Karagiannis
Keyword(s):  
Code Generation ◽  
Modeling Method ◽  
Service Systems ◽  
Modeling Languages ◽  
Levels Of Abstraction ◽  
Semantic Approach ◽  
Design Time ◽  
Product Service ◽  
Run Time ◽  
Product Service Systems

Conceptual modeling is commonly employed for two classes of goals: (1) as input for run-time functionality (e.g., code generation) and (2) as support for design-time analysis (e.g., in business process management). An inherent trade-off manifests between such goals, as different levels of abstraction and semantic detail is needed. This has led to a multitude of modeling languages that are conceptually redundant (i.e., they share significant parts of their metamodels) and a dilemma of selecting the most adequate language for each goal. This article advocates the substitution of the selection dilemma with an approach where the modeling method is agilely tailored for the semantic variability required to cover both run-time and design-time concerns. The semantic space enabled by such a method is exposed to model-driven systems as RDF knowledge graphs, whereas the method evolution is managed with the Agile Modeling Method Engineering framework. The argument is grounded in the application area of Product-Service Systems, illustrated by a project-based modeling method.

scholarly journals Quality attribute trade-offs in the embedded systems industry: an exploratory case study

2019 ◽  
Vol 28 (2) ◽  
pp. 505-534 ◽  
Author(s):  
Darius Sas ◽  
Paris Avgeriou
Keyword(s):  
Embedded Systems ◽  
Ad Hoc ◽  
Quality Attributes ◽  
Tool Support ◽  
Exploratory Case Study ◽  
Design Time ◽  
Trade Offs ◽  
Run Time ◽  
Automated Tools

AbstractThe embedded systems domain has grown exponentially over the past years. The industry is forced by the market to rapidly improve and release new products to beat the competition. Frenetic development rhythms thus shape this domain and give rise to several new challenges for software design and development. One of them is dealing with trade-offs between run-time and design-time quality attributes. To study practices, processes and tools concerning the management of run-time and design-time quality attributes as well as the trade-offs among them from the perspective of embedded systems software engineers. An exploratory case study with two qualitative data collection steps, namely interviews and a focus group, involving six different companies from the embedded systems domain with a total of twenty participants. The interviewed subjects showed a preference for run-time over design-time qualities. Trade-offs between design-time and run-time qualities are very common, but they are often implicit, due to the lack of adequate monitoring tools and practices. Practitioners prefer to deal with trade-offs in the most lightweight way possible, by applying ad-hoc practices, thus avoiding any overhead incurred. Finally, practitioners have elaborated on how they envision the ideal tool support for dealing with trade-offs. Although it is notoriously difficult to deal with trade-offs, constantly monitoring the quality attributes of interest with automated tools is key in making explicit and prudent trade-offs and mitigating the risk of incurring technical debt.

Dynamic networks of heterogeneous timed machines

2017 ◽  
Vol 28 (6) ◽  
pp. 800-855
Author(s):  
JOSÉ FIADEIRO ◽  
ANTÓNIA LOPES ◽  
BENOÎT DELAHAYE ◽  
AXEL LEGAY
Keyword(s):  
Dynamic Networks ◽  
Input Output ◽  
Design Time ◽  
New States ◽  
Run Time ◽  
Refinement Operator ◽  
Two Machines

We present an algebra of discrete timed input/output automata that may execute in the context of different clock granularities – which we call timed machines; this algebra includes a refinement operator through which a machine can be extended with new states and transitions in order to accommodate a finer clock granularity as required to interoperate with other machines, and an extension of the traditional product of timed input–output automata to the situation in which the granularities of the two machines are not the same. Over this algebra, we then define an algebra of networks of timed machines that includes operations through which networks can be modified at run time, thus offering a model for systems of interconnected components that can dynamically bind to other systems and, therefore, cannot be adjusted at design time to ensure that they operate in a timed homogeneous setting. We investigate important properties of timed machines such as consistency – in the sense that a machine can be ensured to generate a non-empty language, and feasibility – in the sense that a machine can be ensured to generate a non-empty language no matter what inputs it receives, and propose techniques for checking if timed machines are consistent or are feasible. We generalise those properties to networks of timed machines, and investigate how consistency and feasibility of networks can be proved through properties that can be checked at design time without having to compute, at run time, the product of the machines that operate on those networks, which would not be practical.

Sign in / Sign up

Export Citation Format

Share Document