Остановите войну!
for scientists:
default search action
Isabela Dramnesc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c20]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Certification of Tail Recursive Bubble-Sort in Theorema and Coq. LPAR Complementary Volume 2024: 53-68 - [c19]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Certification of Sorting Algorithms Using Theorema and Coq. SCSS 2024: 38-56 - 2023
- [c18]Isabela Dramnesc, Tudor Jebelean:
Mechanical Verification of Insert-Sort and Merge-Sort Using Multisets in Theorema. SISY 2023: 55-60 - 2022
- [c17]Isabela Dramnesc, Erika Ábrahám, Tudor Jebelean, Gábor Kusper, Sorin Stratulat:
Experiments with Automated Reasoning in the Class. CICM 2022: 287-304 - 2021
- [j3]Isabela Dramnesc, Tudor Jebelean:
Synthesis of sorting algorithms using multisets in Theorema. J. Log. Algebraic Methods Program. 119: 100635 (2021) - [c16]Isabela Dramnesc, Tudor Jebelean:
AlCons : Deductive Synthesis of Sorting Algorithms in Theorema. ICTAC 2021: 314-333 - [c15]Isabela Dramnesc, Tudor Jebelean:
Synthesis of Merging algorithms on binary trees using multisets in Theorema. SACI 2021: 497-502 - 2020
- [c14]Isabela Dramnesc, Tudor Jebelean:
Deductive Synthesis of Min-Max-Sort Using Multisets in Theorema. SACI 2020: 165-172
2010 – 2019
- 2019
- [j2]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) - [c13]Isabela Dramnesc, Tudor Jebelean:
Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema. MACIS 2019: 153-168 - [c12]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 - [c11]Isabela Dramnesc, Tudor Jebelean:
Proof-Based Synthesis of Sorting Algorithms Using Multisets in Theorema. FROM 2019: 76-91 - 2016
- [c10]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Proof-Based Synthesis of Sorting Algorithms for Trees. LATA 2016: 562-575 - [c9]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
A case study on algorithm discovery from proofs: The insert function on binary trees. SACI 2016: 231-236 - 2015
- [j1]Isabela Dramnesc, Tudor Jebelean:
Synthesis of list algorithms by mechanical proving. J. Symb. Comput. 69: 61-92 (2015) - [c8]Isabela Dramnesc, Tudor Jebelean:
A case study in proof based synthesis of algorithms on monotone lists. SACI 2015: 483-488 - [c7]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Theory exploration of binary trees. SISY 2015: 139-144 - [c6]Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Combinatorial Techniques for Proof-Based Synthesis of Sorting Algorithms. SYNASC 2015: 137-144 - 2014
- [c5]Isabela Dramnesc, Tudor Jebelean:
Theory exploration of sets represented as monotone lists. SISY 2014: 163-168 - 2012
- [c4]Isabela Dramnesc, Tudor Jebelean:
Theory Exploration in Theorema: Case Study on Lists. SACI 2012: 421-426 - [c3]Isabela Dramnesc, Tudor Jebelean:
Discovery of inductive algorithms through automated reasoning: A case study on sorting. SISY 2012: 293-298 - [c2]Isabela Dramnesc, Tudor Jebelean:
Automated Synthesis of Some Algorithms on Finite Sets. SYNASC 2012: 143-151 - 2011
- [c1]Isabela Dramnesc, Tudor Jebelean:
Proof Techniques for Synthesis of Sorting Algorithms. SYNASC 2011: 101-109
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-09-05 02:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint