default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephan Falke 0001
Person information
- affiliation: Karlsruhe Institute of Technology, Institute for Theoretical Computer Science, Germany
- affiliation: University of New Mexico, Department of Computer Science, USA
Other persons with the same name
- Stephan Falke 0002 — Physikalisch-Technische Bundesanstalt (PTB), Brunswick, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
[j4]Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl:
Analyzing Runtime and Size Complexity of Integer Programs. ACM Trans. Program. Lang. Syst. 38(4): 13:1-13:50 (2016)- 2012
- [j3]Stephan Falke:
Review of introduction to mathematics of satisfiability, by Victor W. Marek. SIGACT News 43(3): 41-44 (2012) - [j2]Stephan Falke:
Review of transitions and trees: an introduction to structural operational semantics, by Hans Hüttel. SIGACT News 43(4): 34-37 (2012) - 2006
- [j1]Jürgen Giesl
, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Mechanizing and Improving Dependency Pairs. J. Autom. Reason. 37(3): 155-203 (2006)
Conference and Workshop Papers
- 2015
- [c22]Stephan Falke, Deepak Kapur:
When Is a Formula a Loop Invariant? Logic, Rewriting, and Concurrency 2015: 264-286 - 2014
- [c21]Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl:
Alternating Runtime and Size Complexity Analysis of Integer Programs. TACAS 2014: 140-155 - 2013
- [c20]Stephan Falke, Florian Merz, Carsten Sinz:
The bounded model checker LLBMC. ASE 2013: 706-709 - [c19]Stephan Falke, Florian Merz, Carsten Sinz:
LLBMC: Improved Bounded Model Checking of C Programs Using LLVM - (Competition Contribution). TACAS 2013: 623-626 - [c18]Stephan Falke, Florian Merz, Carsten Sinz:
Extending the Theory of Arrays: memset, memcpy, and Beyond. VSTTE 2013: 108-128 - 2012
- [c17]Florian Merz, Carsten Sinz, Stephan Falke:
Challenges in Comparing Software Verification Tools for C. COMPARE 2012: 60-65 - [c16]Stephan Falke, Carsten Sinz, Florian Merz:
A Theory of Arrays with set and copy Operations. SMT@IJCAR 2012: 98-108 - [c15]Stephan Falke, Deepak Kapur:
Rewriting Induction + Linear Arithmetic = Decision Procedure. IJCAR 2012: 241-255 - [c14]Carsten Sinz, Florian Merz, Stephan Falke:
LLBMC: A Bounded Model Checker for LLVM's Intermediate Representation - (Competition Contribution). TACAS 2012: 542-544 - [c13]Florian Merz, Stephan Falke, Carsten Sinz:
LLBMC: Bounded Model Checking of C and C++ Programs Using a Compiler IR. VSTTE 2012: 146-161 - [c12]Stephan Falke, Deepak Kapur, Carsten Sinz:
Termination Analysis of Imperative Programs Using Bitvector Arithmetic. VSTTE 2012: 261-277 - 2011
- [c11]Stephan Falke, Deepak Kapur, Carsten Sinz:
Termination Analysis of C Programs Using Compiler Intermediate Languages. RTA 2011: 41-50 - 2010
- [c10]Carsten Sinz, Stephan Falke, Florian Merz:
A Precise Memory Model for Low-Level Bounded Model Checking. SSV 2010 - 2009
- [c9]Stephan Falke, Deepak Kapur:
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs. CADE 2009: 277-293 - [c8]Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke:
Proving Termination of Integer Term Rewriting. RTA 2009: 32-47 - [c7]Stephan Falke, Deepak Kapur:
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures. WFLP 2009: 44-61 - 2008
- [c6]Stephan Falke, Deepak Kapur:
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures. RTA 2008: 94-109 - [c5]Stephan Falke, Deepak Kapur:
Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures. WRS@RTA 2008: 75-90 - 2007
- [c4]Stephan Falke, Deepak Kapur:
Dependency Pairs for Rewriting with Non-free Constructors. CADE 2007: 426-442 - 2006
- [c3]Stephan Falke, Deepak Kapur:
Inductive Decidability Using Implicit Induction. LPAR 2006: 45-59 - 2004
- [c2]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Automated Termination Proofs with AProVE. RTA 2004: 210-220 - 2003
- [c1]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Improving Dependency Pairs. LPAR 2003: 167-182
Informal and Other Publications
- 2009
- [i1]Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke:
Termination of Integer Term Rewriting. Interaction versus Automation: The two Faces of Deduction 2009
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-04-25 05:56 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:
