Proving Properties for Behavioural Specifications with Term Observation

dc.creatorBerregeb,Narjes
dc.date2006
dc.date.accessioned2024-02-06T12:54:48Z
dc.date.available2024-02-06T12:54:48Z
dc.descriptionBehavioural specifications allow to focus only on the"observable" behaviour of objects. These observations are made through "observable contexts" which are particular terms with a hole to be filled in with an object. We consider behavioural specifications based on the observation of a specified set of linear terms. The set of observable contexts is often infinite; therefore, we give an algorithm for computing some special contexts that we call "covering contexts", and show that they are sufficient for proving that two terms are behaviourally equal.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-012-10-1413
dc.identifierhttps://lib.jucs.org/article/28689/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/9171
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 12(10): 1413-1425
dc.subjectbehavioural specifications
dc.subjectterm observation
dc.subjectobservable contexts
dc.subjectcovering contexts
dc.titleProving Properties for Behavioural Specifications with Term Observation
dc.typeResearch Article
Файлы
Коллекции