Entity

Time filter

Source Type

Mountain View, CA, United States

Von Essen C.,French National Center for Scientific Research | Jobstmann B.,French National Center for Scientific Research | Jobstmann B.,Jasper Design Automation | Jobstmann B.,Ecole Polytechnique Federale de Lausanne
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

We present a new and flexible approach to repair reactive programs with respect to a specification. The specification is given in linear-temporal logic. Like in previous approaches, we aim for a repaired program that satisfies the specification and is syntactically close to the faulty program. The novelty of our approach is that it produces a program that is also semantically close to the original program by enforcing that a subset of the original traces is preserved. Intuitively, the faulty program is considered to be a part of the specification, which enables us to synthesize meaningful repairs, even for incomplete specifications. Our approach is based on synthesizing a program with a set of behaviors that stay within a lower and an upper bound. We provide an algorithm to decide if a program is repairable with respect to our new notion, and synthesize a repair if one exists. We analyze several ways to choose the set of traces to leave intact and show the boundaries they impose on repairability. We have evaluated the approach on several examples. © 2013 Springer-Verlag. Source


Ali R.,Bournemouth University | Griggio A.,Fondazione Bruno Kessler | Franzen A.,Jasper Design Automation | Dalpiaz F.,University of Trento | Giorgini P.,University of Trento
Lecture Notes in Business Information Processing | Year: 2012

Monitoring the system environment is a key functionality of a self-adaptive system. Monitoring requirements denote the information a self-adaptive system has to capture at runtime to decide upon whether an adaptation action has to be taken. The identification of monitoring requirements is a complex task which can easily lead to redundancy and uselessness in the set of information to monitor and this, consequently, means unjustified instalment of monitoring infrastructure and extra processing time. In this paper, we study the optimization of monitoring requirements. We discuss the case of contextual goal model, which is a requirements model that weaves between variability of goals (functional and non-functional requirements) and variability of context (monitoring requirements) and is meant to be used for modelling mobile and self-adaptive systems requirements. We provide automated analysis -based on a SAT-solver- to process a contextual goal model and find a reduced set of contextual information to monitor guaranteeing that this reduction does not sacrifice the system ability of taking correct adaptation decisions when fulfilling its requirements. © 2012 Springer-Verlag Berlin Heidelberg. Source


Goncalves G.R.,Federal University of Ouro Preto | Ferreira A.A.,Federal University of Ouro Preto | Assis G.T.D.,Federal University of Ouro Preto | Tavares A.I.,Jasper Design Automation
Proceedings - 9th Latin American Web Congress, LA-WEB 2014 | Year: 2014

An undergraduate program must prepare its students for the major needs of the labor market. One of the main ways to identify what are the demands to be met is creating a manner to manage information of its alumni. This consists of gathering data from program's alumni and finding out what are their main areas of employment on the labor market or which are their main fields of research in the academy. Usually, this data is obtained through available forms on the Web or forwarded by mail or email, however, these methods, in addition to being laborious, do not present good feedback from the alumni. Thus, this work proposes a novel method to help teaching staffs of undergraduate programs to gather information on the desired population of alumni, semi-automatically, on the Web. Overall, by using a few alumni pages as an initial set of sample pages, the proposed method was capable of gathering information concerning a number of alumni twice as bigger than adopted conventional methods. © 2014 IEEE. Source


Kranen K.,Jasper Design Automation
IEEE Design and Test | Year: 2014

The EDA industry is up to the technical challenges of delivering the continuous technological breakthroughs needed. Even Wall Street likes EDA, with our public companies outperforming all the major stock indices over the past few years. And some private companies, with very high differentiation, have figured out how to compete against lower-priced, big-EDA solutions and in the process created new business models that are driving sustained growth and profitability. The future of the industry is about enabling design and verification teams understanding their needs and accelerating their innovations. There is also the connectedness across both time and geography that comes from the very products that one creates. Source


Jobstmann B.,French National Center for Scientific Research | Staber S.,Jasper Design Automation | Griesmayer A.,Imperial College London | Bloem R.,Graz University of Technology
Journal of Computer and System Sciences | Year: 2012

Knowing that a program has a bug is good, knowing its location is better, but a fix is best. We present a method to automatically locate and correct faults in a finite state system, either at the gate level or at the source level. We assume that the specification is given in Linear Temporal Logic, and state the correction problem as a game, in which the protagonist selects a faulty component and suggests alternative behavior. The basic approach is complete but as complex as synthesis. It also suffers from problems of readability: the correction may add state and logic to the system. We present two heuristics. The first avoids the doubly exponential blowup associated with synthesis by using nondeterministic automata. The second heuristic finds a memoryless strategy, which we show is an NP-complete problem. A memoryless strategy corresponds to a simple, local correction that does not add any state. The drawback of the two heuristics is that they are not complete unless the specification is an invariant. Our approach is general: the user can define what constitutes a component, and the suggested correction can be an arbitrary combinational function of the current state and the inputs. We show experimental results supporting the applicability of our approach. © 2011 Published by Elsevier Inc. Source

Discover hidden collaborations