Carsten Fuhs
Título
Citado por
Citado por
Ano
SAT solving for termination analysis with polynomial interpretations
C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl
International Conference on Theory and Applications of Satisfiability …, 2007
1582007
Proving termination of programs automatically with AProVE
J Giesl, M Brockschmidt, F Emmes, F Frohn, C Fuhs, C Otto, M Plücker, ...
International Joint Conference on Automated Reasoning, 184-191, 2014
892014
Better termination proving through cooperation
M Brockschmidt, B Cook, C Fuhs
International Conference on Computer Aided Verification, 413-429, 2013
842013
Analyzing program termination and complexity automatically with AProVE
J Giesl, C Aschermann, M Brockschmidt, F Emmes, F Frohn, C Fuhs, ...
Journal of Automated Reasoning 58 (1), 3-31, 2017
752017
A decision procedure for satisfiability in separation logic with inductive predicates
J Brotherston, C Fuhs, JAN Pérez, N Gorogiannis
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
722014
Alternating runtime and size complexity analysis of integer programs
M Brockschmidt, F Emmes, S Falke, C Fuhs, J Giesl
International Conference on Tools and Algorithms for the Construction and …, 2014
692014
Alternating runtime and size complexity analysis of integer programs
M Brockschmidt, F Emmes, S Falke, C Fuhs, J Giesl
International Conference on Tools and Algorithms for the Construction and …, 2014
692014
Proving termination of integer term rewriting
C Fuhs, J Giesl, M Plücker, P Schneider-Kamp, S Falke
International Conference on Rewriting Techniques and Applications, 32-47, 2009
602009
Analyzing runtime and size complexity of integer programs
M Brockschmidt, F Emmes, S Falke, C Fuhs, J Giesl
ACM Transactions on Programming Languages and Systems (TOPLAS) 38 (4), 13, 2016
562016
Proving nontermination via safety
HY Chen, B Cook, C Fuhs, K Nimkar, P O’Hearn
International Conference on Tools and Algorithms for the Construction and …, 2014
482014
Maximal termination
C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl
International Conference on Rewriting Techniques and Applications, 110-125, 2008
432008
Synthesizing shortest linear straight-line programs over GF (2) using SAT
C Fuhs, P Schneider-Kamp
International Conference on Theory and Applications of Satisfiability …, 2010
372010
Synthesizing shortest linear straight-line programs over GF (2) using SAT
C Fuhs, P Schneider-Kamp
International Conference on Theory and Applications of Satisfiability …, 2010
372010
Improving context-sensitive dependency pairs
B Alarcón, F Emmes, C Fuhs, J Giesl, R Gutiérrez, S Lucas, ...
International Conference on Logic for Programming Artificial Intelligence …, 2008
342008
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs
J Giesl, T Ströder, P Schneider-Kamp, F Emmes, C Fuhs
Proceedings of the 14th symposium on Principles and practice of declarative …, 2012
282012
Search techniques for rational polynomial orders
C Fuhs, R Navarro-Marset, C Otto, J Giesl, S Lucas, P Schneider-Kamp
International Conference on Intelligent Computer Mathematics, 109-124, 2008
272008
Optimal base encodings for pseudo-Boolean constraints
M Codish, Y Fekete, C Fuhs, P Schneider-Kamp
International Conference on Tools and Algorithms for the Construction and …, 2011
222011
Proving termination and memory safety for programs with pointer arithmetic
T Ströder, J Giesl, M Brockschmidt, F Frohn, C Fuhs, J Hensel, ...
International Joint Conference on Automated Reasoning, 208-223, 2014
212014
Proving termination by dependency pairs and inductive theorem proving
C Fuhs, J Giesl, M Parting, P Schneider-Kamp, S Swiderski
Journal of Automated Reasoning 47 (2), 133-160, 2011
212011
Polynomial Interpretations for Higher-Order Rewriting
C Fuhs, C Kop
Arxiv preprint arXiv:1203.5754, 2012
192012
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20