Turing Machine Approach to Runtime Software Adaptation
نویسندگان
چکیده
منابع مشابه
Turing machine approach to runtime software adaptation
In this paper, the problem of applying changes to software at runtime is considered. The computability theory is used in order to develop a more general and programming-language-independent model of computation with support for runtime changes. Various types of runtime changes were defined in terms of computable functions and Turing machines. The properties of such functions and machines were u...
متن کاملDynamic Turing Machine: model and properties for runtime code changes
In this paper, a dynamic model of computation based on the Universal Turing Machine is proposed. This model is capable of applying runtime code modifications for 3-symbol deterministic Turing Machines at runtime and requires a decomposition of the simulated machine into parts called subtasks. The algorithm for performing runtime changes is considered, and the ability to apply runtime changes is...
متن کاملRuntime Software Architecture Based Software Evolution And Adaptation
Runtime environment of software are becoming more and more dynamic and open, while pervasive computing and web services further this approach. Software systems are becoming larger, more complex, and difficult for maintenance and evolution. Runtime software architecture (RSA) can help maintainers to understand, control, adapt and evolve the system, while keep the system running. This paper prese...
متن کاملA Model-Driven Approach to Graphical User Interface Runtime Adaptation
Graphical user interfaces play a key role in human-computer interaction, as they link the system with its end-users, allowing information exchange and improving communication. Nowadays, users increasingly demand applications with adaptive interfaces that dynamically evolve in response to their specific needs. Thus, providing graphical user interfaces with runtime adaptation capabilities is beco...
متن کاملAlan Turing Universal Turing Machine
In recent years, much research has been devoted to the synthesis of gigabit switches; on the other hand, few have explored the refinement of hash tables. In fact, few cryptographers would disagree with the improvement of the lookaside buffer. In this work, we use signed technology to show that architecture and superblocks are usually incompatible.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science
سال: 2014
ISSN: 1508-2806
DOI: 10.7494/csci.2014.15.3.293