Bibliographies thématiques / Automatic software transformation

Littérature scientifique sur le sujet « Automatic software transformation »

Auteur : Grafiati
Publié le 25 mai 2024

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Automatic software transformation ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Automatic software transformation"

1

Vákár, Matthijs, et Tom Smeding. « CHAD : Combinatory Homomorphic Automatic Differentiation ». ACM Transactions on Programming Languages and Systems 44, no 3 (30 septembre 2022) : 1–49. http://dx.doi.org/10.1145/3527634.

Texte intégral
Résumé :
We introduce Combinatory Homomorphic Automatic Differentiation (CHAD), a principled, pure, provably correct define-then-run method for performing forward and reverse mode automatic differentiation (AD) on programming languages with expressive features. It implements AD as a compositional, type-respecting source-code transformation that generates purely functional code. This code transformation is principled in the sense that it is the unique homomorphic (structure preserving) extension to expressive languages of Elliott’s well-known and unambiguous definitions of AD for a first-order functional language. Correctness of the method follows by a (compositional) logical relations argument that shows that the semantics of the syntactic derivative is the usual calculus derivative of the semantics of the original program. In their most elegant formulation, the transformations generate code with linear types. However, the code transformations can be implemented in a standard functional language lacking linear types: While the correctness proof requires tracking of linearity, the actual transformations do not. In fact, even in a standard functional language, we can get all of the type-safety that linear types give us: We can implement all linear types used to type the transformations as abstract types by using a basic module system. In this article, we detail the method when applied to a simple higher-order language for manipulating statically sized arrays. However, we explain how the methodology applies, more generally, to functional languages with other expressive features. Finally, we discuss how the scope of CHAD extends beyond applications in AD to other dynamic program analyses that accumulate data in a commutative monoid.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Hammoudi, Slimane, Wajih Alouini, Denivaldo Lopes et Marianne Huchard. « Towards A Semi-Automatic Transformation Process in MDA ». International Journal of Information System Modeling and Design 1, no 4 (octobre 2010) : 48–76. http://dx.doi.org/10.4018/jismd.2010100103.

Texte intégral
Résumé :
Model Driven Engineering (MDE) has been proposed for supporting the development, maintenance and evolution of software systems. Model Driven Architecture (MDA), Software Factories, and the Eclipse Modeling Framework (EMF) are representative MDE approaches. These MDE approaches have concepts and techniques in common such as modeling, metamodels, and model transformation. Today, it is well recognized that model transformation is the most important of MDE approaches and is one of the most important operations in MDE. Despite the multitude of model transformation language proposals emerging from university and industry, these transformations are often created manually, which is a tedious and error-prone task and therefore an expensive process. In this paper, the authors propose an extended architecture that aims to semi-automate the process of transformation in the context of MDA. This architecture involves concepts and techniques of metamodel matching, inspired and borrowed from schema matching techniques that are an important issue in the database and ontology domain. This architecture is enforced by a methodology which details the different steps leading to a semi-automatic transformation process. Matching foundations and the authors’ approach for metamodel matching are discussed.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Varró, Dániel, Gergely Varró et András Pataricza. « Designing the automatic transformation of visual languages ». Science of Computer Programming 44, no 2 (août 2002) : 205–27. http://dx.doi.org/10.1016/s0167-6423(02)00039-4.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Mahmood, Hina, Atif Aftab Jilani et Abdul Rauf. « Code Swarm : A Code Generation Tool based on the Automatic Derivation of Transformation Rule Set ». International Journal of Software Engineering & ; Applications 14, no 6 (29 novembre 2023) : 01–11. http://dx.doi.org/10.5121/ijsea.2023.14601.

Texte intégral
Résumé :
Automatic generation of software code from system design models remains an actively explored research area for the past several years. A number of tools are currently available to facilitate and automate the task of generating code from software models. To the best of our knowledge, existing software tools rely on an explicitly defined transformation rule set to perform the model-to-code transformation process. In this paper, we introduce a novel tool named Code Swarm, abbreviated as CodS, that automatically generates implementation code from system design models by utilizing a swarm-based approach. Specifically, CodS is capable of generating Java code from the class and state models of the software system by making use of the previously solved model-to-code transformation examples. Our tool enables the designers to specify behavioural actions in the input models using the Action Specification Language (ASL). We use an industrial case study of the Elevator Control System (ECS) to perform the experimental validation of our tool. Our results indicate that the code generated by CodS is correct and consistent with the input design models. CodS performs the process of automatic code generation without taking the explicit transformation rule set or languages metamodels’ information as input, which distinguishes it from all the existing automatic code generation tools.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Damouche, Nasrine, Matthieu Martel et Alexandre Chapoutot. « Improving the numerical accuracy of programs by automatic transformation ». International Journal on Software Tools for Technology Transfer 19, no 4 (26 septembre 2016) : 427–48. http://dx.doi.org/10.1007/s10009-016-0435-0.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Lafi, Lamine, Jamel Feki et Slimane Hammoudi. « Metamodel Matching Techniques ». International Journal of Information System Modeling and Design 5, no 2 (avril 2014) : 70–94. http://dx.doi.org/10.4018/ijismd.2014040104.

Texte intégral
Résumé :
During the last decade, Model Driven Engineering (MDE) has been proposed for supporting the development, maintenance and evolution of software systems. Model Driven Architecture (MDA), Software Factories and Eclipse Modeling Framework (EMF) are among the most representatives MDE approaches. Nowadays, it is well recognized that model transformation is at the heart of MDE approaches and, consequently represents one of the most important operations in MDE. However, despite the multitude of model transformation language proposals emerging from academic world and industry, these transformations are often manually specified; which is a tedious and error-prone task, and therefore an expensive process. Matching operation between metamodels is the keystone toward a (semi-)automatic transformation process. In this paper, the authors review metamodel matching techniques of the literature and then analyze their pros and cons in order to show how they can be useful for a semi-automatic transformation process. The result is a comparison of metamodel matching techniques, highlighting their similarities and differences in terms of information used for matching, demonstrating significant similarities between these techniques. Next, the authors compare four well-known metamodel matching techniques namely Similarity flooding, SAMT4MDE+ (extended Semi-Automatic Matching Tool for Model Driven Engineering), ModelCVS and AML (AtlanMod Matching Language) on ten couples of metamodels. For this comparison, the authors define a set of six criteria inspired from the database schema matching. One among these criteria is relevant to the quality of matching and for which we define a quality measure metrics. Furthermore, the authors develop a plug-in under Eclipse to support our comparison using ten couples of metamodels.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Janulevicius, Justinas, Simona Ramanauskaite, Nikolaj Goranin et Antanas Cenys. « Content Based Model Transformations : Solutions to Existing Issues with Application in Information Security ». International Journal of Computers Communications & ; Control 11, no 2 (26 janvier 2016) : 233. http://dx.doi.org/10.15837/ijccc.2016.2.2021.

Texte intégral
Résumé :
Model-Driven Engineering uses models in various stages of the software engineering. To reduce the cost of modelling and production, models are reused by transforming. Therefore the accuracy of model transformations plays a key role in ensuring the quality of the process. However, problems exist when trying to transform a very abstract and content dependent model. This paper describes the issues arising from such transformations. Solutions to solve problems in content based model transformation are proposed as well. The usage of proposed solutions allowing realization of semi-automatic transformations was integrated into a tool, designed for OPC/XML drawing file transformations to CySeMoL models. The accuracy of transformations in this tool has been analyzed and presented in this paper to acquire data on the proposed solutions influence to the accuracy in content based model transformation.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Konevtsov, Vladimir Aleksandrovich, et Lilia Motaylenko. « NON-LINEAR TRANSFORMATION OF SIGNALS IN SOFTWARE DESIGN OF DIGITAL CONTROL SYSTEMS COMPLEX ». Environment. Technology. Resources. Proceedings of the International Scientific and Practical Conference 3 (15 juin 2017) : 140. http://dx.doi.org/10.17770/etr2017vol3.2537.

Texte intégral
Résumé :
Dependencies between signals and dependence of signals on time are strictly non-linear. Non-linear elements, commonly used in the synthesis of automatic control systems, include: a two-point link, a two-point link with hysteresis, a three-point link, a three-point link with hysteresis, a module, saturation with insensitivity.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Vree, Willem G., et Pieter H. Hartel. « Communication lifting : fixed point computation for parallelism ». Journal of Functional Programming 5, no 4 (octobre 1995) : 549–81. http://dx.doi.org/10.1017/s0956796800001477.

Texte intégral
Résumé :
AbstractCommunication lifting is a program transformation that can be applied to a synchronous process network to restructure the network. This restructuring in theory improves sequential and parallel performance. The transformation has been formally specified and proved correct and it has been implemented as an automatic program transformation tool. This tool has been applied to a small set of programs consisting of synchronous process networks. For these networks communication lifting generates parallel programs that do not require locking. Measurements indicate performance gains in practice both with sequential and parallel evaluation. Communication lifting is a worthwhile optimization to be included in a compiler for a lazy functional language.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Thangaraj, Jagadeeswaran, et Senthilkumaran Ulaganathan. « A Comparative Study on Transformation of UML/OCL to Other Specifications ». Recent Advances in Computer Science and Communications 13, no 2 (3 juin 2020) : 256–64. http://dx.doi.org/10.2174/2213275912666190129121059.

Texte intégral
Résumé :
Background: Static verification is a sound programming methodology that permits automated reasoning about the correctness of an implementation with respect to its formal specification before its execution. Unified Modelling Language is most commonly used modelling language which describes the client’s requirement. Object Constraint Language is a formal language which allows users to express textual constraints regarding the UML model. Therefore, UML/OCL express formal specification and helps the developers to implement the code according to the client’s requirement through software design. Objective: This paper aims to compare the existing approaches generating Java, C++, C# code or JML, Spec# specifications from UML/OCL. Methods: Nowadays, software system is developed via automatic code generation from software design to implementation when using formal specification and static analysis. In this paper, the study considers transformation from design to implementation and vice versa using model transformation, code generation or other techniques. Results: The related tools, which generate codes, do not support verification at the implementation phase. On the other hand, the specification generation tools do not generate all the required properties which are needed for verification at the implementation phase. Conclusion: If the generated system supports the verification with all required properties, code developer needs less efforts to produce correct software system. Therefore, this study recommends introducing a new framework which can act as an interface between design and implementation to generate verified software systems.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Automatic software transformation"

1

Serrano, Lucas. « Automatic inference of system software transformation rules from examples ». Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS425.

Texte intégral
Résumé :
Le noyau Linux est aujourd'hui présent dans tous les types de systèmes informatiques, des smartphones aux supercalculateurs, comprenant à la fois le matériel le plus récent et les systèmes "anciens". Cette diversité d'environnement a pour conséquence une base de code importante, d'une dizaine de millions de lignes de code, pour les pilotes matériels. Cependant par souci d'introduction de nouvelles fonctionnalités, ou pour des raisons de performance ou de sécurité, certaines interfaces de programmation (APIs) internes doivent être parfois revues, ce qui peut impliquer des changements pour des milliers de pilotes les utilisant.Cette thèse propose une nouvelle approche, Spinfer, permettant d'effectuer ces migrations d'utilisation d'APIs de manière automatique. Cette nouvelle approche, basée sur l'assemblage de motifs en suivant des contraintes de flot de contrôle, est capable d'apprendre à partir d'exemples, même imparfaits, des règles de transformations adaptées aux enjeux des migrations d'utilisations d'APIs dans le noyau Linux
The Linux kernel is present today in all kinds of computing environments, from smartphones to supercomputers, including both the latest hardware and "ancient" systems. This multiplicity of environments has come at the expense of a large code size, of approximately ten million lines of code, dedicated to device drivers. However, to add new functionalities, or for performance or security reasons, some internal Application Programming Interfaces (APIs) can be redesigned, triggering the need for changes of potentially thousands of drivers using them.This thesis proposes a novel approach, Spinfer, that can automatically perform these API usage updates. This new approach, based on pattern assembly constrained by control-flow relationships, can learn transformation rules from even imperfect examples. Learned rules are suitable for the challenges found in Linux kernel API usage updates
Styles APA, Harvard, Vancouver, ISO, etc.
2

Liang, Dong. « Automatic generation of software applications ». Doctoral thesis, Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola", 2014. http://nbn-resolving.de/urn:nbn:de:bsz:105-qucosa-149742.

Texte intégral
Résumé :
The Model Driven Architecture (MDA) allows moving the software development from the time consuming and error-prone level of writing program code to the next higher level of modeling. In order to gain benefit from this innovative technology, it is necessary to satisfy two requirements. These are first, the creation of compact, complete and correct platform independent models (PIM) and second, the development of a flexible and extensible model transformation framework taking into account frequent changes of the target platform. In this thesis a platform-based methodology is developed to create PIM by abstracting common modeling elements into a platform independent modeling library called Design Platform Model (DPM). The DPM contains OCL-based types for modeling primitive and collection types, a platform independent GUI toolkit as well as other common modeling elements, such as those for IO-operations. Furthermore, a DPM profile containing diverse domain specific and design pattern-based stereotypes is also developed to create PIM with high-level semantics. The behavior in PIM is specified using an OCL-like action language called eXecutable OCL (XOCL), which is also developed in this thesis. For model transformation, the model compiler MOCCA is developed based on a flexible and extensible architecture. The model mapper components in the current version of MOCCA are able to map desktop applications onto JSE platform; the both business object layer and persistence layer of a three-layered enterprise applications onto JEE platform and SAP ABAP platform. The entire model transformation process is finished with complete code generation.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Brown, Stephen Anthony. « Models for automatic diffrentiation : a conceptual framework for exploiting program transformation ». Thesis, University of Hertfordshire, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263028.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Couto, Emanuel Amaral. « Speculative execution by using software transactional memory ». Master's thesis, FCT - UNL, 2009. http://hdl.handle.net/10362/2659.

Texte intégral
Résumé :
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Engenharia Informática.
Many programs sequentially execute operations that take a long time to complete. Some of these operations may return a highly predictable result. If this is the case, speculative execution can improve the overall performance of the program. Speculative execution is the execution of code whose result may not be needed. Generally it is used as a performance optimization. Instead of waiting for the result of a costly operation,speculative execution can be used to speculate the operation most probable result and continue executing based in this speculation. If later the speculation is confirmed to be correct, time had been gained. Otherwise, if the speculation is incorrect, the execution based in the speculation must abort and re-execute with the correct result. In this dissertation we propose the design of an abstract process to add speculative execution to a program by doing source-to-source transformation. This abstract process is used in the definition of a mechanism and methodology that enable programmer to add speculative execution to the source code of programs. The abstract process is also used in the design of an automatic source-to-source transformation process that adds speculative execution to existing programs without user intervention. Finally, we also evaluate the performance impact of introducing speculative execution in database clients. Existing proposals for the design of mechanisms to add speculative execution lacked portability in favor of performance. Some were designed to be implemented at kernel or hardware level. The process and mechanisms we propose in this dissertation can add speculative execution to the source of program, independently of the kernel or hardware that is used. From our experiments we have concluded that database clients can improve their performance by using speculative execution. There is nothing in the system we propose that limits in the scope of database clients. Although this was the scope of the case study, we strongly believe that other programs can benefit from the proposed process and mechanisms for introduction of speculative execution.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Amer, Hoda. « Automatic transformation of UML software specification into LQN performance models using graph grammar techniques ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ61015.pdf.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Dziak, Damian, Bartosz Jachimczyk et Tomasz Jagusiak. « Automatic Waterjet Positioning Vision System ». Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5047.

Texte intégral
Résumé :
The goals of this work are a design and implementation of a new vision system, integrated with the waterjet machine. This system combines two commercial webcams applied on an industrial dedicated platform. A main purpose of the vision system is to detect the position and rotation of a workpiece placed on the machine table. The used object recognition algorithm consists of edge detection, standard math processing functions and noise filters. The Hough transform technique is used to extract lines and their intersections of a workpiece. Metric rectification method is used, in order to obtain a top view of the workspace and to adjust an image coordinate system, accordingly to the waterjet machine coordinates. In situ calibration procedures of the booth webcams are developed and implemented. Experimental results of the proposed new vision system prototype confirm required performance and precision of the element detection.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Lubiński, Piotr. « Automatic Form-Factor Transformations of Web Pages and Web Services UIs ». Thesis, Linköping University, Department of Computer and Information Science, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-19606.

Texte intégral
Résumé :

Browsing the Web on a distant screen may very often become user’s unpleasant experience. Such a situation may happen in a living room environment, where the user attempts to browse the Web on TV sitting at 10-foot distance from the screen. In a vast number of web sites that the user is able to request, many may contain, for instance, tiny text characters, which would become unreadable when watched from the distance. On the other hand, also navigation through the Web offerings can become troublesome. Especially, when the user is only equipped with the commonly used remote controller, interaction with the displayed content may prove inefficient. Therefore, methods to overcome content visibility and navigation problems become challenging. In this thesis we perceive living room environment as a good scenario, in which web-enabled handheld devices could further be utilized to interact with Consumer Electronics products, such as TVs. This sort of interaction should make an advantage of publically available Web resources to have them displayed on TV and controlled from the distance by the user who is equipped with, for instance, a web-enabled mobile phone. We think that such an interaction approach would become beneficial in several ways, making the Web browsing routine an interactive, possibly a group activity. Discussed in this thesis solutions are the first step of automatic transformations of web content into a form that can be rendered on Web4CE (Web for Consumer Electronics) products. A particularly important aspect of the proposed system is the concept of request/response HTTP message processing and HTML modification. According to this approach, living room browsing activity should be achievable without the need to re-author already existing web sites.

Styles APA, Harvard, Vancouver, ISO, etc.
8

Cohen, Albert. « Analyse et transformation de programmes : du modèle polyédrique aux langages formels ». Phd thesis, Université de Versailles-Saint Quentin en Yvelines, 1999. http://tel.archives-ouvertes.fr/tel-00550829.

Texte intégral
Résumé :
Les microprocesseurs et les architectures parallèles d'aujourd'hui lancent de nouveaux défis aux techniques de compilation. En présence de parallélisme, les optimisations deviennent trop spécifiques et complexes pour être laissées au soin du programmeur. Les techniques de parallélisation automatique dépassent le cadre traditionnel des applications numériques et abordent de nouveaux modèles de programmes, tels que les nids de boucles non affines, les appels récursifs et les structures de données dynamiques. Des analyses précises sont au c{\oe}ur de la détection du parallélisme, elles rassemblent des informations à la compilation sur les propriétés des programmes à l'exécution. Ces informations valident des transformations utiles pour l'extraction du parallélisme et la génération de code parallèle. Cette thèse aborde principalement des analyses et des transformations avec une vision par instances, c'est-à-dire considérant les propriétés individuelles de chaque instance d'une instruction à l'exécution. Une nouvelle formalisation à l'aide de langages formels nous permet tout d'abord d'étudier une analyse de dépendances et de définitions visibles par instances pour programmes récursifs. L'application de cette analyse à l'expansion et la parallélisation de programmes récursifs dévoile des résultats encourageants. Les nids de boucles quelconques font l'objet de la deuxième partie de ce travail. Une nouvelle étude des techniques de parallélisation fondées sur l'expansion nous permet de proposer des solutions à des problèmes d'optimisation cruciaux.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Christoph, Alexander. « Automatische Transformation von Software-Modellen / ». Norderstedt : Books on Demand, 2005. http://www.gbv.de/dms/ilmenau/toc/503792349.PDF.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Lin, Yuehua. « A model transformation approach to automated model evolution ». Birmingham, Ala. : University of Alabama at Birmingham, 2007. http://www.mhsl.uab.edu/dt/2007p/lin.pdf.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Livres sur le sujet "Automatic software transformation"

1

Matinlassi, Mari. Quality-driven software architecture model transformation : Towards automation. [Espoo, Finland] : VTT Technical Research Centre of Finland, 2006.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Brown, Laura. Integration models : Templates for business transformation. [Indianapolis, IN] : Sams, 2000.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Satdarova, Faina. DIFFRACTION ANALYSIS OF DEFORMED METALS : Theory, Methods, Programs. xxu : Academus Publishing, 2019. http://dx.doi.org/10.31519/monography_1598.

Texte intégral
Résumé :
General analysis of the distribution of crystals orientation and dislocation density in the polycrystalline system is presented. Recovered information in diffraction of X-rays adopting is new to structure states of polycrystal. Shear phase transformations in metals — at the macroscopic and microscopic levels — become a clear process. Visualizing the advances is produced by program included in package delivered. Mathematical models developing, experimental design, optimal statistical estimation, simulation the system under study and evolution process on loading serves as instrumentation. To reduce advanced methods to research and studies problem-oriented software will promote when installed. Automation programs passed a testing in the National University of Science and Technology “MISIS” (The Russian Federation, Moscow). You score an advantage in theoretical and experimental research in the field of physics of metals.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Basu, Swapan. Plant Intelligent Automation and Digital Transformation : Control and Monitoring Hardware and Software. Elsevier, 2023.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Basu, Swapan. Plant Intelligent Automation and Digital Transformation : Control and Monitoring Hardware and Software. Elsevier, 2022.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Glassbrook, Alex. Advanced, Automated and Electric Vehicle Law. Bloomsbury Publishing Plc, 2024. http://dx.doi.org/10.5040/9781526516930.

Texte intégral
Résumé :
‘A comprehensive and informative guide to the law, set in its historical and technical context, by an author with a deep understanding of transformative technology could not be more timely. I can think of no better guide in this field than Alex Glassbrook.’ From the Foreword by Mr Justice Sweeting The era of advanced, automated and electric vehicles (AAEVs) has begun; the legal transformation is starting. In July 2018, Parliament enacted the Automated and Electric Vehicles Act 2018, legislating for electric vehicle charging and allowing a direct civil claim against the motor insurer of an automated, ‘self-driving’ vehicle. In May 2022, the UK government announced its intention to create a new legal category for e-scooters. In April 2023, a ‘hands free’ advanced driver assistance system was approved for use on certain motorways across England, Wales and Scotland. On 8 November 2023 the Automated Vehicles Bill 2023-24 (HL Bill 1) had its first reading in Parliament. Motor vehicle technologies have developed since the nineteenth century and have affected numerous aspects of our lives - from road safety to the environment, from the laws of negligence and contribution to the rules of compulsory insurance. As AAEV technologies proliferate, their effects are likely to spread further. This book describes the emerging laws of advanced, automated and electric vehicles in England and Wales, explaining - The insurance and liability reforms of the Automated and Electric Vehicles Act 2018 - The wider regulatory reforms of the Automated Vehicles Bill 2023-24, set to become the Automated Vehicles Act 2024 - The range of legal practice areas affected by AAEVs, including discussions of the new public laws of vehicle safety, the actionability of downloaded software, electronic disclosure in civil litigation and the law of testing prototypes. This book will help those litigating, adjudicating, regulating and studying AAEV issues. It gives the context and detail of AAEV law in its many applications. It is a map to a fast-changing legal landscape. This title is included in Bloomsbury Professional’s Cyber Law online service.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Integration Models : Templates for Business Transformation. Sams, 2000.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Hilgurt, S. Ya, et O. A. Chemerys. Reconfigurable signature-based information security tools of computer systems. PH “Akademperiodyka”, 2022. http://dx.doi.org/10.15407/akademperiodyka.458.297.

Texte intégral
Résumé :
The book is devoted to the research and development of methods for combining computational structures for reconfigurable signature-based information protection tools for computer systems and networks in order to increase their efficiency. Network security tools based, among others, on such AI-based approaches as deep neural networking, despite the great progress shown in recent years, still suffer from nonzero recognition error probability. Even a low probability of such an error in a critical infrastructure can be disastrous. Therefore, signature-based recognition methods with their theoretically exact matching feature are still relevant when creating information security systems such as network intrusion detection systems, antivirus, anti-spam, and wormcontainment systems. The real time multi-pattern string matching task has been a major performance bottleneck in such systems. To speed up the recognition process, developers use a reconfigurable hardware platform based on FPGA devices. Such platform provides almost software flexibility and near-ASIC performance. The most important component of a signature-based information security system in terms of efficiency is the recognition module, in which the multipattern matching task is directly solved. It must not only check each byte of input data at speeds of tens and hundreds of gigabits/sec against hundreds of thousand or even millions patterns of signature database, but also change its structure every time a new signature appears or the operating conditions of the protected system change. As a result of the analysis of numerous examples of the development of reconfigurable information security systems, three most promising approaches to the construction of hardware circuits of recognition modules were identified, namely, content-addressable memory based on digital comparators, Bloom filter and Aho–Corasick finite automata. A method for fast quantification of components of recognition module and the entire system was proposed. The method makes it possible to exclude resource-intensive procedures for synthesizing digital circuits on FPGAs when building complex reconfigurable information security systems and their components. To improve the efficiency of the systems under study, structural-level combinational methods are proposed, which allow combining into single recognition device several matching schemes built on different approaches and their modifications, in such a way that their advantages are enhanced and disadvantages are eliminated. In order to achieve the maximum efficiency of combining methods, optimization methods are used. The methods of: parallel combining, sequential cascading and vertical junction have been formulated and investigated. The principle of multi-level combining of combining methods is also considered and researched. Algorithms for the implementation of the proposed combining methods have been developed. Software has been created that allows to conduct experiments with the developed methods and tools. Quantitative estimates are obtained for increasing the efficiency of constructing recognition modules as a result of using combination methods. The issue of optimization of reconfigurable devices presented in hardware description languages is considered. A modification of the method of affine transformations, which allows parallelizing such cycles that cannot be optimized by other methods, was presented. In order to facilitate the practical application of the developed methods and tools, a web service using high-performance computer technologies of grid and cloud computing was considered. The proposed methods to increase efficiency of matching procedure can also be used to solve important problems in other fields of science as data mining, analysis of DNA molecules, etc. Keywords: information security, signature, multi-pattern matching, FPGA, structural combining, efficiency, optimization, hardware description language.
Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Automatic software transformation"

1

Nagl, Manfred. « Transformation from Requirements to Architectures is not Automatic ». Dans Software Architectures, 221–48. Cham : Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-51335-0_11.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

García, Jokin, Oscar Diaz et Maider Azanza. « Model Transformation Co-evolution : A Semi-automatic Approach ». Dans Software Language Engineering, 144–63. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36089-3_9.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Zaitsev, Oleksandr, Stéphane Ducasse, Nicolas Anquetil et Arnaud Thiefaine. « DepMiner : Automatic Recommendation of Transformation Rules for Method Deprecation ». Dans Reuse and Software Quality, 22–37. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-08129-3_2.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Strüber, Daniel, Julia Rubin, Thorsten Arendt, Marsha Chechik, Gabriele Taentzer et Jennifer Plöger. « RuleMerger : Automatic Construction of Variability-Based Model Transformation Rules ». Dans Fundamental Approaches to Software Engineering, 122–40. Berlin, Heidelberg : Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49665-7_8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Steinhöfel, Dominic. « Ever Change a Running System : Structured Software Reengineering Using Automatically Proven-Correct Transformation Rules ». Dans Ernst Denert Award for Software Engineering 2020, 197–226. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-83128-8_10.

Texte intégral
Résumé :
AbstractLegacy systems are business-critical software systems whose failure can have a significant impact on the business. Yet, their maintenance and adaption to changed requirements consume a considerable amount of the total software development costs. Frequently, domain experts and developers involved in the original development are not available anymore, making it difficult to adapt a legacy system without introducing bugs or unwanted behavior. This results in a dilemma: businesses are reluctant to change a working system, while at the same time struggling with its high maintenance costs. We propose the concept of Structured Software Reengineering replacing the ad hoc forward engineering part of a reengineering process with the application of behavior-preserving, proven-correct transformations improving nonfunctional program properties. Such transformations preserve valuable business logic while improving properties such as maintainability, performance, or portability to new platforms. Manually encoding and proving such transformations for industrial programming languages, for example, in interactive proof assistants, is a major challenge requiring deep expert knowledge. Existing frameworks for automatically proving transformation rules have limited expressiveness and are restricted to particular target applications such as compilation or peep-hole optimizations. We present Abstract Execution, a specification and verification framework for statement-based program transformation rules on JAVA programs building on symbolic execution. Abstract Execution supports universal quantification over statements or expressions and addresses properties about the (big-step) behavior of programs. Since this class of properties is useful for a plethora of applications, Abstract Execution bridges the gap between expressiveness and automation. In many cases, fully automatic proofs are in possible. We explain REFINITY, a workbench for modeling and proving statement-level JAVA transformation rules, and discuss our applications of Abstract Execution to code refactoring, cost analysis of program transformations, and transformations reshaping programs for the application of parallel design patterns.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Dong, Xin, Gene Cooperman et John Apostolakis. « Multithreaded Geant4 : Semi-automatic Transformation into Scalable Thread-Parallel Software ». Dans Euro-Par 2010 - Parallel Processing, 287–303. Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15291-7_27.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Yang, Chen-Wei, Valeriy Vyatkin et Victor Dubinin. « Automatic Generation of Cyber-Physical Software Applications Based on Physical to Cyber Transformation Using Ontologies ». Dans Technological Innovation for Cyber-Physical Systems, 37–45. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-31165-4_4.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Whittle, Jon. « Transformations and Software Modeling Languages : Automating Transformations in UML ». Dans ≪UML≫ 2002 — The Unified Modeling Language, 227–42. Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45800-x_19.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Perini, Anna, et Angelo Susi. « Automating Model Transformations in Agent-Oriented Modelling ». Dans Agent-Oriented Software Engineering VI, 167–78. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11752660_13.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Albert, Elvira, Reiner Hähnle, Alicia Merayo et Dominic Steinhöfel. « Certified Abstract Cost Analysis ». Dans Fundamental Approaches to Software Engineering, 24–45. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71500-7_2.

Texte intégral
Résumé :
AbstractA program containing placeholders for unspecified statements or expressions is called an abstract (or schematic) program. Placeholder symbols occur naturally in program transformation rules, as used in refactoring, compilation, optimization, or parallelization. We present a generalization of automated cost analysis that can handle abstract programs and, hence, can analyze the impact on the cost of program transformations. This kind of relational property requires provably precise cost bounds which are not always produced by cost analysis. Therefore, we certify by deductive verification that the inferred abstract cost bounds are correct and sufficiently precise. It is the first approach solving this problem. Both, abstract cost analysis and certification, are based on quantitative abstract execution (QAE) which in turn is a variation of abstract execution, a recently developed symbolic execution technique for abstract programs. To realize QAE the new concept of a cost invariant is introduced. QAE is implemented and runs fully automatically on a benchmark set consisting of representative optimization rules.
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Automatic software transformation"

1

Matsuo, Yusuke, Kiyoshi Ogasawara et Atsushi Ohnishi. « Automatic transformation of organization of software requirements specifications ». Dans 2010 Fourth International Conference on Research Challenges in Information Science (RCIS). IEEE, 2010. http://dx.doi.org/10.1109/rcis.2010.5507386.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Fredes, Daniel, Pablo Cruz, Francisca Medina et Rodolfo Villarroel. « Automatic transformation applied to a software process using MDA ». Dans the 7th Euro American Conference. New York, New York, USA : ACM Press, 2014. http://dx.doi.org/10.1145/2590651.2590679.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Chang, Chih-Hung, Chih-Wei Lu, Wen Pin Yang, William Cheng-Chung Chu, Chao-Tung Yang, Ching-Tsorng Tsai et Pao-Ann Hsiung. « A SysML Based Requirement Modeling Automatic Transformation Approach ». Dans 2014 IEEE 38th International Computer Software and Applications Conference Workshops (COMPSACW). IEEE, 2014. http://dx.doi.org/10.1109/compsacw.2014.80.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Ati, Adel. « An Automatic Transformation From COSA Software Architecture To EJB Platform ». Dans Communication Technologies : from Theory to Applications (ICTTA). IEEE, 2008. http://dx.doi.org/10.1109/ictta.2008.4530341.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Alti, Adel, Mahieddine Djoudi et Adel Smeda. « An automatic transformation from COSA software architecture to CORBA platform ». Dans the 8th international conference. New York, New York, USA : ACM Press, 2008. http://dx.doi.org/10.1145/1416729.1416771.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Prass, Fábio Sarturi, Lisandra Mazoni Fontoura et Osmar Marchi dos Santos. « A Framework based on Security Patterns for Transformations ». Dans Simpósio Brasileiro de Qualidade de Software. Sociedade Brasileira de Computação - SBC, 2012. http://dx.doi.org/10.5753/sbqs.2012.15325.

Texte intégral
Résumé :
Security Patterns can be used in systems to protect shared data and information. They use the security specifications for controlling access to resources and prevent security violations. The increasing complexity of systems and the natural growth in the cost required to develop software, make the search for alternatives that can shorten the development effort becomes increasingly important. One of these initiatives is the MDA approach that allows modeling and application of transformations on the models in order to obtain the software in an automated way. Therefore, we propose a framework based on security patterns oriented model, providing guidelines for implementation of the application model, the validation of the correct use of patterns and the automatic generation for a specific platform. Security is implicitly inserted in the system by means of the transformation between models and automatic encoding, ensuring that security will not be violated at any level and will not be susceptible to errors or alterations in the code.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Buisson, Jérémy, et Seidali Rehab. « Automatic Transformation from Ecore Metamodels towards Gallina Inductive Types ». Dans 6th International Conference on Model-Driven Engineering and Software Development. SCITEPRESS - Science and Technology Publications, 2018. http://dx.doi.org/10.5220/0006608604880495.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Qiuyan, Li, Tian Jie, Pei Qiuhong, Wu Ji et Liu Chao. « Automatic transformation technology from AADL model to UML model ». Dans 2011 IEEE 3rd International Conference on Communication Software and Networks (ICCSN). IEEE, 2011. http://dx.doi.org/10.1109/iccsn.2011.6014264.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Zhang, Jinzhu, et Jiping Niu. « XML Text Data Automatic Analysis and Transformation with Tree Convertor ». Dans 2008 International Conference on Computer Science and Software Engineering. IEEE, 2008. http://dx.doi.org/10.1109/csse.2008.1508.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Avazpour, Iman, John Grundy et Lars Grunske. « Tool support for automatic model transformation specification using concrete visualisations ». Dans 2013 IEEE/ACM 28th International Conference on Automated Software Engineering (ASE). IEEE, 2013. http://dx.doi.org/10.1109/ase.2013.6693141.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Automatic software transformation » pour d’autres types de sources :
Articles de revues Thèses
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie