Name
Abstract | ||
|---|---|---|
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined with a basic program. We assume that both the basic program and the collection of aspects have their own specifications. The Bandera tool for Java programs is used to generate input for model checkers, although any similar tool could be employed. New verification aspects and superimpositions are defined to modularize the proofs, and separate the proof-related code from the program and the aspects. This allows generating and activating a series of model checking tasks automatically each time a superimposition is applied to a, basic program, achieving superimposition validation. A case study that monitors and checks an underlying bounded buffer program is presented. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-39910-0_18 | LECTURE NOTES IN COMPUTER SCIENCE |
Keywords | Field | DocType |
model checking | Programming language,Model checking,Superimposition,Aspect-oriented programming,Java program,Computer science,Mathematical proof,Java,Bounded function,Time response | Conference |
Volume | ISSN | Citations |
2772 | 0302-9743 | 15 |
PageRank | References | Authors |
0.95 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shmuel Katz | 1 | 1357 | 292.62 |
| Marcelo Sihman | 2 | 65 | 4.87 |