Stephan Falke - Citegraph

Author Info

Name	Affiliation	Papers
STEPHAN FALKE	LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany	27
Collaborators	Citations	PageRank
20	511	27.86
Referers	Referees	References
608	398	482

Search Limit

100608

Publications (27 rows)

Collaborators (20 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Analyzing Runtime and Size Complexity of Integer Programs.	13	0.49	2016
Alternating Runtime and Size Complexity Analysis of Integer Programs.	27	0.97	2014
Extending the Theory of Arrays: memset, memcpy, and Beyond.	5	0.48	2013
The bounded model checker LLBMC	12	0.65	2013
LLBMC: Improved Bounded Model Checking of C Programs Using LLVM - (Competition Contribution).	9	0.49	2013
Providing 10-16 Short-Term Stability of a 1.5-µm Laser to Optical Clocks.	0	0.34	2013
A Theory of Arrays with set and copy Operations.	0	0.34	2012
Review of transitions and trees: an introduction to structural operational semantics, by Hans Hüttel	0	0.34	2012
Termination analysis of imperative programs using bitvector arithmetic	21	0.89	2012
LLBMC: A Bounded Model Checker for LLVM's Intermediate Representation - (Competition Contribution).	6	0.44	2012
Challenges in Comparing Software Verification Tools for C.	1	0.35	2012
Review of introduction to mathematics of satisfiability, by Victor W. Marek	0	0.34	2012
LLBMC: bounded model checking of C and C++ programs using a compiler IR	64	2.33	2012
Rewriting induction + linear arithmetic = decision procedure	13	0.67	2012
Termination Analysis of C Programs Using Compiler Intermediate Languages	30	1.01	2011
Tackling the blackbody shift in a strontium optical lattice clock	1	0.63	2011
A precise memory model for low-level bounded model checking	20	1.00	2010
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs	10	0.67	2009
Proving Termination of Integer Term Rewriting	17	0.96	2009
Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures	3	0.39	2009
Termination of context-sensitive rewriting with built-in numbers and collection data structures	1	0.36	2009
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures	12	0.65	2008
Dependency Pairs for Rewriting with Non-free Constructors	4	0.42	2007
Inductive decidability using implicit induction	4	0.42	2006
Mechanizing and Improving Dependency Pairs	124	3.83	2006
Automated Termination Proofs with AProVE	88	6.72	2004
Improving Dependency Pairs	26	1.66	2003