Search

Your search keyword '"Salaün, Gwen"' showing total 483 results
Start Over Author "Salaün, Gwen"

Refine your results

more »

more »

more »

more »
483 results on '"Salaün, Gwen"'

210. ITACA: An Integrated Toolbox for the Automatic Composition and Adaptation of Web Services.

Author

Cámara, Javier, Martín, José Antonio, Salaün, Gwen, Cubo, Javier, Ouederni, Meriem, Canal, Carlos, and Pimentel, Ernesto

Subjects
COMPUTER systems, SOFTWARE engineering, COMPUTER interfaces, AUTOMATION, WEB services, APPLICATION software
Abstract

Adaptation is of utmost importance in systems developed by assembling reusable software services accessed through their public interfaces. This process aims at solving, as automatically as possible, mismatch cases which may be given at the different interoperability levels among interfaces by synthesizing a mediating adaptor. In this paper, we present a toolbox that fully supports the adaptation process, including: (i) different methods to construct adaptation contracts involving several services; (ii) simulation and verification techniques which help to identify and correct erroneous behaviours or deadlocking executions; and (iii) techniques for the generation of centralized or distributed adaptor protocols based on the aforementioned contracts. Our toolbox relates our models with implementation platforms, starting with the automatic extraction of behavioural models from existing interface descriptions, until the final adaptor implementation is generated for the target platform. [ABSTRACT FROM AUTHOR]

Published
2009

211. Adaptation of Open Component-Based Systems.

Author

Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Rangan, C. Pandu, Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Bonsangue, Marcello M., Johnsen, Einar Broch, Poizat, Pascal, and Salaün, Gwen

Abstract

Software adaptation aims at generating software pieces called adaptors to compensate interface and behavioural mismatch between components or services. This is crucial to foster reuse. So far, adaptation techniques have proceeded by computing global adaptors for closed systems made up of a fixed set of components. This is not satisfactory when the systems may evolve, with components entering or leaving it at any time, e.g., for pervasive computing. To enable adaptation on such systems, we propose tool-equipped adaptation techniques for the computation of open systems adaptors. Our proposal also support incremental adaptation to avoid the computation of global adaptors. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

212. Context-Based Adaptation of Component Behavioural Interfaces.

Author

Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Rangan, C. Pandu, Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Murphy, Amy L., Vitek, Jan, Cubo, Javier, Salaün, Gwen, and Cámara, Javier

Abstract

In the development of component-based systems, components need to be adapted in most of the occasions to work under certain conditions which were not initially predicted by their developers. These conditions are likely to change at runtime, therefore it is very important to provide systems with the ability to alter their behaviour while they are running, depending on the changing conditions of the environment. This paper presents an expressive and graphically-based notation to specify flexible adaptation policies (or mappings) between the interfaces of two or more components to be integrated. In a second step, we propose an algorithm which automatically derives the resulting adaptor from a mapping, and a description of component interfaces. We illustrate our proposal using an E-book system. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

213. Translating FSP into LOTOS and Networks of Automata.

Author

Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Davies, Jim, Gibbons, Jeremy, Salaün, Gwen, Kramer, Jeff, and Lang, Frédéric

Abstract

Many process calculi have been proposed since Robin Milner and Tony Hoare opened the way more than 25 years ago. Although they are based on the same kernel of operators, most of them are incompatible in practice. We aim at reducing the gap between process calculi, and especially making possible the joint use of underlying tool support. Fsp is a widely-used calculus equipped with Ltsa, a graphical and user-friendly tool. Lotos is the only process calculus that has led to an international standard, and is supported by the Cadp verification toolbox. We propose a translation from Fsp to Lotos. Since Fsp composite processes are hard to encode into Lotos, they are translated into networks of automata which are another input language accepted by Cadp. Hence, it is possible to use jointly Ltsa and Cadp to validate Fsp specifications. Our approach is completely automated by a translator tool we implemented. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

214. Synchronizing Behavioural Mismatch in Software Composition.

Author

Gorrieri, Roberto, Wehrheim, Heike, Canal, Carlos, Poizat, Pascal, and Salaün, Gwen

Abstract

