Jürgen Giesl

Navedeno

	Vse	Od leta 2020
Navedbe	6540	1187
indeks h	42	17
indeks i10	106	33

420

210

105

315

19961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202521 49 70 64 72 104 89 148 172 193 198 360 336 406 411 340 379 202 321 265 218 282 259 311 198 236 212 219 292 28

Javni dostop

Prikaži vse

84 člankov

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Peter Schneider-KampProfessor of Computer Science, University of Southern DenmarkPreverjeni e-poštni naslov na imada.sdu.dk
Florian FrohnRWTH Aachen University, Aachen, GermanyPreverjeni e-poštni naslov na cs.rwth-aachen.de
Carsten FuhsSenior Lecturer, Birkbeck, University of LondonPreverjeni e-poštni naslov na dcs.bbk.ac.uk
Marc BrockschmidtResearch Scientist, Google DeepMindPreverjeni e-poštni naslov na google.com
Jera HenselRWTH Aachen UniversityPreverjeni e-poštni naslov na cs.rwth-aachen.de
Carsten OttoSoftware EngineerPreverjeni e-poštni naslov na c-otto.de
Thomas ArtsProfessor of Software Engineering, ChalmersPreverjeni e-poštni naslov na quviq.com
Aart MiddeldorpUniversity of InnsbruckPreverjeni e-poštni naslov na uibk.ac.at
Michael CodishDepartment of Computer Science, Ben-Gurion University of the NegevPreverjeni e-poštni naslov na cs.bgu.ac.il
Alexander SerebrenikFull Professor of Social Software Engineering, Computer Science, Eindhoven University of TechnologyPreverjeni e-poštni naslov na tue.nl
Deepak KapurUniversity of New MexicoPreverjeni e-poštni naslov na cs.unm.edu
Danny De SchreyeHoogleraar Computerwetenschappen, KU LeuvenPreverjeni e-poštni naslov na cs.kuleuven.be
Christian SternagelPreverjeni e-poštni naslov na uibk.ac.at
Lars NoschinskiTechnische Universität MünchenPreverjeni e-poštni naslov na in.tum.de
hans zantemaEindhoven university of technologyPreverjeni e-poštni naslov na tue.nl
Albert RubioProfessor of Computer Science, Complutense University of Madrid (UCM)Preverjeni e-poštni naslov na ucm.es
Salvador LucasDSIC & VRAIN, Universitat Politècnica de ValènciaPreverjeni e-poštni naslov na dsic.upv.es
Benjamin Lucien KaminskiProfessor of Computer Science at Saarland University and Lecturer at University College LondonPreverjeni e-poštni naslov na cs.uni-saarland.de
Joost-Pieter KatoenDistinguished Professor of Computer Science, RWTH Aachen University and University of TwentePreverjeni e-poštni naslov na cs.rwth-aachen.de
Aart MiddeldorpProfessor of Computer Science, Innsbruck UniversityPreverjeni e-poštni naslov na uibk.ac.at

Spremljaj

Jürgen Giesl

Professor of Computer Science, RWTH Aachen University

Preverjeni e-poštni naslov na informatik.rwth-aachen.de - Domača stran

Program Analysis Verification Rewriting Automated Deduction


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Termination of term rewriting using dependency pairs T Arts, J Giesl Theoretical computer science 236 (1-2), 133-178, 2000	786	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	331	2006
Mechanizing and improving dependency pairs J Giesl, R Thiemann, P Schneider-Kamp, S Falke Journal of Automated Reasoning 37 (3), 155-203, 2006	271	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	215	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	212	2005
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	181	2007
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	178	2017
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	161	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	132	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	107	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	107	2010
Modular termination proofs for rewriting using dependency pairs J Giesl, T Arts, E Ohlebusch Journal of symbolic computation 34 (1), 21-58, 2002	106	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	99	2006
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	97	2014
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	93	2016
Termination of nested and mutually recursive algorithms J Giesl Journal of automated reasoning 19, 1-29, 1997	90	1997
Transformation techniques for context-sensitive rewrite systems J Giesl, A Middeldorp Journal of Functional Programming 14 (4), 379-427, 2004	87	2004
Verification of Erlang processes by dependency pairs J Giesl, T Arts Applicable Algebra in Engineering, Communication and Computing 12, 39-72, 2001	86	2001
Generating polynomial orderings for termination proofs J Giesl International Conference on Rewriting Techniques and Applications, 426-431, 1995	86	1995
Automatically proving termination where simplification orderings fail T Arts, J Giesl Colloquium on Trees in Algebra and Programming, 261-272, 1997	84	1997

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji