Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debuggingeffort by focusing the attention of the user on a relevantsubset of program statements. Recently algorithms forforward computation of dynamic slices have beenproposed which maintain dynamic slices of all variables asthe program executes. An...
Gespeichert in:
| Veröffentlicht in: | International Conference on Software Engineering: Proceedings of the 26th International Conference on Software Engineering; 23-28 May 2004 S. 502 - 511 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
Washington, DC, USA
IEEE Computer Society
23.05.2004
|
| Schriftenreihe: | ACM Conferences |
| Schlagworte: |
Software and its engineering
> Software creation and management
> Software verification and validation
> Process validation
> Traceability
|
| ISBN: | 9780769521633, 0769521630 |
| ISSN: | 0270-5257 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Dynamic slicing algorithms can greatly reduce the debuggingeffort by focusing the attention of the user on a relevantsubset of program statements. Recently algorithms forforward computation of dynamic slices have beenproposed which maintain dynamic slices of all variables asthe program executes. An advantage of this approach is thatwhen a request for a slice is made, it is already available.The main disadvantage of using such an algorithm for slicingrealistic programs is that the space and time requiredto maintain a large set of dynamic slices corresponding toall program variables can be very high. In this paper weanalyze the characteristics of dynamic slices and identifyproperties that enable space efficient representation of a setof dynamic slices. We show that by using reduced orderedbinary decision diagrams (roBDDs) to represent a set ofdynamic slices, the space and time requirements of maintainingdynamic slices are greatly reduced. In fact not onlycan the latest dynamic slices of all variables be easilymaintained, but rather all dynamic slices of all variablesthroughout a programýs execution can be maintained. Ourexperiments show that our roBDD based algorithm for forwardcomputation of dynamic slices can maintain 107-217million dynamic slices arising during long program runs usingonly 28-392 megabytes of storage. In addition, the performanceof the roBDD based forward computation methodcompares favorably with the performance of the LP backwardcomputation algorithm. |
|---|---|
| AbstractList | Dynamic slicing algorithms can greatly reduce the debuggingeffort by focusing the attention of the user on a relevantsubset of program statements. Recently algorithms forforward computation of dynamic slices have beenproposed which maintain dynamic slices of all variables asthe program executes. An advantage of this approach is thatwhen a request for a slice is made, it is already available.The main disadvantage of using such an algorithm for slicingrealistic programs is that the space and time requiredto maintain a large set of dynamic slices corresponding toall program variables can be very high. In this paper weanalyze the characteristics of dynamic slices and identifyproperties that enable space efficient representation of a setof dynamic slices. We show that by using reduced orderedbinary decision diagrams (roBDDs) to represent a set ofdynamic slices, the space and time requirements of maintainingdynamic slices are greatly reduced. In fact not onlycan the latest dynamic slices of all variables be easilymaintained, but rather all dynamic slices of all variablesthroughout a programýs execution can be maintained. Ourexperiments show that our roBDD based algorithm for forwardcomputation of dynamic slices can maintain 107-217million dynamic slices arising during long program runs usingonly 28-392 megabytes of storage. In addition, the performanceof the roBDD based forward computation methodcompares favorably with the performance of the LP backwardcomputation algorithm. Dynamic slicing algorithms can greatly reduce the debuggingeffort by focusing the attention of the user on a relevantsubset of program statements. Recently algorithms forforward computation of dynamic slices have beenproposed which maintain dynamic slices of all variables asthe program executes. An advantage of this approach is thatwhen a request for a slice is made, it is already available.The main disadvantage of using such an algorithm for slicingrealistic programs is that the space and time requiredto maintain a large set of dynamic slices corresponding toall program variables can be very high. In this paper weanalyze the characteristics of dynamic slices and identifyproperties that enable space efficient representation of a setof dynamic slices. We show that by using reduced orderedbinary decision diagrams (roBDDs) to represent a set ofdynamic slices, the space and time requirements of maintainingdynamic slices are greatly reduced. In fact not onlycan the latest dynamic slices of all variables be easilymaintained, but rather all dynamic slices of all variablesthroughout a programys execution can be maintained. Ourexperiments show that our roBDD based algorithm for forwardcomputation of dynamic slices can maintain 107-217million dynamic slices arising during long program runs usingonly 28-392 megabytes of storage. In addition, the performanceof the roBDD based forward computation methodcompares favorably with the performance of the LP backwardcomputation algorithm. |
| Author | Zhang, Xiangyu Gupta, Rajiv Zhang, Youtao |
| Author_xml | – sequence: 1 givenname: Xiangyu surname: Zhang fullname: Zhang, Xiangyu organization: University of Arizona – sequence: 2 givenname: Rajiv surname: Gupta fullname: Gupta, Rajiv organization: University of Arizona – sequence: 3 givenname: Youtao surname: Zhang fullname: Zhang, Youtao organization: University of Texas at Dallas |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17809636$$DView record in Pascal Francis |
| BookMark | eNqNkDlPAzEQRi0BEldKejdQEbDX8VVCwiUhIXG0WN5ZGxl27WBvhPLvMQoSLdN8zZtPM28fbccUHUJHlJzxOudaKyH5mdZ6xmdbaKKlIlJo3lDB2DbaI40kU95wuYsmpbyTOpxIougeer3yPkBwccTXKX_Z3OF5Gpar0Y4hRZw8XqyjHQLgpz6AK_ilhPiGH123Atfhh9y5XPMyRJvXeOEglJ-9RbBv2Q7lEO142xc3-c0D9HJ99Ty_nd4_3NzNL-6nlmo5ThVY1fgGFCWt9KoDzuyMUS9a3UrOgXgAplvlGTjBdCNlBaFhSinuHVh2gE42vcucPleujGYIBVzf2-jSqhhGqeCC6Aoe_4K2gO19trGebJY5DPUBQ6s5LZj4K7QwmDalj2IoMT-2zca22diu4Om_QNPm4Dz7BtUHf4s |
| ContentType | Conference Proceeding |
| Copyright | 2006 INIST-CNRS |
| Copyright_xml | – notice: 2006 INIST-CNRS |
| DBID | IQODW 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.5555/998675.999454 |
| DatabaseName | Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Computer Science |
| EndPage | 511 |
| ExternalDocumentID | 17809636 |
| Genre | Conference Paper |
| GroupedDBID | 6IE 6IH 6IK 6IL AAJGR AAVQY ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI LHSKQ OCL RIB RIC RIE RIL RIO AAWTH IQODW -~X 123 23M 29O 5VS 6IM 6IN 7SC 8FD 8US ADZIZ AFFNX AVWKF CHZPO FEDTE I07 IPLJI JQ2 L7M L~C L~D M43 RNS |
| ID | FETCH-LOGICAL-a197t-8ca82f2c810b7f8dc53a431f6b9b755c0fcc39b8f3ce63927710bc238885feca3 |
| ISBN | 9780769521633 0769521630 |
| ISSN | 0270-5257 |
| IngestDate | Fri Sep 05 06:26:02 EDT 2025 Thu Dec 26 02:24:22 EST 2024 Sun Dec 01 06:31:06 EST 2024 Wed Jan 31 06:51:48 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | Binary decision diagram Dynamic characteristic Software development Program execution Debugging Dynamic properties Slicing Reduced order systems |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | OpenURL |
| MeetingName | ICSE04: 26th International Conference on Software Engineering |
| MergedId | FETCHMERGED-LOGICAL-a197t-8ca82f2c810b7f8dc53a431f6b9b755c0fcc39b8f3ce63927710bc238885feca3 |
| Notes | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25 |
| PQID | 31165609 |
| PQPubID | 23500 |
| PageCount | 10 |
| ParticipantIDs | pascalfrancis_primary_17809636 acm_books_10_5555_998675_999454 proquest_miscellaneous_31165609 acm_books_10_5555_998675_999454_brief |
| PublicationCentury | 2000 |
| PublicationDate | 20040523 2004 |
| PublicationDateYYYYMMDD | 2004-05-23 2004-01-01 |
| PublicationDate_xml | – month: 05 year: 2004 text: 20040523 day: 23 |
| PublicationDecade | 2000 |
| PublicationPlace | Washington, DC, USA |
| PublicationPlace_xml | – name: Washington, DC, USA – name: Los Alamitos CA |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | International Conference on Software Engineering: Proceedings of the 26th International Conference on Software Engineering; 23-28 May 2004 |
| PublicationYear | 2004 |
| Publisher | IEEE Computer Society |
| Publisher_xml | – name: IEEE Computer Society |
| SSID | ssj0000507081 ssj0006499 |
| Score | 1.81564 |
| Snippet | Dynamic slicing algorithms can greatly reduce the debuggingeffort by focusing the attention of the user on a relevantsubset of program statements. Recently... |
| SourceID | proquest pascalfrancis acm |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 502 |
| SubjectTerms | Applied computing -- Physical sciences and engineering -- Mathematics and statistics Applied sciences Computer science; control theory; systems Exact sciences and technology Mathematics of computing -- Discrete mathematics Software Software and its engineering -- Software creation and management -- Software verification and validation -- Process validation -- Traceability Software and its engineering -- Software creation and management -- Software verification and validation -- Software defect analysis -- Software testing and debugging Software engineering Theory of computation -- Models of computation -- Abstract machines |
| Title | Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams |
| URI | https://www.proquest.com/docview/31165609 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1JbxMxFLbSigMntiLCUnwALqMBZzZ7rqWJOJS0oqmUE5bHM4agMhOy0fxO_hDvjWdLi1T1QA6jaORMPH6fnz8_v4WQN0CCTQbM182YZ9xAewM3CWLmpkprkUUatiy22AQfj8V0Gp_1en_qWJjNJc9zcXUVz_-rqOEeCBtDZ-8g7uahcAO-g9DhCmKH6zVG_M_FZ9fE1wb04anAOejc3-jq1clCiCaBs-ZBy9pnwItW3527P-vI8XzXE85ntS2TFXYROSyzVaDvwahYoLOuY0tKNKT1eJsrdNU_v0Tt5Vhvhi-YWxZY8emiLCvqHNkA4uOqNhDobIUOZs3WoLGATwH437brxsFoPa-Isvox29xoDVpvpYodG0iAx_c2TLnZCjMexUBFIt_vaFCPMxfTvXY0dMi8zmIfWk1_fR0J4YOuI7GA_dR74NCBzXS9m697fCpHFycncjKcTt7Nf7lYygyP_Ku6Lntkj3NmQwobsx8D_s1E64UUBWWJ06an1rJk36RKSda-mc0Ri537sNM1ZFb6J7r1qiXMbGNLstxgFyVlmjwkBy1eaAuwR6SX5Y_Jg7qaCK0Wlyfka4MPWuGDdvBBC0MrfFCLD1rig1b4oBU-qMUHrfFBa3wckIvRcPLxk1tV_3DVIOYrV2glPONpMWAJNyLVoa-A7ZooiRMehpoZrf04EcbXGdBsjwNXTjQwUCFCk2nlPyX7eZFnzwjF8tpCCR2IKA1YomL4EVMqNTyFHX2a9slrGD-Jk3gpYVeMIyztCEs7wn3y9pYWMlnMMtMnhzsykHObM0YOQI6w1kXwV7VQJChyPJ1TeVasl9K3ibDi57e2eEHut5PgJdlfLdbZK3JPb1az5eKwxNtftM23-w |
| linkProvider | IEEE |
| 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%3Abook&rft.genre=proceeding&rft.title=International+Conference+on+Software+Engineering%3A+Proceedings+of+the+26th+International+Conference+on+Software+Engineering%3B+23-28+May+2004&rft.atitle=Efficient+Forward+Computation+of+Dynamic+Slices+Using+Reduced+Ordered+Binary+Decision+Diagrams&rft.au=Zhang%2C+Xiangyu&rft.au=Gupta%2C+Rajiv&rft.au=Zhang%2C+Youtao&rft.date=2004-05-23&rft.isbn=9780769521633&rft.issn=0270-5257&rft.spage=502&rft.epage=511&rft_id=info:doi/10.5555%2F998675.999454&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0270-5257&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0270-5257&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0270-5257&client=summon |