default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID60. Birthday: Christoph Walther 2010
- Simon Siegler, Nathan Wasser:
Verification, Induction, Termination Analysis - Festschrift for Christoph Walther on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 6463, Springer 2010, ISBN 978-3-642-17171-0 - Brigitte Pientka:
Programming Inductive Proofs - A New Approach Based on Contextual Types. 1-16 - Marc Brockschmidt, Carsten Otto, Christian von Essen, Jürgen Giesl:
Termination Graphs for Java Bytecode. 17-37 - Christoph Brandt, Jens Otten
, Christoph Kreitz, Wolfgang Bibel:
Specifying and Verifying Organizational Security Properties in First-Order Logic. 38-53 - Serge Autexier, Dieter Hutter, Till Mossakowski:
Change Management for Heterogeneous Development Graphs. 54-80 - Sabine Glesner, Björn Bartels, Thomas Göthel, Moritz Kleine:
The VATES-Diamond as a Verifier's Best Friend. 81-101 - Moa Johansson, Lucas Dixon, Alan Bundy:
Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery. 102-116 - Christoph Benzmüller:
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners). 117-128 - Markus Aderhold:
Second-Order Programs with Preconditions. 129-143
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-27 21:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
