default search action
Tudor Jebelean
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c50]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Certification of Tail Recursive Bubble-Sort in Theorema and Coq. LPAR Complementary Volume 2024: 53-68 - [c49]Tudor Jebelean:
A Natural-style Prover in Theorema Using Sequent Calculus with Unit Propagation. LPAR Complementary Volume 2024: 107-116 - [c48]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Certification of Sorting Algorithms Using Theorema and Coq. SCSS 2024: 38-56 - 2023
- [c47]Isabela Dramnesc, Tudor Jebelean:
Mechanical Verification of Insert-Sort and Merge-Sort Using Multisets in Theorema. SISY 2023: 55-60 - 2022
- [c46]Isabela Dramnesc, Erika Ábrahám, Tudor Jebelean, Gábor Kusper, Sorin Stratulat:
Experiments with Automated Reasoning in the Class. CICM 2022: 287-304 - 2021
- [j13]Isabela Dramnesc, Tudor Jebelean:
Synthesis of sorting algorithms using multisets in Theorema. J. Log. Algebraic Methods Program. 119: 100635 (2021) - [c45]Isabela Dramnesc, Tudor Jebelean:
AlCons : Deductive Synthesis of Sorting Algorithms in Theorema. ICTAC 2021: 314-333 - [c44]Tudor Jebelean:
A Heuristic Prover for Elementary Analysis in Theorema. CICM 2021: 130-134 - [c43]Isabela Dramnesc, Tudor Jebelean:
Synthesis of Merging algorithms on binary trees using multisets in Theorema. SACI 2021: 497-502 - 2020
- [c42]Isabela Dramnesc, Tudor Jebelean:
Deductive Synthesis of Min-Max-Sort Using Multisets in Theorema. SACI 2020: 165-172
2010 – 2019
- 2019
- [j12]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques. J. Symb. Comput. 90: 3-41 (2019) - [c41]Isabela Dramnesc, Tudor Jebelean:
Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema. MACIS 2019: 153-168 - [c40]Isabela Dramnesc, Tudor Jebelean:
Case Studies on Algorithm Discovery from Proofs: The Delete Function on Lists and Binary Trees using Multisets. SISY 2019: 213-220 - [c39]Isabela Dramnesc, Tudor Jebelean:
Proof-Based Synthesis of Sorting Algorithms Using Multisets in Theorema. FROM 2019: 76-91 - 2018
- [j11]Tudor Jebelean:
Techniques for natural-style proofs in elementary analysis. ACM Commun. Comput. Algebra 52(3): 92-95 (2018) - [c38]Tudor Jebelean:
Techniques for Natural-style Proofs in Elementary Analysis. SC-Square@FLOC 2018: 122 - 2017
- [j10]Tudor Jebelean, Wei Li, Dongming Wang:
Special Issue on Program Verification, Automated Debugging and Symbolic Computation. J. Symb. Comput. 80: 1-3 (2017) - [e14]Tudor Jebelean, Viorel Negru, Dana Petcu, Daniela Zaharie, Tetsuo Ida, Stephen M. Watt:
19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017, Timisoara, Romania, September 21-24, 2017. IEEE Computer Society 2017, ISBN 978-1-5386-2626-9 [contents] - 2016
- [j9]Bruno Buchberger, Tudor Jebelean, Temur Kutsia, Alexander Maletzky, Wolfgang Windsteiger:
Theorema 2.0: Computer-Assisted Natural-Style Mathematics. J. Formaliz. Reason. 9(1): 149-185 (2016) - [c37]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Proof-Based Synthesis of Sorting Algorithms for Trees. LATA 2016: 562-575 - [c36]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
A case study on algorithm discovery from proofs: The insert function on binary trees. SACI 2016: 231-236 - [e13]James H. Davenport, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016, Timisoara, Romania, September 24-27, 2016. IEEE 2016, ISBN 978-1-5090-5707-8 [contents] - 2015
- [j8]Isabela Dramnesc, Tudor Jebelean:
Synthesis of list algorithms by mechanical proving. J. Symb. Comput. 69: 61-92 (2015) - [c35]Isabela Dramnesc, Tudor Jebelean:
A case study in proof based synthesis of algorithms on monotone lists. SACI 2015: 483-488 - [c34]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Theory exploration of binary trees. SISY 2015: 139-144 - [c33]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Combinatorial Techniques for Proof-Based Synthesis of Sorting Algorithms. SYNASC 2015: 137-144 - [e12]Laura Kovács, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, Timisoara, Romania, September 21-24, 2015. IEEE Computer Society 2015, ISBN 978-1-5090-0461-4 [contents] - 2014
- [c32]Isabela Dramnesc, Tudor Jebelean:
Theory exploration of sets represented as monotone lists. SISY 2014: 163-168 - [e11]Franz Winkler, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014, Timisoara, Romania, September 22-25, 2014. IEEE Computer Society 2014, ISBN 978-1-4799-8447-3 [contents] - 2013
- [e10]Nikolaj S. Bjørner, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013, Timisoara, Romania, September 23-26, 2013. IEEE Computer Society 2013, ISBN 978-1-4799-3035-7 [contents] - 2012
- [c31]Isabela Dramnesc, Tudor Jebelean:
Theory Exploration in Theorema: Case Study on Lists. SACI 2012: 421-426 - [c30]Isabela Dramnesc, Tudor Jebelean:
Discovery of inductive algorithms through automated reasoning: A case study on sorting. SISY 2012: 293-298 - [c29]Madalina Erascu, Tudor Jebelean:
Soundness of a Logic-Based Verification Method for Imperative Loops. SYNASC 2012: 127-134 - [c28]Isabela Dramnesc, Tudor Jebelean:
Automated Synthesis of Some Algorithms on Finite Sets. SYNASC 2012: 143-151 - [e9]Andrei Voronkov, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2012, Timisoara, Romania, September 26-29, 2012. IEEE Computer Society 2012, ISBN 978-1-4673-5026-6 [contents] - 2011
- [c27]Isabela Dramnesc, Tudor Jebelean:
Proof Techniques for Synthesis of Sorting Algorithms. SYNASC 2011: 101-109 - [e8]Dongming Wang, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2011, Timisoara, Romania, September 26-29, 2011. IEEE Computer Society 2011, ISBN 978-1-4673-0207-4 [contents] - 2010
- [c26]Madalina Erascu, Tudor Jebelean:
A Purely Logical Approach to the Termination of Imperative Loops. SYNASC 2010: 142-149 - [c25]Nikolaj Popov, Tudor Jebelean:
Proving Partial Correctness and Termination of Mutually Recursive Programs. SYNASC 2010: 153-156 - [e7]Tetsuo Ida, Viorel Negru, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2010, Timisoara, Romania, 23-26 September 2010. IEEE Computer Society 2010, ISBN 978-0-7695-4324-6 [contents]
2000 – 2009
- 2009
- [j7]Nikolaj Popov, Tudor Jebelean:
Using Computer Algebra techniques for the specification, verification and synthesis of recursive programs. Math. Comput. Simul. 79(8): 2302-2309 (2009) - [j6]Róbert Vajda, Tudor Jebelean, Bruno Buchberger:
Combining logical and algebraic techniques for natural style proving in elementary analysis. Math. Comput. Simul. 79(8): 2310-2316 (2009) - [c24]Madalina Erascu, Tudor Jebelean:
A Calculus for Imperative Programs: Formalization and Implementation. SYNASC 2009: 77-84 - [p1]Tudor Jebelean, Bruno Buchberger, Temur Kutsia, Nikolaj Popov, Wolfgang Schreiner, Wolfgang Windsteiger:
Automated Reasoning. Hagenberg Research 2009: 63-101 - [e6]Bruno Buchberger, Michael Affenzeller, Alois Ferscha, Michael Haller, Tudor Jebelean, Erich-Peter Klement, Peter Paule, Gustav Pomberger, Wolfgang Schreiner, Robert Stubenrauch, Roland R. Wagner, Gerhard Weiß, Wolfgang Windsteiger:
Hagenberg Research. Springer 2009, ISBN 978-3-642-02126-8 [contents] - [e5]Stephen M. Watt, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Daniela Zaharie:
11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2009, Timisoara, Romania, September 26-29, 2009. IEEE Computer Society 2009, ISBN 978-1-4244-5910-0 [contents] - 2008
- [c23]Tudor Jebelean, Gábor Kusper:
Multi-Domain Logic and its Applications to SAT. SYNASC 2008: 3-8 - [e4]Viorel Negru, Tudor Jebelean, Dana Petcu, Daniela Zaharie:
SYNASC 2008, 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, 26-29 September 2008. IEEE Computer Society 2008, ISBN 978-0-7695-3523-4 [contents] - 2007
- [e3]Viorel Negru, Tudor Jebelean, Dana Petcu, Daniela Zaharie:
Proceedings of the Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2007, Timisoara, Romania, September 26-29, 2007. IEEE Computer Society 2007, ISBN 978-0-7695-3078-9 [contents] - 2006
- [j5]Bruno Buchberger, Adrian Craciun, Tudor Jebelean, Laura Kovács, Temur Kutsia, Koji Nakagawa, Florina Piroi, Nikolaj Popov, Judit Robu, Markus Rosenkranz, Wolfgang Windsteiger:
Theorema: Towards computer-aided mathematical theory exploration. J. Appl. Log. 4(4): 470-504 (2006) - [c22]Laura Ruff, Tudor Jebelean:
Functional-Based Synthesis of a Systolic Array for GCD Computation. IFL 2006: 37-54 - [c21]Laura Kovács, Nikolaj Popov, Tudor Jebelean:
Combining Logic and Algebraic Techniques for Program Verification in Theorema. ISoLA 2006: 67-74 - 2005
- [c20]Laura Ildikó Kovács, Tudor Jebelean:
An Algorithm for Automated Generation of Invariants for Loops with Conditionals. SYNASC 2005: 245-249 - [c19]Tudor Jebelean, Laura Szakacs:
Functional-Based Synthesis of Systolic Online Multipliers. SYNASC 2005: 267-275 - [e2]Daniela Zaharie, Dana Petcu, Viorel Negru, Tudor Jebelean, Gabriel Ciobanu, Alexandru Cicortas, Ajith Abraham, Marcin Paprzycki:
Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 25-29 September 2005, Timisoara, Romania. IEEE Computer Society 2005, ISBN 0-7695-2453-2 [contents] - 2004
- [c18]Tudor Jebelean, Laura Kovács, Nikolaj Popov:
Experimental Program Verification in the Theorema System. ISoLA (Preliminary proceedings) 2004: 92-99 - 2001
- [j4]Alessandro Armando, Tudor Jebelean:
Special Issue on Calculemus-99: Integrating Computation and Deduction - Foreword of the Guest Editors. J. Symb. Comput. 32(4): 303-304 (2001) - 2000
- [c17]Bogdan Matasaru, Tudor Jebelean:
FPGA Implementation of an Extended Binary GCD Algorithm for Systolic Reduction of Rational Numbers. FPL 2000: 810-813
1990 – 1999
- 1999
- [c16]Alessandro Armando, Tudor Jebelean:
Preface. Calculemus 1999: 319-320 - [e1]Alessandro Armando, Tudor Jebelean:
Systems for Integrated Computation and Deduction, CALCULEMUS 1999, associated to FLoC '99, the 1999 Federated Logic Conference, Trento, Italy, July 11-12, 1999. Electronic Notes in Theoretical Computer Science 23(3), Elsevier 1999 [contents] - 1997
- [c15]Tudor Jebelean:
Using the Parallel Karatsuba Algorithm for Long Integer Multiplication and Division. Euro-Par 1997: 1169-1172 - [c14]Tudor Jebelean:
Auto-configurable array for GCD computation. FPL 1997: 457-461 - [c13]Tudor Jebelean:
Practical Integer Division with Karatsuba Complexity. ISSAC 1997: 339-341 - [c12]Bruno Buchberger, Tudor Jebelean, Franz Kriftner, Mircea Marin, Elena Tomuta, Daniela Vasaru:
A Survey of the Theorema Project. ISSAC 1997: 384-391 - 1996
- [j3]Werner Krandick, Tudor Jebelean:
Bidirectional Exact Integer Division. J. Symb. Comput. 21(4): 441-455 (1996) - [c11]Tudor Jebelean:
Integer and Rational Arithmetic on MasPar. DISCO 1996: 162-173 - 1995
- [j2]Tudor Jebelean:
A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD of Long Integers. J. Symb. Comput. 19(1-3): 145-157 (1995) - [c10]Tudor Jebelean:
Design of a systolic coprocessor for rational addition. ASAP 1995: 282-289 - [c9]Tudor Jebelean:
FPGA Implementation of a Rational Adder. FPL 1995: 251-260 - 1994
- [c8]Tudor Jebelean:
Designing systolic arrays for integer GCD computation. ASAP 1994: 295-301 - [c7]Tudor Jebelean:
Systolic Algorithms for Long Integer GCD Computation. CONPAR 1994: 241-252 - [c6]Tudor Jebelean:
Implementing GCD Systolic Arrays on FPGA. FPL 1994: 132-134 - [c5]Werner Krandick, Tudor Jebelean:
Bidirectional Exact Integer Division. PASCO 1994: 264-272 - 1993
- [j1]Tudor Jebelean:
An Algorithm for Exact Division. J. Symb. Comput. 15(2): 169-180 (1993) - [c4]Tudor Jebelean:
Comparing several GCD algorithms. IEEE Symposium on Computer Arithmetic 1993: 180-185 - [c3]Tudor Jebelean:
Systolic normalization of rational numbers. ASAP 1993: 502-513 - [c2]Tudor Jebelean:
Improving the Multiprecision Euclidian Algorithm. DISCO 1993: 45-58 - [c1]Tudor Jebelean:
A Generalization of the Binary GCD Algorithm. ISSAC 1993: 111-116
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-10-13 18:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint