J.C. Corbett and G.S. Avrunin. Towards scalable compositional analysis. Software Engineering Notes, 19(5):53--61, December 1994. Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering. 43  Home/Search   Document Details and Download   Summary   Related Articles   Check

....development methods has shaped compiler analysis research to consider partial systems, for example as inter procedural flow analyses. Those same needs are beginning to shape the more general analyses targeted at software verification and validation. Work on compositional analysis, e.g. YY91, CA94, CK95, CK96] has, of necessity, dealt with the question of analyzing sub systems. These techniques have the luxury of embedding such sub system analyses in the context of a whole program analysis. In this setting specification of the behavior expected at a sub systems interface can be ....

J.C. Corbett and G.S. Avrunin. Towards scalable compositional analysis. Software Engineering Notes, 19(5):53--61, December 1994. Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering.

....to be integrated with those analyses. For example, FLAVERS could be used to verify a sub system implementation with respect to a finite state interface specifications and that specification could be incorporated into higher levels of compositional reachability analysis. As Corbett and Avrunin [CA94] have pointed out there exist sub systems for which no decomposition will provide a low cost compositional reachability analysis; for those types of systems an alternative approach like FLAVERS may be more effective. An integrated approach to analysis has the potential to exploit the strengths ....

J.C. Corbett and G.S. Avrunin. Towards scalable compositional analysis. Software Engineering Notes, 19(5):53--61, December 1994. Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering.

....tasks; thus, it is scalable in the number of client tasks. In the program, readers only attempt to read and writers only attempt to write the shared data; the data server, however, can support clients that both read and write. Our code differs slightly from the examples that others have analyzed [CA94] in that we include explicit program termination code; the controller will only shutdown when there are no active readers or writers. Unlike many of the other example programs that we looked at, such as the protocol and dining philosopher programs, the global state of a readers writers program is ....

....The operator interacts with the pumps by enabling them to pump gas after payment has been received and by getting information about how much gas was pumped. The clients, or customers, pay for gas, pump it, and get their change. Our code differs slightly from the examples that others have analyzed [CA94] in that we include explicit program termination code; the operator will shutdown when there are no active customers and after it has successfully turned the pump off. We check a property related to exclusive access to a pump. From a black box perspective this is a potentially interesting ....

[Article contains additional citation context not shown here]

J.C. Corbett and G.S. Avrunin. Towards scalable compositional analysis. Software Engineering Notes, 19(5):53--61, December 1994. Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering.

....decompose a program into subsystems, analyze the subsystems in isolation, then recombine subsystem analysis results to infer properties of the whole program. Compositional variants of state reachability analyses, e.g. 20, 4] model checking, e.g. 5] and integer necessary conditions analysis [7] have all been shown to provide lower cost analysis than their noncompositional counterparts for selected systems. The work described in this paper contributes another analysis technique that could be applied as part of a compositional analysis although our focus is on analyzing modules in ....

J. Corbett and G. Avrunin. Towards scalable compositional analysis. Software Engineering Notes, 19(5):53--61, Dec. 1994. Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering.

....with the system and property being veri ed, but that INCA frequently performs as well as, or better than, such tools as SPIN and SMV. The INCA approach has also been extended to check timing properties of real time systems [1,6] and to prove trace equivalence of certain classes of systems [7]. 2.2 Sources of Imprecision The systems of equations and inequalities generated by INCA represent necessary conditions for there to be a violation of the property being veri ed. As noted earlier, however, they only represent necessary, not sucient, conditions. A solution of the system of ....

J. C. Corbett and G. S. Avrunin. Towards scalable compositional analysis. In D. Wile, editor, Proceedings of the Second ACM SIGSOFT Symposium on Foundations of Software Engineering, pages 53-61, New Orleans, Dec. 1994. ACM Press (Proceedings appeared in Software Engineering Notes, 19(5)).

No context found.

J.C. Corbett and G.S. Avrunin. Towards scalable compositional analysis. Software Engineering Notes, 19(5):53--61, December 1994. Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering. 43

No context found.

J.C. Corbett and G.S. Avrunin. Towards scalable compositional analysis. Software Engineering Notes, 19(5):53--61, December 1994. Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering.

No context found.

J. C. Corbett and G. S. Avrunin. Towards scalable compositional analysis. In Proceedings of the Second ACM SIGSOFT Symposium on Foundations of Software Engineering., pages 53--61, New Orleans, Louisiana, USA, December 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC