Code Stabilization

Dijkstra’s concept of self-stabilization assumes that faults can only affect the variables of a program. We study the notion of self-stabilization if faults can also affect (i.e., augment) the program code of a system. A code stabilizing system automatically recovers from (almost) arbitrary perturbations of its program code. We prove some lower bounds for code stabilizing systems and argue that code stabilization has many resemblances to the area of integrity management in the domain of security.

[1]  Andreas J. Winter,et al.  Modules and Updatable Graph Views for PROgrammed Graph REwriting Systems , 1997 .

[2]  Rance Cleaveland,et al.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems , 1993, TOPL.

[3]  Benedikt Bollig,et al.  Message-passing automata are expressively equivalent to EMSO logic , 2006, Theor. Comput. Sci..

[4]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[5]  Jürgen Giesl,et al.  Proving and Disproving Termination of Higher-Order Functions , 2005, FroCoS.

[6]  Amos Israeli,et al.  Self-stabilization of dynamic systems assuming only read/write atomicity , 1990, PODC '90.

[7]  Andy Schürr,et al.  Computing with Graphs and Graph Rewriting , 1999 .

[8]  Mohamed G. Gouda.  Elements of security: Closure, convergence, and protection , 2001, Inf. Process. Lett..

[9]  Stackbased ReductionGuido Hogen,et al.  Parallel Functional Implementations: Graphbased vs. Stackbased Reduction , 1995 .

[10]  Matthias Jarke,et al.  ConceptBase - A Deductive Object Base Manager , 1994 .

[11]  Bernhard Steffen,et al.  Compositional Minimization of Finite State Systems , 1990, CAV.

[12]  Matthias Jarke,et al.  Three Aspects of Intelligent Cooperation in the Quality Cycle , 1993, Int. J. Cooperative Inf. Syst..

[13]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[14]  Guido Moerkotte,et al.  Query Optimization Techniques Exploiting Class Hierarchies , 1995 .

[15]  Martin Grohe,et al.  An existential locality theorem , 2004, Ann. Pure Appl. Log..

[16]  Stefan Richter,et al.  A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.

[17]  Ken Thompson,et al.  Reflections on trusting trust , 1984, CACM.

[18]  Anish Arora,et al.  Component Based Design of Multitolerant Systems , 1998, IEEE Trans. Software Eng..

[19]  Anish Arora,et al.  Closure and Convergence: A Foundation of Fault-Tolerant Computing , 1993, IEEE Trans. Software Eng..

[20]  George Horatiu Botorog.  High level parallel programming and the efficient implementation of numerical algorithms , 1998 .

[21]  Guido Moerkotte,et al.  Efficient Evaluation of Aggregates on Bulk Types , 1995, DBPL.

[22]  Manfred A. Jeusfeld,et al.  Query Optimization in Deductive Object Bases , 1991, Query Processing for Advanced Database Systems, Dagstuhl.

[23]  Thierry Cachat.  The Power of One-Letter Rational Languages , 2001, Developments in Language Theory.

[24]  Boaz Patt-Shamir,et al.  Self-stabilization by local checking and correction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[25]  Guido Moerkotte,et al.  Nested Queries in Object Bases , 1993, DBPL.

[26]  RWTHAachen,LehrstuhlfurInformatikII Ahornstrae55,W-5100Aachen,Germany , .

[27]  Matthias Jarke,et al.  From Relational to Object-Oriented Integrity Simplification , 1991, DOOD.

[28]  Matthias Jarke,et al.  Exploring the Semantic Structure of Technical Document Collections: A Cooperative Systems Approach , 2000, CoopIS.

[29]  Berthold Vöcking,et al.  A Counterexample to the Fully Mixed Nash Equilibrium Conjecture , 2005 .

[30]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[31]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[32]  P. Rossmanith,et al.  A New Satisabilit y Algorithm With Applications To Max-Cut , 2005 .

[33]  Shmuel Katz,et al.  Self-stabilizing extensions for message-passing systems , 1990, PODC '90.

[34]  Yoshihito Toyama,et al.  4th International Workshop on Reduction Strategies in Rewriting and Programming , 2004 .

[35]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[36]  Mohamed G. Gouda,et al.  Stabilizing Communication Protocols , 1991, IEEE Trans. Computers.

[37]  Bernhard Steffen,et al.  Characteristic Formulae for Processes with Divergence , 1994, Inf. Comput..

[38]  Christian Prehofer,et al.  Higher-order narrowing with definitional trees , 1999, Journal of Functional Programming.

[39]  J. J. Ruzz,et al.  A VHDL Speci cation of a Shared Memory Parallel Machine for Babel , 1998 .

[40]  Werner Hans,et al.  A Complete Indexing Scheme for WAM-based Abstract Machines , 1992, PLILP.

[41]  Thomas Noll,et al.  Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information , 2006, Acta Informatica.

[42]  Manfred A. Jeusfeld,et al.  An Executable Meta Model for Re-Engineering of Database Schemas , 1994, Int. J. Cooperative Inf. Syst..

[43]  Werner Hans,et al.  Full Indexing for Lazy Narrowing , 1993 .

[44]  Matthias Jarke,et al.  Simulating the Impact of Information Flows in Networked Organizations , 1996, ICIS.

[45]  Stefan Gruner.  Schemakorrespondenzaxiome unterstützen die paargrammatische Spezifikation inkrementeller Integrationswerkzeuge , 1997 .