Verification, Induction, Termination Analysis

th This Festschrift is dedicated to Christoph Walther on the occasion of his 60 th birthday on August 9 , 2010. It consists of articles by some of his colleagues and former students, who, on this momentous occasion, chose to show their appreciation. Inteachingtheoreticalcomputerscience,Christophhas hadaprofoundin- ence onmany ofhis formerandcurrentstudents,notleastby the introductionof eriFun into the classroom. Outside of his teaching, developing eriFun played a major role in his recent research activities. When the idea for this Festschrift was ?rst presented to us, it quickly - came apparent that Christoph s work in the ?elds of veri?cation, induction and termination analysis would be mirrored in the contributions, leading us to refer to this project as VITA . Since many of the authors have known Christoph for much longer than we have, we feel that the contributions themselves give a better insight into his f- mer and present work than we possibly could. On that note, we hope Christoph enjoys reading this Festschrift and wish him all the best for his future. The editors wouldlike to thank everyonewho showedinterestin this project, especially the authors for their contributions and the organisers of the col- quium. Furthermore we would like to thank Kai Sachs for his work in coordin- ing this Festschrift with Springer. Last, but certainly not least, Veronika Weber hasearnedourheartfeltgratitudewithherconstantguidanceandhelpfuladvice.

Fast track proceedings Unique visibility State of the art research

Klappentext

This Festschrift volume, published in honor of Christoph Walther, contains contributions written by some of his colleagues, former students, and friends. In celebration of the 60th birthdays of Alejandro P. Buchmann, Sorin A. Huss and Christoph Walther, a colloquium was held on November 19th, 2010 in Darmstadt, Germany. The articles collected herein cover some of the main topics of Christoph Walther's research interests, such as formal modeling, theorem proving, induction, and termination analysis. Together they give a good overall perspective on the formal verification of the correctness of software systems.

Inhalt
Programming Inductive Proofs.- Termination Graphs for Java Bytecode.- Specifying and Verifying Organizational Security Properties in First-Order Logic.- Change Management for Heterogeneous Development Graphs.- The VATES-Diamond as a Verifier's Best Friend.- Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery.- Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners).- Second-Order Programs with Preconditions.