1,754 Hits in 5.6 sec

Composing Message Translators and Inferring Their Data Types Using Tree Automata [chapter]

Emil Andriescu, Thierry Martinez, Valérie Issarny
2015 Lecture Notes in Computer Science  
This leads us to contribute with a novel data type inference mechanism, which generates a data-schema using tree automata, based on the aforementioned user query.  ...  Instead, developers must write ad hoc "glue-code" whenever composing two or more message translators.  ...  The authors gratefully acknowledge the suggestions and advice from Dr. Roberto Speicys Cardoso, Dr. Ajay Kattepur and Eng. Georgios Mathioudakis.  ... 
doi:10.1007/978-3-662-46675-9_3 fatcat:pwybqd7dnzgzritfosvyyuvmzy

Bridging the Interoperability Gap: Overcoming Combined Application and Middleware Heterogeneity [chapter]

Yérom-David Bromberg, Paul Grace, Laurent Réveillère, Gordon S. Blair
2011 Lecture Notes in Computer Science  
A number of ad-hoc solutions exist to resolve differences at either distinct level, e.g., data translation technologies, service choreography tools, or protocol bridges; however, we argue that middleware  ...  Interoperability remains a significant challenge in today's distributed systems; it is necessary to quickly compose and connect (often at runtime) previously developed and deployed systems in order to  ...  Syntactical description of message data fields, including their data types are formalized through the use of abstract messages.  ... 
doi:10.1007/978-3-642-25821-3_20 fatcat:usu72tei4vdojbdif3g6pzndqy

A unifying perspective on protocol mediation: interoperability in the future internet

Amel Bennaceur, Emil Andriescu, Roberto Speicys Cardoso, Valérie Issarny
2015 Journal of Internet Services and Applications  
First, we provide a solution to automatically generate cross-layer parsers and composers that abstract network messages into a uniform representation independent of the middleware used.  ...  Then, the application-level mediator performs the necessary data conversion and behavioural coordination.  ...  AST are a format commonly used in message translation and middleware technology. Atomic message translators are reused and composed in order to generate CCL message translators.  ... 
doi:10.1186/s13174-015-0027-3 fatcat:2z74dsjcojbc3pyrx2hktdnrti

Reverse Engineering of Protocols from Network Traces

Joao Antunes, Nuno Neves, Paulo Verissimo
2011 2011 18th Working Conference on Reverse Engineering  
To address these issues, we propose a new methodology to automatically infer a specification of a protocol from network traces, which generates automata for the protocol language and state machine.  ...  Since our solution only resorts to interaction samples of the protocol, it is well-suited to uncover the message formats and protocol states of closed protocols and also to automate most of the process  ...  Once the language is inferred, the message types, either encoded with text or binary data, are used by the clients and servers to make progress and to jump to the different states of the protocol.  ... 
doi:10.1109/wcre.2011.28 dblp:conf/wcre/AntunesNV11 fatcat:67hamydjdbblhn6p2ua2gydf3i

Automatically complementing protocol specifications from network traces

João Antunes, Nuno Neves
2011 Proceedings of the 13th European Workshop on Dependable Computing - EWDC '11  
The approach can be used on top of existing protocol reverse engineering techniques allowing it to be applied to both open and closed protocols.  ...  In addition, protocols are constantly evolving with new functionality and message formats that render the previously defined specifications incomplete or deprecated.  ...  A total of twelve new message types were extracted and their format inferred. Additionally, the tool detected 169 malformed protocol requests that consisted mainly of misspelled command names.  ... 
doi:10.1145/1978582.1978601 dblp:conf/ewdc/AntunesN11 fatcat:ebp6dvdclbeahjjnrlv7y2btya

Reverse Engineering of Middleware for Verification of Robot Control Architectures [chapter]

Ali Khalili, Lorenzo Natale, Armando Tacchella
2014 Lecture Notes in Computer Science  
Both steps are carried out in a computer-assisted way using state-of-the-art techniques in automata-based identification and verification.  ...  To overcome this problem, we propose to identify abstract models of middleware as finite-state automata, and then to perform verification on the combined middleware and control software models.  ...  The model of programs which use the ports are translated into automata as well. Here, the translation is manual, but in principle, it could be done in an automated fashion.  ... 
doi:10.1007/978-3-319-11900-7_27 fatcat:ffcgs5rchrgbbit62dcnuwwdma

XML: Model, Schemas, Types, Logics, and Queries [chapter]

Nils Klarlund, Thomas Schwentick, Dan Suciu
2004 Logics for Emerging Applications of Databases  
Tree grammars are increasingly being used in implementations of program analysis [55] and for type inference in programming languages that allow a plug operation [13] .  ...  The Plug Operation and Minimal Automata Finally, if we define a pointed tree ρ to be a tree over Σ except that one leaf is labeled •, then we may compose ρ with any tree τ by replacing the leaf labeled  ... 
doi:10.1007/978-3-642-18690-5_1 fatcat:f5mtevnovffhnpfgdpb7rqlmji

Utilization of Timed Automata as a Verification Tool for Security Protocols

Ahmet Koltuksuz, Burcu Kulahcioglu, Murat Ozkan
2010 2010 Fourth International Conference on Secure Software Integration and Reliability Improvement Companion  
This study aims to make use of timed automata as a verification tool for security protocols and gives a case study on the initial part of the Neuman-Stubblebine Repeated Authentication Protocol.  ...  Timed automata proposes an efficient model checking method for verification real time systems having mature and efficient automatic verification tools.  ...  UPPAAL extends timed automata with C-like data types such as integers, arrays and functions. It allows using urgent and committed states that ease modeling of a system.  ... 
doi:10.1109/ssiri-c.2010.27 dblp:conf/ssiri/KoltuksuzKO10 fatcat:ldbgb26ytzelznjxflgaair7na

Simulation Methodology-Based Context-Aware Architecture Design for Behavior Monitoring of Systems

Tae Ho Cho
2020 Symmetry  
of time and space; this naturally leads to adopting spatiotemporal variables composed of simulation models and developing a problem solver that exploits these variables.  ...  An inference engine module for reasoning with the TL rules is designed based on the abstract simulator that carries out instructions in the BM-DEVS models to perform the simulation process.  ...  These simulation models are used as arguments of the proposed temporal logic type TL BM-DEVS . The arguments are variables pointing to behavioral data structures composed of simulation models.  ... 
doi:10.3390/sym12091568 fatcat:xdnw46zsurardoi6tsjjsqpdzm

Timed-Model-Based Method for Security Analysis and Testing of Smart Grid Systems

Gabriel Pedroza, Pascale Le Gall, Christophe Gaston, Fabrice Bersey
2016 2016 IEEE 19th International Symposium on Real-Time Distributed Computing (ISORC)  
As long as Smart Grids gain on connectivity and automation, new concerns on their safety and security have arisen.  ...  In final stages, the attack scenarios are used to specify test cases which are later deployed to test the system.  ...  To illustrate the k − robustness analysis, let us consider the symbolic tree in Figure 8 . The tree is composed of states EC i capturing the progression of symbolic time and values.  ... 
doi:10.1109/isorc.2016.15 dblp:conf/isorc/PedrozaGGB16 fatcat:5dlqzje3rvhaxalel2oweckw3m

Extending Lustre with Timeout Automata

Jimin Gao, Mike Whalen, Eric Van Wyk
2008 Electronical Notes in Theoretical Computer Science  
This extension consists of constructs for directly specifying the timeout automata used to describe asynchronous communication between processes represented by Lustre nodes.  ...  It is implemented using an extensible language framework based on attribute grammars that allows such extensions to be modularly defined so that they may be more easily composed with other language extensions  ...  Note that the original type declarations for fgs data, the four constant init values and the declarations of the fgs and channel nodes are not changed in the translation and appear in the translated code  ... 
doi:10.1016/j.entcs.2008.05.014 fatcat:kcp74pfpxbco5ow2rdy7vhl2ei

Architecture and Behavior Modeling of Cyber-Physical Systems with MontiArcAutomaton [article]

Jan Oliver Ringert, Bernhard Rumpe, Andreas Wortmann
2015 arXiv   pre-print
MontiArcAutomaton is implemented using the DSL framework MontiCore.  ...  The modeling language MontiArcAutomaton provides syntactical elements for defin- ing automata with states, variables, and transitions inside MontiArc components.  ...  inference.  ... 
arXiv:1509.04505v1 fatcat:4vhvngisqjbg3olfhbpav2rrxm

An Incremental Learner for Language-Based Anomaly Detection in XML [article]

Harald Lampesberger
2016 arXiv   pre-print
The learner generalizes XML types and datatypes in terms of automaton states and transitions, and an inferred dXVPA converges to a good-enough approximation of the true language.  ...  This paper introduces datatyped XML visibly pushdown automata (dXVPAs) as language representation for mixed-content XML and presents an incremental learner that infers a dXVPA from example documents.  ...  Acknowledgment The research has been supported by the Christian Doppler Society, and the results were produced while the author was affiliated with the Christian Doppler Laboratory for Client-Centric Cloud  ... 
arXiv:1603.07924v1 fatcat:j42ktpysdveyrpw73qxdb25vdm

Timed automata as a formalism for expressing security: A survey on theory and practice

Johan Arcile, Étienne André
2022 ACM Computing Surveys  
We notably review theoretical works, with a particular focus on opacity, as well as more practical works, with a particular focus on attack trees and their extensions.  ...  They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions.  ...  We would like to thank anonymous reviewers for their useful comments, as well as Jaime Arias and Laure Petrucci for a feedback on their recent works.  ... 
doi:10.1145/3534967 fatcat:bq3focapvzh77lf5qvdx4oskcm

A Framework for Evaluating Schedulability Analysis Tools [chapter]

Lijun Shan, Susanne Graf, Sophie Quinton, Loïc Fejoz
2017 Lecture Notes in Computer Science  
Acknowledgment The authors would like to thank Claire Pagetti and Eric Noulard from Onera, Olivier Cros from ECE Paris, and Jean-François Monin from Verimag for the fruitful and inspiring discussions.  ...  TYPE: data type of the parameter. ENUM_VALUE: enumerated values of the data type of the parameter. This eld is useful only when the parameter has a enumeration data type.  ...  Data types User-dened data types determine the data structure processed by automata. The structure of data type denition in RTLib resembles the structure of the templates in the library.  ... 
doi:10.1007/978-3-319-63121-9_27 fatcat:xsnuy7du5bdppo27jp4l6nqzyi
« Previous Showing results 1 — 15 out of 1,754 results