Abstract | ||
---|---|---|
By distinguishing between events and aspects, it is possible to separate the problem of identifying when an aspect should be applied, from what it must do. Observers (aspects that do not affect the state of the base system) are already part of aspect-oriented programming and language support is emerging for events that gather information and announce occurrence. The goal of compositional verification of events and observers is to prove that they are correct so that their guarantees may be used by other events or aspects. Moreover, a compositional verification model allows applying formal verification techniques in smaller models, and also building a library of events, in which for any base system that satisfies certain assumptions, the event detection will satisfy its guarantees. In this work compositional verification of events and observers will be defined to aid in the design of a framework that allows users to verify events, providing as well flexibility in the input language of the specification |
Year | DOI | Venue |
---|---|---|
2011 | 10.1145/1960510.1960512 | FOAL |
Keywords | Field | DocType |
certain assumption,compositional verification model,compositional verification,event detection,language support,formal verification technique,aspect-oriented programming,input language,work compositional verification,base system,aspect oriented programming,satisfiability,formal verification,verification,composition | Functional verification,Programming language,Computer science,Runtime verification,Theoretical computer science,Formal verification | Conference |
Citations | PageRank | References |
4 | 0.48 | 11 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Cynthia Disenfeld | 1 | 21 | 2.54 |
Shmuel Katz | 2 | 1357 | 292.62 |