Taming Interface Specifications

2005 | Konferenzbeitrag. Eine Publikation mit Affiliation zur Georg-August-Universität Göttingen.

Spring zu: Zitieren & Links | Dokumente & Medien | Details | Versionsgeschichte

Zitiervorschlag

​Taming Interface Specifications​
Margaria, T.; Sistla, A. P.; Steffen, B. & Zuck, L. D.​ (2005)
In:Abadi, Martin​ (Ed.), ​CONCUR 2005 - Concurrency Theory pp. 548​-561. ​16th International Conference on Concurrency Theory​, San Francisco, CA.
Berlin​: Springer. DOI: https://doi.org/10.1007/11539452_41 

Dokumente & Medien

Lizenz

GRO License GRO License

Details

Autor(en)
Margaria, T.; Sistla, A. P.; Steffen, B.; Zuck, L. D.
Herausgeber
Abadi, Martin
Zusammenfassung
Software is often being assembled using third-party components where the developers have little knowledge of, and even less control over, the internals of the components comprising the overall system. One obstacle to composing agents is that current formal methods are mainly concerned with "closed" systems that are built from the ground up. Such systems are fully under the control of the user. Hence, problems arising from ill-specified components can be resolved by a close inspection of the systems. When composing systems using "off-the-shelf" components, this is often no longer the case. The paper addresses the problem of under-specification, where an off-the-shelf component does only what it claims to do, however, it claims more behaviors than it actually has and that one wishes for, some of which may render it useless. Given such an under-specified module, we propose a method to automatically synthesize some safety properties from it that would tame its "bad" behaviors. The advantage of restricting to safety properties is that they are monitorable. The safety properties are derived using an automata-theoretic approach. We show that, when restricting to omega-regular languages, there is no maximal safety property. For this case we construct a sequence of increasingly larger safety properties. We also show how to construct an infinite-state automata that can capture any safety property that is contained in the original specifications.
Erscheinungsdatum
2005
Herausgeber
Springer
Konferenz
16th International Conference on Concurrency Theory
Serie
Lecture Notes in Computer Science 
ISBN
3-540-28309-9
Veranstaltungsort
San Francisco, CA
Veranstaltungsstart
2005-08-23
Veranstaltungsende
2005-08-26
ISSN
0302-9743
Sprache
Englisch

Export Metadaten

Referenzen

Zitationen


Social Media