Jürgen Giesl

Citace

	Všechny	Od 2020
Citace	6508	1195
h-index	42	17
i10-index	106	33

420

210

105

315

19961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202521 46 70 63 73 104 90 140 171 195 189 360 343 410 401 345 364 201 313 265 219 281 257 312 202 244 206 233 300 10

Veřejný přístup

Zobrazit všechny

81 článků

0 článků

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Peter Schneider-KampProfessor of Computer Science, University of Southern DenmarkE-mailová adresa ověřena na: imada.sdu.dk
Florian FrohnRWTH Aachen University, Aachen, GermanyE-mailová adresa ověřena na: cs.rwth-aachen.de
Carsten FuhsSenior Lecturer, Birkbeck, University of LondonE-mailová adresa ověřena na: dcs.bbk.ac.uk
Marc BrockschmidtResearch Scientist, Google DeepMindE-mailová adresa ověřena na: google.com
Jera HenselRWTH Aachen UniversityE-mailová adresa ověřena na: cs.rwth-aachen.de
Carsten OttoSoftware EngineerE-mailová adresa ověřena na: c-otto.de
Thomas ArtsProfessor of Software Engineering, ChalmersE-mailová adresa ověřena na: quviq.com
Aart MiddeldorpUniversity of InnsbruckE-mailová adresa ověřena na: uibk.ac.at
Michael CodishDepartment of Computer Science, Ben-Gurion University of the NegevE-mailová adresa ověřena na: cs.bgu.ac.il
Alexander SerebrenikFull Professor of Social Software Engineering, Computer Science, Eindhoven University of TechnologyE-mailová adresa ověřena na: tue.nl
Deepak KapurUniversity of New MexicoE-mailová adresa ověřena na: cs.unm.edu
Danny De SchreyeHoogleraar Computerwetenschappen, KU LeuvenE-mailová adresa ověřena na: cs.kuleuven.be
Christian SternagelE-mailová adresa ověřena na: uibk.ac.at
Lars NoschinskiTechnische Universität MünchenE-mailová adresa ověřena na: in.tum.de
hans zantemaEindhoven university of technologyE-mailová adresa ověřena na: tue.nl
Albert RubioProfessor of Computer Science, Complutense University of Madrid (UCM)E-mailová adresa ověřena na: ucm.es
Salvador LucasDSIC & VRAIN, Universitat Politècnica de ValènciaE-mailová adresa ověřena na: dsic.upv.es
Benjamin Lucien KaminskiProfessor of Computer Science at Saarland University and Lecturer at University College LondonE-mailová adresa ověřena na: cs.uni-saarland.de
Joost-Pieter KatoenDistinguished Professor of Computer Science, RWTH Aachen University and University of TwenteE-mailová adresa ověřena na: cs.rwth-aachen.de
Enno OhlebuschProfessor for Theoretical Bioinformatics, University of UlmE-mailová adresa ověřena na: uni-ulm.de

Sledovat

Jürgen Giesl

Professor of Computer Science, RWTH Aachen University

E-mailová adresa ověřena na: informatik.rwth-aachen.de - Domovská stránka

Program Analysis Verification Rewriting Automated Deduction


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Termination of term rewriting using dependency pairs T Arts, J Giesl Theoretical computer science 236 (1-2), 133-178, 2000	781	2000
AProVE 1.2: Automatic termination proofs in the dependency pair framework J Giesl, P Schneider-Kamp, R Thiemann International Joint Conference on Automated Reasoning, 281-286, 2006	327	2006
Mechanizing and improving dependency pairs J Giesl, R Thiemann, P Schneider-Kamp, S Falke Journal of Automated Reasoning 37 (3), 155-203, 2006	268	2006
Automated termination proofs with AProVE J Giesl, R Thiemann, P Schneider-Kamp, S Falke International Conference on Rewriting Techniques and Applications, 210-220, 2004	217	2004
The dependency pair framework: Combining techniques for automated termination proofs J Giesl, R Thiemann, P Schneider-Kamp International Conference on Logic for Programming Artificial Intelligence …, 2005	209	2005
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, 3-31, 2017	179	2017
SAT solving for termination analysis with polynomial interpretations C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl Theory and Applications of Satisfiability Testing–SAT 2007: 10th …, 2007	179	2007
Proving and disproving termination of higher-order functions J Giesl, R Thiemann, P Schneider-Kamp International Workshop on Frontiers of Combining Systems, 216-231, 2005	156	2005
Proving Termination of Programs Automatically with AProVE J Giesl, M Brockschmidt, F Emmes, F Frohn, C Fuhs, C Otto, M Plücker, ... Automated Reasoning: 7th International Joint Conference, IJCAR 2014, Held as …, 2014	131	2014
Automated termination proofs for Haskell by term rewriting J Giesl, M Raffelsieper, P Schneider-Kamp, S Swiderski, R Thiemann ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2), 1-39, 2011	106	2011
Automated termination analysis of Java Bytecode by term rewriting C Otto, M Brockschmidt, C von Essen, J Giesl Proceedings of the 21st International Conference on Rewriting Techniques and …, 2010	106	2010
Modular termination proofs for rewriting using dependency pairs J Giesl, T Arts, E Ohlebusch Journal of symbolic computation 34 (1), 21-58, 2002	104	2002
Automated termination analysis for Haskell: From term rewriting to programming languages J Giesl, S Swiderski, P Schneider-Kamp, R Thiemann International Conference on Rewriting Techniques and Applications, 297-312, 2006	100	2006
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), 1-50, 2016	96	2016
Alternating runtime and size complexity analysis of integer programs M Brockschmidt, F Emmes, S Falke, C Fuhs, J Giesl Tools and Algorithms for the Construction and Analysis of Systems: 20th …, 2014	96	2014
Termination of nested and mutually recursive algorithms J Giesl Journal of automated reasoning 19, 1-29, 1997	89	1997
Transformation techniques for context-sensitive rewrite systems J Giesl, A Middeldorp Journal of Functional Programming 14 (4), 379-427, 2004	88	2004
Automatically proving termination where simplification orderings fail T Arts, J Giesl Colloquium on Trees in Algebra and Programming, 261-272, 1997	86	1997
Verification of Erlang processes by dependency pairs J Giesl, T Arts Applicable Algebra in Engineering, Communication and Computing 12, 39-72, 2001	85	2001
Generating polynomial orderings for termination proofs J Giesl International Conference on Rewriting Techniques and Applications, 426-431, 1995	85	1995

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři