|
|
|||||
|
|
![]() |
||||
![]() |
![]() |
||||
|
|
Concerning Efficient Reasoning in Aspect-Oriented Languages
Dr. Gary T. Leavens
Abstract After describing background on aspect-oriented programming and these problems, I will give an overview of various techniques proposed in the literature for solving the problems. Some annotations and static analysis can be helpful in allowing efficient reasoning, by identifying what advice is potentially relevant to a given property. In particular I discuss joint work with Clifton and Noble on concern domains, an effect analysis that uses annotations to efficiently identify potential interference. I discuss some situations in which such knowledge can lead to efficient combination of specifications in some situations. I also discuss future work on problems in weaving specifications. This talk in part describes joint work with Curtis Clifton and James Noble and is based on work described in Clifton's Ph.D. dissertation. That work was supported in part by the US NSF under grant CCF-04-8078. For more details see http://www.cs.iastate.edu/~leavens/modular-aop/.
Short BioGary T. Leavens is a professor of computer science at Iowa State University in Ames, Iowa. He has taught there since receiving his Ph.D. from MIT in 1989. Professor Leavens's research interests include programming and specification language design and semantics, program verification, and formal methods, with an emphasis on the object-oriented and aspect-oriented paradigms. For more information on his research see http://www.cs.iastate.edu/~leavens. Professor Leavens is a Senior member of the ACM and IEEE, and a member of the IFIP working group on programming methodology (WG 2.3). He is an assistant editor for the journal Software and Systems Modeling (SoSyM). He has served on the program committees of numerous conferences, including OOPSLA, Formal Methods, POPL, ECOOP, AOSD, ICSE, ESEC/FSE, and MFPS. He co-organizes three workshop series: Specification and Verification of Component-Based Systems (SAVCBS), Formal Techniques for Java-Like Languages (FTfJP), and Foundations of Aspect-Oriented Languages (FOAL). He is married to Janet Leavens, who is a Ph.D. candidate in French Literature at the University of Iowa.
|
||||
|
|
|
|
|
||