Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/6258
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Danicic, S | - |
dc.contributor.author | Fox, C | - |
dc.contributor.author | Harman, M | - |
dc.contributor.author | Hierons, RM | - |
dc.contributor.author | Howroyd, J | - |
dc.contributor.author | Laurence, MR | - |
dc.date.accessioned | 2012-02-17T10:25:43Z | - |
dc.date.available | 2012-02-17T10:25:43Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Computer Journal 48(6): 737 - 748, Nov 2005 | en_US |
dc.identifier.issn | 0010-4620 | - |
dc.identifier.uri | http://comjnl.oxfordjournals.org/content/48/6/737.abstract | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/6258 | - |
dc.description | This is the post-print version of the Paper - Copyright @ 2005 Oxford University Press | en_US |
dc.description.abstract | Program slicing is an automated source code extraction technique that has been applied to a number of problems including testing, debugging, maintenance, reverse engineering, program comprehension, reuse and program integration. In all these applications the size of the slice is crucial; the smaller the better. It is known that statement minimal slices are not computable, but the question of dataflow minimal slicing has remained open since Weiser posed it in 1979. This paper proves that static slicing algorithms produce dataflow minimal end slices for programs which can be represented as schemas which are free and liberal. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Oxford University Press | en_US |
dc.title | Static program slicing algorithms are minimal for free liberal program schemas | en_US |
dc.type | Article | en_US |
dc.identifier.doi | http://dx.doi.org/10.1093/comjnl/bxh121 | - |
pubs.organisational-data | /Brunel | - |
pubs.organisational-data | /Brunel/Brunel Active Staff | - |
pubs.organisational-data | /Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths | - |
pubs.organisational-data | /Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths/IS and Computing | - |
pubs.organisational-data | /Brunel/University Research Centres and Groups | - |
pubs.organisational-data | /Brunel/University Research Centres and Groups/School of Information Systems, Computing and Mathematics - URCs and Groups | - |
pubs.organisational-data | /Brunel/University Research Centres and Groups/School of Information Systems, Computing and Mathematics - URCs and Groups/Centre for Information and Knowledge Management | - |
Appears in Collections: | Publications Computer Science Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 340.16 kB | Unknown | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.