Programming Logics: Essays in Memory of Harald Ganzinger

by Andrei Voronkov (Editor), Christoph Weidenbach (Editor)

Overview

This Festschrift volume, published in memory of Harald Ganzinger, contains 17 papers from colleagues all over the world and covers all the fields to which Harald Ganzinger dedicated his work during his academic career. The volume begins with a complete account of Harald Ganzinger's work and then turns its focus to the research of his former colleagues, students, and friends who pay tribute to him through their writing. Their individual papers span a broad range of topics, including programming language semantics, analysis and verification, first-order and higher-order theorem proving, unification theory, non-classical logics, reasoning modulo theories, and applications of automated reasoning in biology.

Product Details

ISBN-13:	9783642376504
Publisher:	Springer Berlin Heidelberg
Publication date:	04/03/2013
Series:	Lecture Notes in Computer Science , #7797
Edition description:	2013
Pages:	447
Product dimensions:	6.10(w) x 9.25(h) x 0.04(d)

Table of Contents

Harald Ganzinger’s Legacy: Contributions to Logics and Programming.- Bio-Logics: Logical Analysis of Bioregulatory Networks.- Canonical Ground Horn Theories.- Generic Functional Representation of Sorted Trees Supporting Attribution (Haskell Can Do It).- The Blossom of Finite Semantic Trees.- Functional Logic Programming: From Theory to Curry.- From Search to Computation: Redundancy Criteria and Simplification at Work.- Elimination Techniques for Program Analysis.- Narrowing Based Inductive Proof Search.- Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning.- Common Knowledge Logic in a Higher Order Proof Assistant.- Constructing Bachmair-Ganzinger Models.- Planning with Effectively Propositional Logic.- The Relative Power of Semantics and Unification.- First-Order Resolution Methods for Modal Logics.- On Combinations of Local Theory Extensions.- Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs.