default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Krauss 0001
Person information
- affiliation: QAware
- affiliation (Ph.D.): Technische Universität München, Germany
Other persons with the same name
- Alexander Krauss 0002
![[0000-0002-1783-2765]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1783-2765")
— London School of Economics, London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2009
[b1]Alexander Krauss:
Automating recursive definitions and termination proofs in higher-order logic. Technical University Munich, 2009, pp. 1-127
Journal Articles
- 2016
- [j5]Ana Bove, Alexander Krauss, Matthieu Sozeau:
Partiality and recursion in interactive theorem provers - an overview. Math. Struct. Comput. Sci. 26(1): 38-88 (2016) - 2012
- [j4]Alexander Krauss, Tobias Nipkow:
Proof Pearl: Regular Expression Equivalence and Relation Algebra. J. Autom. Reason. 49(1): 95-106 (2012) - 2011
- [j3]Jasmin Christian Blanchette, Alexander Krauss:
Monotonicity Inference for Higher-Order Formulas. J. Autom. Reason. 47(4): 369-398 (2011) - 2010
- [j2]Alexander Krauss, Tobias Nipkow:
Regular Sets and Expressions. Arch. Formal Proofs 2010 (2010) - [j1]Alexander Krauss:
Partial and Nested Recursive Function Definitions in Higher-order Logic. J. Autom. Reason. 44(4): 303-336 (2010)
Conference and Workshop Papers
- 2018
- [c13]Fabian Huch, Mojdeh Golagha, Ana Petrovska, Alexander Krauss:
Machine learning-based run-time anomaly detection in software systems: An industrial evaluation. MaLTeSQuE 2018: 13-18 - 2013
- [c12]Cezary Kaliszyk, Alexander Krauss:
Scalable LCF-Style Proof Translation. ITP 2013: 51-66 - [c11]Florian Haftmann, Alexander Krauss, Ondrej Kuncar, Tobias Nipkow:
Data Refinement in Isabelle/HOL. ITP 2013: 100-115 - 2011
- [c10]Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl:
Termination of Isabelle Functions via Termination of Rewriting. ITP 2011: 152-167 - 2010
- [c9]Jasmin Christian Blanchette, Alexander Krauss:
Monotonicity Inference for Higher-Order Formulas. IJCAR 2010: 91-106 - [c8]Alexander Krauss:
Recursive Definitions of Monadic Functions. PAR@ITP 2010: 1-13 - [c7]Alexander Krauss, Andreas Schropp:
A Mechanized Translation from Higher-Order Logic to Set Theory. ITP 2010: 323-338 - [c6]Alexander Krauss:
Recursive Definitions of Monadic Functions. PAR 2010: 1-13 - 2008
- [c5]Alexander Krauss:
Pattern minimization problems over recursive data types. ICFP 2008: 267-274 - [c4]Lukas Bulwahn, Alexander Krauss, Florian Haftmann, Levent Erkök, John Matthews:
Imperative Functional Programming with Isabelle/HOL. TPHOLs 2008: 134-149 - 2007
- [c3]Alexander Krauss:
Certified Size-Change Termination. CADE 2007: 460-475 - [c2]Lukas Bulwahn, Alexander Krauss, Tobias Nipkow:
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL. TPHOLs 2007: 38-53 - 2006
- [c1]Alexander Krauss:
Partial Recursive Functions in Higher-Order Logic. IJCAR 2006: 589-603
Informal and Other Publications
- 2022
- [i1]Fabian Huch, Alexander Krauss:
FindFacts: A Scalable Theorem Search. CoRR abs/2204.14191 (2022)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-28 02:20 CEST 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:
