Refining Concurrent Objects. Büchi, M. & Sekerinski, E. Technical Report 298, Turku Centre for Computer Science, August, 1999. Paper abstract bibtex We study the notion of class refinement in a concurrent object-oriented setting. Classes, defining attributes and methods, serve as templates for creating objects. For expressing concurrency, actions are added to classes and methods with guards are considered. A class can be defined by inheriting from a given class. Class refinement is defined to support algorithmic refinement, data refinement, and atomicity refinement. Behavioral class refinement is defined in terms of trace refinement of action systems. A simulation-based proof rule for class refinement using a refinement relation is given. The special case of atomicity refinement by early returns is considered. The use of the class refinement rule is illustrated by examples.
@techreport{BuchiSekerinski99RefiningConcurrentObjects,
type = {{TUCS} {Technical} {Report}},
title = {Refining {Concurrent} {Objects}},
url = {http://tucs.fi/publications/view/?pub_id=tBuSe99a},
abstract = {We study the notion of class refinement in a concurrent object-oriented setting. Classes, defining attributes and methods, serve as templates for creating objects. For expressing concurrency, actions are added to classes and methods with guards are considered. A class can be defined by inheriting from a given class. Class refinement is defined to support algorithmic refinement, data refinement, and atomicity refinement. Behavioral class refinement is defined in terms of trace refinement of action systems. A simulation-based proof rule for class refinement using a refinement relation is given. The special case of atomicity refinement by early returns is considered. The use of the class refinement rule is illustrated by examples.},
number = {298},
institution = {Turku Centre for Computer Science},
author = {Büchi, Martin and Sekerinski, Emil},
month = aug,
year = {1999},
keywords = {ISBN 952-12-0509-1 ISSN 1239-1891},
pages = {28},
}
Downloads: 0
{"_id":"xSncqfS3ifQLrWfKg","bibbaseid":"bchi-sekerinski-refiningconcurrentobjects-1999","author_short":["Büchi, M.","Sekerinski, E."],"bibdata":{"bibtype":"techreport","type":"TUCS Technical Report","title":"Refining Concurrent Objects","url":"http://tucs.fi/publications/view/?pub_id=tBuSe99a","abstract":"We study the notion of class refinement in a concurrent object-oriented setting. Classes, defining attributes and methods, serve as templates for creating objects. For expressing concurrency, actions are added to classes and methods with guards are considered. A class can be defined by inheriting from a given class. Class refinement is defined to support algorithmic refinement, data refinement, and atomicity refinement. Behavioral class refinement is defined in terms of trace refinement of action systems. A simulation-based proof rule for class refinement using a refinement relation is given. The special case of atomicity refinement by early returns is considered. The use of the class refinement rule is illustrated by examples.","number":"298","institution":"Turku Centre for Computer Science","author":[{"propositions":[],"lastnames":["Büchi"],"firstnames":["Martin"],"suffixes":[]},{"propositions":[],"lastnames":["Sekerinski"],"firstnames":["Emil"],"suffixes":[]}],"month":"August","year":"1999","keywords":"ISBN 952-12-0509-1 ISSN 1239-1891","pages":"28","bibtex":"@techreport{BuchiSekerinski99RefiningConcurrentObjects,\n\ttype = {{TUCS} {Technical} {Report}},\n\ttitle = {Refining {Concurrent} {Objects}},\n\turl = {http://tucs.fi/publications/view/?pub_id=tBuSe99a},\n\tabstract = {We study the notion of class refinement in a concurrent object-oriented setting. Classes, defining attributes and methods, serve as templates for creating objects. For expressing concurrency, actions are added to classes and methods with guards are considered. A class can be defined by inheriting from a given class. Class refinement is defined to support algorithmic refinement, data refinement, and atomicity refinement. Behavioral class refinement is defined in terms of trace refinement of action systems. A simulation-based proof rule for class refinement using a refinement relation is given. The special case of atomicity refinement by early returns is considered. The use of the class refinement rule is illustrated by examples.},\n\tnumber = {298},\n\tinstitution = {Turku Centre for Computer Science},\n\tauthor = {Büchi, Martin and Sekerinski, Emil},\n\tmonth = aug,\n\tyear = {1999},\n\tkeywords = {ISBN 952-12-0509-1 ISSN 1239-1891},\n\tpages = {28},\n}\n\n","author_short":["Büchi, M.","Sekerinski, E."],"key":"BuchiSekerinski99RefiningConcurrentObjects","id":"BuchiSekerinski99RefiningConcurrentObjects","bibbaseid":"bchi-sekerinski-refiningconcurrentobjects-1999","role":"author","urls":{"Paper":"http://tucs.fi/publications/view/?pub_id=tBuSe99a"},"keyword":["ISBN 952-12-0509-1 ISSN 1239-1891"],"metadata":{"authorlinks":{}}},"bibtype":"techreport","biburl":"https://api.krunk.cn/emil/bib.php","dataSources":["HEdahWqKBpmSGmDwq","MF5eGzpJnqf6bSAoG","ienufKdnmJs49AsjR","So4gmSWFmbQRNEuFs","ezsmw4w22u9JFLNYJ","CvQYP6Tmpapx74Mgr","RWydLHbBJqgdeh5jr"],"keywords":["isbn 952-12-0509-1 issn 1239-1891"],"search_terms":["refining","concurrent","objects","büchi","sekerinski"],"title":"Refining Concurrent Objects","year":1999}