Aspect validation using model checking

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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 super-imposition validation. A case study that monitors and checks an underlying bounded buffer program is presented. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Katz, S., & Sihman, M. (2004). Aspect validation using model checking. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2772, 373–394. https://doi.org/10.1007/978-3-540-39910-0_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free