Software Adaptation is a crucial issue for the development of a real market of components promoting software reuse. Recent work in this field has addressed several problems related to interface and behavioural mismatch. In this paper, we present our proposal for software adaptation, which builds on previous work overcoming some of its limitations, and makes a significant advance to solve pending issues. Our approach is based on the use of synchronous vectors and regular expressions for governing adaptation rules, and is supported by dedicated algorithms and tools. [ABSTRACT FROM AUTHOR]

Published
2006
Full Text
View/download PDF

215. Bounded Analysis and Decomposition for Behavioural Descriptions of Components.

Author

Gorrieri, Roberto, Wehrheim, Heike, Poizat, Pascal, Royer, Jean-Claude, and Salaün, Gwen

Abstract

Explicit behavioural interfaces are now accepted as a mandatory feature of components to address architectural analysis. Behavioural interface description languages should be able to deal with data types and with rich communication means. Symbolic Transition Systems (STS) support the definition of component models which take into account control, concurrency, communication and data types. However, verification of components described with protocol modelled by STS, especially model-checking, is difficult since they possibly involve different sources of infinity. In this paper, we propose the notions of bounded analysis and bounded decomposition. They can be used to test boundedness of systems and to generate finite simulations for them so that standard model-checking techniques may be applied for verification purposes. [ABSTRACT FROM AUTHOR]

Published
2006
Full Text
View/download PDF

216. Translating Hardware Process Algebras into Standard Process Algebras: Illustration with CHP and LOTOS.

Author

Romijn, Judi M. T., Smith, Graeme P., Pol, Jaco, Salaün, Gwen, and Serwe, Wendelin

Abstract

A natural approach for the description of asynchronous hardware designs are hardware process algebras, such as Martin's Chp(Communicating Hardware Processes), Tangram, or Balsa, which are extensions of standard process algebras with particular operators exploiting the implementation of synchronisation using handshake protocols. In this paper, we give a structural operational semantics for value-passing Chp. Compared to existing semantics of Chp defined by translation into Petri nets, our semantics handles value-passing Chp with communication channels open to the environment and is independent of any particular (2- or 4-phase) handshake protocol used for circuit implementation. In a second step, we describe the translation of Chp into the standard process algebra Lotos, in order to allow the application of the Cadp verification toolbox to asynchronous hardware designs. A prototype translator from Chp to Lotos has been successfully used for the compositional veri.cation of the control part of an asynchronous circuit implementing the DES (Data Encryption Standard). [ABSTRACT FROM AUTHOR]

Published
2005
Full Text
View/download PDF

217. Using Process Algebra for Web Services: Early Results and Perspectives.

Author

Shan, Ming-Chien, Dayal, Umeshwar, Hsu, Meichun, Bordeaux, Lucas, and Salaün, Gwen

Abstract

Web services are computational entities distributed on the web whose goal is to cooperate in order to work out simple or complex tasks. In this paper, we advocate the use of process algebra as an abstract and formal description formalism to tackle several issues raised in the context of web services. Abstract processes are helpful to describe services at different levels of expressiveness depending on the goal at hand and to compose them in order to build more complicated services. A great interest of using process algebra is that formal reasoning is made possible at any time and for many purposes (e.g. composition correctness) thanks to the existence of state-of-the-art tools. Abstract descriptions may also be used as a first step to develop certified web services following a well-defined method. We discuss all these ideas in this paper, reinforcing them with simple examples. [ABSTRACT FROM AUTHOR]

Published
2005

218. When are Two Web Services Compatible?

Author

Shan, Ming-Chien, Dayal, Umeshwar, Hsu, Meichun, Bordeaux, Lucas, Salaün, Gwen, Berardi, Daniela, and Mecella, Massimo

Abstract

Whether two web services are compatible depends not only on static properties like the correct typing of their message parameters, but also on their dynamic behaviour. Providing a simple description of the service behaviour based on process-algebraic or automata-based formalisms can help detecting many subtle incompatibilities in their interaction. Moreover, this compatibility checking can to a large extent be automated if we define the notion of compatibility in a sufficiently formal way. Based on a simple behavioural representation, we survey, propose and compare a number of formal definitions of the compatibility notion, and we illustrate them on simple examples. [ABSTRACT FROM AUTHOR]

Published
2005

219. Realizability of Choreographies Using Process Algebra Encodings.

Author

Salaün, Gwen, Bultan, Tevfik, and Roohi, Nima

Abstract

Service-oriented computing has emerged as a new software development paradigm that enables implementation of Web accessible software systems that are composed of distributed services which interact with each other via exchanging messages. Modeling and analysis of interactions among services is a crucial problem in this domain. Interactions among a set of services that participate in a service composition can be described from a global point of view as a choreography. Choreographies can be specified using specification languages such as Web Services Choreography Description Language (WS-CDL) and visualized using graphical formalisms such as collaboration diagrams. In this paper, we present an encoding of collaboration diagrams into the LOTOS process algebra for choreography analysis. This encoding allows us to 1) check the temporal properties of choreographies using a LOTOS verification tool set called the Construction and Analysis of Distributed Processes (CADP) toolbox, 2) check the realizability of choreographies for both synchronous communication and bounded asynchronous communication, and 3) automate the peer generation process. Realizability indicates whether peers can be generated from a given choreography specification in such a way that the interactions of the generated peers exactly match the choreography specification. If a collaboration diagram is unrealizable, our approach extends the peer generation process by adding extra communication that guarantees that the peers behave according to the choreography specification. [ABSTRACT FROM PUBLISHER]

Published
2012
Full Text
View/download PDF

220. Model-Based Adaptation of Behavioral Mismatching Components.

Author

Canal, Carlos, Poizat, Pascal, and Salaün, Gwen

Subjects
SOFTWARE engineering, APPLICATION program interfaces, COMPUTER software reusability, ALGORITHMS, DEVELOPMENT of application software, IDL (Computer program language)
Abstract

Component-Based Software Engineering focuses on the reuse of existing software components. In practice, most components cannot be integrated directly into an application-to-be because they are incompatible. Software Adaptation aims at generating, as automatically as possible, adaptors to compensate for a mismatch between component interfaces and is therefore a promising solution for the development of a real market of components promoting software reuse. In this paper, we present our approach for software adaptation, which relies on an abstract notation based on synchronous vectors and transition systems for governing adaptation rules. Our proposal is supported by dedicated algorithms that automatically generate adaptor protocols. These algorithms have been implemented in a tool, called Adaptor, which can be used through a user-friendly graphical interface. [ABSTRACT FROM AUTHOR]

Published
2008
Full Text
View/download PDF

221. Encoding process algebraic descriptions of web services into BPEL.

Author

Chirichiello, Antonella and Salaün, Gwen

Subjects
*WEB services, *APPLICATION service providers, *APPLICATION software, *ELECTRONIC commerce, *ALGEBRA
Abstract

Formal methods are helpful for many issues raised in the web services area. In this article, we advocate the use of process algebra as a first step in the design and development of executable web services. Verification tools can be used to validate the correct execution of these formal descriptions. We define some guidelines to encode abstract specifications of services-to-be written using these calculi into executable web services. As a back-end language, we consider BPEL as the orchestration language. We illustrate our approach through the development of a simple e-business application. [ABSTRACT FROM AUTHOR]

Published
2007

222. A Formal and Tool-Equipped Approach for the Integration of State Diagrams and Formal Datatypes.

Author

Attiogbé, Christian, Poizat, Pascal, and Salaün, Gwen

Subjects
SIMULATION methods & models, BEHAVIOR, DATA, INNOVATION adoption, LANGUAGE & languages, ALGEBRA, SEMANTICS
Abstract

Separation of concerns or aspects is a way to deal with the increasing complexity of systems. The separate design of models for different aspects also promotes a better reusability level. However, an important issue is then to define means to integrate them into a global model. We present a formal and tool-equipped approach for the integration of dynamic models (behaviors expressed using state diagrams) and static models (formal data types) with the benefit to share advantages of both: graphical user-friendly models for behaviors, formal and abstract models for data types. Integration is achieved in a generic way so that it can deal with both different static specification languages (algebraic specifications, Z, B) and different dynamic specification semantics. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

223. Bounded Analysis and Decomposition for Behavioural Descriptions of Components

Author

Informatique, Biologie Intégrative et Systèmes Complexes (IBISC) ; CNRS - Université d'Evry-Val d'Essonne, Laboratoire d'Informatique de Nantes Atlantique (LINA) ; CNRS - Université de Nantes - École Nationale Supérieure des Mines - Nantes, OBASCO (INRIA - EMN) ; INRIA - École Nationale Supérieure des Mines - Nantes, Departamento Lenguajes y Ciencias de la Computación [Malaga] (LCC) ; Universidad de Málaga, Poizat, Pascal, Royer, Jean-Claude, Salaün, Gwen, Informatique, Biologie Intégrative et Systèmes Complexes (IBISC) ; CNRS - Université d'Evry-Val d'Essonne, Laboratoire d'Informatique de Nantes Atlantique (LINA) ; CNRS - Université de Nantes - École Nationale Supérieure des Mines - Nantes, OBASCO (INRIA - EMN) ; INRIA - École Nationale Supérieure des Mines - Nantes, Departamento Lenguajes y Ciencias de la Computación [Malaga] (LCC) ; Universidad de Málaga, Poizat, Pascal, Royer, Jean-Claude, and Salaün, Gwen

Abstract

International audience, Explicit behavioural interfaces are now accepted as a mandatory feature of components to address architectural analysis. Behavioural interface description languages should be able to deal with data types and with rich communication means. Symbolic Transition Systems (STS) support the definition of component models which take into account control, concurrency, communication and data types. However, verification of components described with protocol modelled by STS, especially model-checking, is difficult since they possibly involve different sources of infinity. In this paper, we propose the notions of bounded analysis and bounded decomposition. They can be used to test boundedness of systems and to generate finite simulations for them so that standard model-checking techniques may be applied for verification purposes.

224. Adaptation of Service Protocols Using Process Algebra and On-the-Fly Reduction Techniques.

Author

Mateescu, Radu, Poizat, Pascal, and Salaün, Gwen

Subjects
COMPUTER graphics, COMPUTER network protocols, ALGEBRA software, SOFTWARE engineering, APPLICATION software, SEMANTICS, ENCODING, COMPUTER interfaces
Abstract

Reuse and composition are increasingly advocated and put into practice in modern software engineering. However, the software entities that are to be reused to build an application, e.g., services, have seldom been developed to integrate and to cope with the application requirements. As a consequence, they present mismatch, which directly hampers their reusability and the possibility of composing them. Software Adaptation has become a hot topic as a nonintrusive solution to work mismatch out using corrective pieces named adaptors. However, adaptation is a complex issue, especially when behavioral interfaces, or conversations, are taken into account. In this paper, we present state-of-the-art techniques to generate adaptors given the description of reused entities' conversations and an abstract specification of the way mismatch can be solved. We use a process algebra to encode the adaptation problem, and propose on-the-fly exploration and reduction techniques to compute adaptor protocols. Our approach follows the model-driven engineering paradigm, applied to service-oriented computing as a representative field of composition-based software engineering. We take service description languages as inputs of the adaptation process and we implement adaptors as centralized service compositions, i.e., orchestrations. Our approach is completely tool supported. [ABSTRACT FROM AUTHOR]

Published
2012
Full Text
View/download PDF

225. Monitoring Distributed Component-Based Systems

Author

Falcone, Yliès, Nazarpour, Hosein, Bensalem, Saddek, Bozga, Marius, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Salaün, Gwen, editor, and Wijs, Anton, editor

Published
2021
Full Text
View/download PDF

226. Learning Assumptions for Verifying Cryptographic Protocols Compositionally

Author

Zhang, Zichao, de Amorim, Arthur Azevedo, Jia, Limin, Păsăreanu, Corina, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Salaün, Gwen, editor, and Wijs, Anton, editor

Published
2021
Full Text
View/download PDF

227. Automated Generation of Initial Configurations for Testing Component Systems

Author

Dadeau, Frédéric, Gros, Jean-Philippe, Kouchnarenko, Olga, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Salaün, Gwen, editor, and Wijs, Anton, editor

Published
2021
Full Text
View/download PDF

228. Component-Based Approach Combining UML and BIP for Rigorous System Design

Author

Chehida, Salim, Baouya, Abdelhakim, Bensalem, Saddek, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Salaün, Gwen, editor, and Wijs, Anton, editor

Published
2021
Full Text
View/download PDF

229. A Canonical Algebra of Open Transition Systems

Author

Di Lavore, Elena, Gianola, Alessandro, Román, Mario, Sabadini, Nicoletta, Sobociński, Paweł, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Salaün, Gwen, editor, and Wijs, Anton, editor

Published
2021
Full Text
View/download PDF

231. Corinne, a Tool for Choreography Automata

Author

Orlando, Simone, Pasquale, Vairo Di, Barbanera, Franco, Lanese, Ivan, Tuosto, Emilio, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Salaün, Gwen, editor, and Wijs, Anton, editor

Published
2021
Full Text
View/download PDF

232. Composable Partial Multiparty Session Types

Author

Stolze, Claude, Miculan, Marino, Di Gianantonio, Pietro, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Salaün, Gwen, editor, and Wijs, Anton, editor

Published
2021
Full Text
View/download PDF

233. Reproducible Execution of POSIX Programs with DiOS

Author

Ročkai, Petr, Baranová, Zuzana, Mrázek, Jan, Kejstová, Katarína, Barnat, Jiří, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

234. Using Relational Verification for Program Slicing

Author

Beckert, Bernhard, Bormer, Thorsten, Gocht, Stephan, Herda, Mihai, Lentzsch, Daniel, Ulbrich, Mattias, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

235. Local Nontermination Detection for Parallel C++ Programs

Author

Štill, Vladimír, Barnat, Jiří, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

236. Efficient Formal Verification for the Linux Kernel

Author

de Oliveira, Daniel Bristot, Cucinotta, Tommaso, de Oliveira, Rômulo Silva, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

237. Isabelle/DOF: Design and Implementation

Author

Brucker, Achim D., Wolff, Burkhart, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

238. Compositional Feature-Oriented Systems

Author

Dubslaff, Clemens, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

239. Multi-objective Search for Effective Testing of Cyber-Physical Systems

Author

Araujo, Hugo, Carvalho, Gustavo, Mousavi, Mohammad Reza, Sampaio, Augusto, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

240. Towards Logical Specification of Statistical Machine Learning

Author

Kawamoto, Yusuke, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

241. Test Model Coverage Analysis Under Uncertainty

Author

Prasetya, I. S. W. B., Klomp, Rick, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

242. Incorporating Data into EFSM Inference

Author

Foster, Michael, Brucker, Achim D., Taylor, Ramsay G., North, Siobhán, Derrick, John, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

243. Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach

Author

Avellaneda, Florent, Petrenko, Alexandre, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

244. Software Evolution with a Typeful Version Control System

Author

Carvalho, Luís, Costa Seco, João, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

245. Towards Integrating Formal Verification of Autonomous Robots with Battery Prognostics and Health Management

Author

Zhao, Xingyu, Osborne, Matt, Lantair, Jenny, Robu, Valentin, Flynn, David, Huang, Xiaowei, Fisher, Michael, Papacchini, Fabio, Ferrando, Angelo, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

246. Mutation Testing with Hyperproperties

Author

Fellner, Andreas, Befrouei, Mitra Tabaei, Weissenbacher, Georg, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

247. SAT Encodings of the At-Most-k Constraint : A Case Study on Configuring University Courses

Author

Bittner, Paul Maximilian, Thüm, Thomas, Schaefer, Ina, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

248. Formal Verification of Rewriting Rules for Dynamic Fault Trees

Author

Elderhalli, Yassmeen, Volk, Matthias, Hasan, Osman, Katoen, Joost-Pieter, Tahar, Sofiène, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

249. Let’s Prove It Later—Verification at Different Points in Time

Author

Ring, Martin, Lüth, Christoph, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

250. Towards Detecting Trigger-Based Behavior in Binaries: Uncovering the Correct Environment

Author

Papp, Dorottya, Tarrach, Thorsten, Buttyán, Levente, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ölveczky, Peter Csaba, editor, and Salaün, Gwen, editor

Published
2019
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results