Zobrazeno 1 - 10
of 281
pro vyhledávání: '"Peter H. Schmitt"'
Autor:
Peter H. Schmitt
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030643539
20 Years of KeY
20 Years of KeY
This paper describes the story of the first nine years of the KeY project, its original goals, the people involved, its setbacks, but also its occasional failures and blind alleys. It is deliberately written in a more personal style, but tries to mee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e8a9b9812c98f12c0a001c7632c7568
https://doi.org/10.1007/978-3-030-64354-6_1
https://doi.org/10.1007/978-3-030-64354-6_1
Autor:
Peter H. Schmitt
Publikováno v:
Fields of Logic and Computation III ISBN: 9783030480059
Fields of Logic and Computation III
Fields of Logic and Computation III
This paper compares a first-order theory of ordinals proposed by the author to the theory published 1965 by Gaisi Takeuti. A clarification of the relative deductive strength of the two theories is obtained.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6223a45f45ab35a15f1ebba6fc3d1336
https://doi.org/10.1007/978-3-030-48006-6_17
https://doi.org/10.1007/978-3-030-48006-6_17
Publikováno v:
Semantic Web. 6:63-79
Translations to (first-order) Datalog have been used in a number of inferencing techniques for description logics (DLs), yet the relationship between the semantic expressivities of function-free Horn logic and DL is understood only poorly. Although D
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96518b5bd853425ef2e8e0892e8f286a
https://doi.org/10.3233/sw-130126
https://doi.org/10.3233/sw-130126
Autor:
Peter H. Schmitt
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319669014
TABLEAUX
TABLEAUX
We present a first-order theory of ordinals without resorting to set theory. The theory is implemented in the KeY program verification system which is in turn used to prove termination of a Java program computing the Goodstein sequences.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76dc0938b1d21ee5ab9eb173f770f0dd
https://doi.org/10.1007/978-3-319-66902-1_20
https://doi.org/10.1007/978-3-319-66902-1_20
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319723075
VSTTE
VSTTE
Sorting is a fundamental functionality in libraries, for which efficiency is crucial. Correctness of the highly optimised implementations is often taken for granted. De Gouw et al. have shown that this certainty is deceptive by revealing a bug in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c8f342af168dd7f0193db5b9a5b33d0
https://doi.org/10.1007/978-3-319-72308-2_3
https://doi.org/10.1007/978-3-319-72308-2_3
Autor:
Wolfgang Ahrendt, Bernhard Beckert, Richard Bubel, Reiner Hähnle, Peter H. Schmitt, Mattias Ulbrich
Static analysis of software with deductive methods is a highly dynamic field of research on the verge of becoming a mainstream technology in software engineering. It consists of a large portfolio of - mostly fully automated - analyses: formal verific
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319498119
Deductive Software Verification
Deductive Software Verification
This chapter gives a systematic tutorial introduction on how to perform formal program verification with the KeY system. It illustrates a number of complications and pitfalls, notably programs with loops, and shows how to deal with them. After workin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::330ceede97c39311b35261b61a4be162
https://doi.org/10.1007/978-3-319-49812-6_16
https://doi.org/10.1007/978-3-319-49812-6_16
Autor:
Peter H. Schmitt, Richard Bubel
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319498119
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4177a93896afb93927cff62aa05f3dea
https://doi.org/10.1007/978-3-319-49812-6_5
https://doi.org/10.1007/978-3-319-49812-6_5
Autor:
Peter H. Schmitt, Mattias Ulbrich, Bernhard Beckert, Wolfgang Ahrendt, Richard Bubel, Reiner Hähnle
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319498119
Deductive Software Verification – The KeY Book
Deductive Software Verification – The KeY Book
Static analysis of software with deductive methods is a highly dynamic field of research on the verge of becoming a mainstream technology in software engineering. It consists of a large portfolio of - mostly fully automated - analyses: formal verific
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1058175f8fff02816d60cc0a274aa0c
https://doi.org/10.1007/978-3-319-49812-6
https://doi.org/10.1007/978-3-319-49812-6
Autor:
Peter H. Schmitt
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319498119
Deductive Software Verification
Deductive Software Verification
This chapter presents syntax, a calculus, and semantics of first-order logic. This is done first for a basic, typed first-order logic, and then for a richer logic tailored to the verification of Java programs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ea12d1f5548c5793b42ca0becae995c
https://doi.org/10.1007/978-3-319-49812-6_2
https://doi.org/10.1007/978-3-319-49812-6_2