A Random Bag Preserving Product Operation
The author's current research programme is the development of a modular calculus for the average-cost of data structuring. This modular calculus provides a novel foundation for the analysis of algorithms. Its applicability to the analysis of algorithms has been demonstrated at the Center for Ef...
Saved in:
| Published in: | Electronic notes in theoretical computer science Vol. 225; pp. 341 - 360 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
02.01.2009
|
| Subjects: | |
| ISSN: | 1571-0661, 1571-0661 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The author's current research programme is the development of a modular calculus for the average-cost of data structuring. This modular calculus provides a novel foundation for the analysis of algorithms. Its applicability to the analysis of algorithms has been demonstrated at the Center for Efficiency-Oriented Languages (CEOL) through the design of the novel programming language MOQA and the associated average-case analysis tool DISTRI-TRACK [M. Schellekens, D. Hickey and G. Bollella, ACETT, a Linearly-Compositional Programming Language for (semi-)automated Average-Case analysis, IEEE Real-Time Systems Symposium - Work In Progress Session, 2004; M. Boubekeur, D. Hickey, J. Mc Enery and M. Schellekens, A new Approach for Modular Average-Case Timing of Real-Time Java Programs, Accepted for publication in WSEAS Transactions on Computers, 2007; M. Boubekeur, D. Hickey, J. Mc Enery and M. Schellekens, Towards Modular Average-Case Timing in Real-Time Languages: An Application to Real-Time Java, Accepted for publication on the 6th WSEAS International Conference on APPLIED COMPUTER SCIENCE (ACS'06), Tenerife, December, 2006; M. Schellekens, A Modular Calculus for the Average Cost of Data Structuring, Springer book to appear, 250 pages, May 2008 (to appear), M. Schellekens, Compositional Average-Case Analysis, preprint, under review, 2006]. Modular computations of the average cost of data structuring are possible through the fundamental notion of random bag preservation. Random bag preserving operations enable the constructive tracking of the data and the distribution of the data states during a MOQA computation. This in turn enables the (semi-)automated derivation of the average cost of the operations. Two fundamental MOQA operations enable the creation and destruction of data structures: the MOQA product operation, which is the subject of this paper, and the MOQA delete operation, which forms the subject of [M. Schellekens, Compositional Average-Case Analysis, preprint, under review, 2006]. The introduction of the entire MOQA language is well beyond the scope of this paper and will be reported in a book [M. Schellekens, A Modular Calculus for the Average Cost of Data Structuring, Springer book to appear, 250 pages, May 2008 (to appear)]. The language has been implemented at CEOL and automated derivations of average-cost of data structuring are under way. Here we report on a (simplified) version of the fundamental notion of random bag preservation and demonstrate that the central MOQA product operation possesses this crucial property. |
|---|---|
| AbstractList | The author's current research programme is the development of a modular calculus for the average-cost of data structuring. This modular calculus provides a novel foundation for the analysis of algorithms. Its applicability to the analysis of algorithms has been demonstrated at the Center for Efficiency-Oriented Languages (CEOL) through the design of the novel programming language MOQA and the associated average-case analysis tool DISTRI-TRACK [M. Schellekens, D. Hickey and G. Bollella, ACETT, a Linearly-Compositional Programming Language for (semi-)automated Average-Case analysis, IEEE Real-Time Systems Symposium - Work In Progress Session, 2004; M. Boubekeur, D. Hickey, J. Mc Enery and M. Schellekens, A new Approach for Modular Average-Case Timing of Real-Time Java Programs, Accepted for publication in WSEAS Transactions on Computers, 2007; M. Boubekeur, D. Hickey, J. Mc Enery and M. Schellekens, Towards Modular Average-Case Timing in Real-Time Languages: An Application to Real-Time Java, Accepted for publication on the 6th WSEAS International Conference on APPLIED COMPUTER SCIENCE (ACS'06), Tenerife, December, 2006; M. Schellekens, A Modular Calculus for the Average Cost of Data Structuring, Springer book to appear, 250 pages, May 2008 (to appear), M. Schellekens, Compositional Average-Case Analysis, preprint, under review, 2006]. Modular computations of the average cost of data structuring are possible through the fundamental notion of random bag preservation. Random bag preserving operations enable the constructive tracking of the data and the distribution of the data states during a MOQA computation. This in turn enables the (semi-)automated derivation of the average cost of the operations. Two fundamental MOQA operations enable the creation and destruction of data structures: the MOQA product operation, which is the subject of this paper, and the MOQA delete operation, which forms the subject of [M. Schellekens, Compositional Average-Case Analysis, preprint, under review, 2006]. The introduction of the entire MOQA language is well beyond the scope of this paper and will be reported in a book [M. Schellekens, A Modular Calculus for the Average Cost of Data Structuring, Springer book to appear, 250 pages, May 2008 (to appear)]. The language has been implemented at CEOL and automated derivations of average-cost of data structuring are under way. Here we report on a (simplified) version of the fundamental notion of random bag preservation and demonstrate that the central MOQA product operation possesses this crucial property. |
| Author | Schellekens, Michel |
| Author_xml | – sequence: 1 givenname: Michel surname: Schellekens fullname: Schellekens, Michel email: m.schellekens@cs.ucc.ie organization: Department of Computer Science/CEOL, National University of Ireland, Cork22Centre for Efficiency-Oriented Languages |
| BookMark | eNqFjz1PwzAQhi1UJNrCL2DJypBwl9RxMjCUii-pUhGC2XIvF-SqdSrbVOLfk7YMiAGme4d7Xr3PSAxc51iIS4QMAcvrVcYuUshygCrDPINKnoghSoUplCUOfuQzMQphBVBUqMqhuJomL8Y13Sa5Ne_Js-fAfmfdPnbNB8VksWVvou3cuThtzTrwxfcdi7f7u9fZYzpfPDzNpvOUikkVU5Y1AUGLJYDKgdBIVoByOQGqyQArlLlq2yVh_1DWLLGtCkWVZMOEVIxFfewl34XgudVk42FB9MauNYLeO-uVPjjrvbPGXPfOPVv8Yrfeboz__Ie6OVLca-0sex3IsiNurGeKuunsn_wX5Jpyvg |
| CitedBy_id | crossref_primary_10_1016_j_jlap_2009_02_006 |
| Cites_doi | 10.1007/978-1-4757-3860-5 10.1007/978-0-387-73384-5 |
| ContentType | Journal Article |
| Copyright | 2008 Elsevier B.V. |
| Copyright_xml | – notice: 2008 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.entcs.2008.12.085 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1571-0661 |
| EndPage | 360 |
| ExternalDocumentID | 10_1016_j_entcs_2008_12_085 S1571066108005483 |
| GroupedDBID | --K --M 0R~ 0SF 1B1 1~5 4.4 457 4G. 5GY 5VS 6I. 7-5 71M AABNK AACTN AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAQFI AAXUO ABMAC ACDAQ ACGFO ACGFS ACNNM ACRLP ACXMD ADBBV ADEZE ADMUD AEKER AEXQZ AFTJW AGHFR AIEXJ AIKHN AITUG ALMA_UNASSIGNED_HOLDINGS AMRAJ AXJTR CS3 DU5 EBS EJD EO8 EO9 EP2 EP3 FDB FEDTE FNPLU G-Q HVGLF HZ~ IHE IXB J1W KOM KQ8 M41 M~E N9A NCXOZ O-L O9- OK1 OZT P2P RIG ROL RPZ SDF SDG SES SPC SSV SSW SSZ 29G 9DU AAQXK AAYWO AAYXX ABFNM ABWVN ACLOT ACRPL ACVFH ADCNI ADFGL ADNMO ADVLN AEIPS AEUPX AFPUW AGQPQ AIGII AJMQA AKBMS AKRWK AKYEP ANKPU AOUOD ASPBG AVWKF AZFZN CITATION FGOYB GBLVA R2- SEW ~HD |
| ID | FETCH-LOGICAL-c348t-e59c0c0f1600720c1a5e7015b40c9ca0e71527ffbc100769e51f837c85eaec1c3 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000214327700024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1571-0661 |
| IngestDate | Sat Nov 29 02:22:07 EST 2025 Tue Nov 18 20:47:31 EST 2025 Fri Feb 23 02:31:17 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | Random Bags Languages Algorithms Compositionality Modularity |
| Language | English |
| License | http://creativecommons.org/licenses/by-nc-nd/3.0 https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c348t-e59c0c0f1600720c1a5e7015b40c9ca0e71527ffbc100769e51f837c85eaec1c3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.entcs.2008.12.085 |
| PageCount | 20 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_entcs_2008_12_085 crossref_primary_10_1016_j_entcs_2008_12_085 elsevier_sciencedirect_doi_10_1016_j_entcs_2008_12_085 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-01-02 |
| PublicationDateYYYYMMDD | 2009-01-02 |
| PublicationDate_xml | – month: 01 year: 2009 text: 2009-01-02 day: 02 |
| PublicationDecade | 2000 |
| PublicationTitle | Electronic notes in theoretical computer science |
| PublicationYear | 2009 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | M. Schellekens, Compositional Average-Case Analysis, preprint, under review, 2006 S. Edelkamp. M. Schellekens, A Modular Calculus for the Average Cost of Data Structuring, Springer book to appear, 250 pages, May 2008 (to appear) Davey, Priestley (bib001) 1990 Diplomarbeit Universität Dortmund, 1996 M. Schellekens, D. Hickey and G. Bollella, ACETT, a Linearly-Compositional Programming Language for (semi-)automated Average-Case analysis, IEEE Real-Time Systems Symposium - Work In Progress Session, 2004 M. Boubekeur, D. Hickey, J. Mc Enery and M. Schellekens, A new Approach for Modular Average-Case Timing of Real-Time Java Programs, Accepted for publication in WSEAS Transactions on Computers, 2007 M. Boubekeur, D. Hickey, J. Mc Enery and M. Schellekens, Towards Modular Average-Case Timing in Real-Time Languages: An Application to Real-Time Java, Accepted for publication on the 6th WSEAS International Conference on APPLIED COMPUTER SCIENCE (ACS'06), Tenerife, December, 2006 Knuth (bib007) 1973 Li, Vitanyi (bib009) 1993 10.1016/j.entcs.2008.12.085_bib004 10.1016/j.entcs.2008.12.085_bib003 10.1016/j.entcs.2008.12.085_bib002 Li (10.1016/j.entcs.2008.12.085_bib009) 1993 Davey (10.1016/j.entcs.2008.12.085_bib001) 1990 10.1016/j.entcs.2008.12.085_bib008 10.1016/j.entcs.2008.12.085_bib006 10.1016/j.entcs.2008.12.085_bib005 Knuth (10.1016/j.entcs.2008.12.085_bib007) 1973 |
| References_xml | – reference: M. Boubekeur, D. Hickey, J. Mc Enery and M. Schellekens, Towards Modular Average-Case Timing in Real-Time Languages: An Application to Real-Time Java, Accepted for publication on the 6th WSEAS International Conference on APPLIED COMPUTER SCIENCE (ACS'06), Tenerife, December, 2006 – reference: S. Edelkamp. – reference: M. Schellekens, A Modular Calculus for the Average Cost of Data Structuring, Springer book to appear, 250 pages, May 2008 (to appear) – reference: . Diplomarbeit Universität Dortmund, 1996 – year: 1973 ident: bib007 article-title: The art of computer programming vol. 3 – year: 1993 ident: bib009 article-title: An introduction to Kolmogorov Complexity and its applications publication-title: Texts and Monographs in Computer Science – year: 1990 ident: bib001 article-title: Introduction to Lattices and Order – reference: M. Boubekeur, D. Hickey, J. Mc Enery and M. Schellekens, A new Approach for Modular Average-Case Timing of Real-Time Java Programs, Accepted for publication in WSEAS Transactions on Computers, 2007 – reference: M. Schellekens, Compositional Average-Case Analysis, preprint, under review, 2006 – reference: M. Schellekens, D. Hickey and G. Bollella, ACETT, a Linearly-Compositional Programming Language for (semi-)automated Average-Case analysis, IEEE Real-Time Systems Symposium - Work In Progress Session, 2004 – ident: 10.1016/j.entcs.2008.12.085_bib008 – year: 1993 ident: 10.1016/j.entcs.2008.12.085_bib009 article-title: An introduction to Kolmogorov Complexity and its applications doi: 10.1007/978-1-4757-3860-5 – ident: 10.1016/j.entcs.2008.12.085_bib005 – year: 1973 ident: 10.1016/j.entcs.2008.12.085_bib007 – ident: 10.1016/j.entcs.2008.12.085_bib002 doi: 10.1007/978-0-387-73384-5 – ident: 10.1016/j.entcs.2008.12.085_bib006 – ident: 10.1016/j.entcs.2008.12.085_bib003 – ident: 10.1016/j.entcs.2008.12.085_bib004 – year: 1990 ident: 10.1016/j.entcs.2008.12.085_bib001 |
| SSID | ssj0038176 |
| Score | 1.4861343 |
| Snippet | The author's current research programme is the development of a modular calculus for the average-cost of data structuring. This modular calculus provides a... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 341 |
| SubjectTerms | Algorithms Compositionality Languages Modularity Random Bags |
| Title | A Random Bag Preserving Product Operation |
| URI | https://dx.doi.org/10.1016/j.entcs.2008.12.085 |
| Volume | 225 |
| WOSCitedRecordID | wos000214327700024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1571-0661 dateEnd: 20201231 omitProxy: false ssIdentifier: ssj0038176 issn: 1571-0661 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1571-0661 dateEnd: 20201231 omitProxy: false ssIdentifier: ssj0038176 issn: 1571-0661 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3JTsMwELWgcODCjtiVAxdUghy7qeNjQUUc2MQicYvSiYMokFZtQZz4dsZLmkIRAiQuUWTFceLnjMeT53mE7KDTkUoIqR-lEfVrLMNvDiT1GQMQKq23VGKQPhFnZ9Htrbxwmu19Iycg8jx6fZXdf4UayxBsvXX2F3APb4oFeI6g4xFhx-OPgG9UL5M87TxVD5I7w7DQ1iDXpya3a_W8q3olHEVQvlTDyTsDQ9L6sMcRnPhD1c2Y5f8bQyR9UC5qbYilHyIJ0kQSynXn-BYXaxGFpkbZjOn76osyZ0YZC0cMIa8FI3Mqt5oBY-baRg7a-zi_Qt8SW3Vs1or4fMqDfaVb1Y1qHxfXWXySTDERSs3jO31rFtOvzjhotpQVz1ikmjKkvrGGvnZHRlyM63ky69YGXsNiukAmVL5I5grdDc-Z4SWy2_AsxB5C7JUQew5ibwjxMrk5al4fHvtO8sIHXosGvgolUKBZoGUDGIUgCZVAj61VoyAhoUpoGeIsa4Fmt9SlCoMs4gKiUCUKAuArpJJ3crVKvDTjXKQpl6kJPNCEySCMZCtjQcbwxmuEFW8eg8sHr2VJHuOC-NeOTXdZpdKAxdhda2RvWKlr06F8f3m96NLYjU_rqcU4Ar6ruP7Xihtkphzam6Qy6D2rLTINL4P7fm_bjJR3TkxuXw |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Random+Bag+Preserving+Product+Operation&rft.jtitle=Electronic+notes+in+theoretical+computer+science&rft.au=Schellekens%2C+Michel&rft.date=2009-01-02&rft.pub=Elsevier+B.V&rft.issn=1571-0661&rft.eissn=1571-0661&rft.volume=225&rft.spage=341&rft.epage=360&rft_id=info:doi/10.1016%2Fj.entcs.2008.12.085&rft.externalDocID=S1571066108005483 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1571-0661&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1571-0661&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1571-0661&client=summon |