Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Towards Scalable Compositional Analysis James C. Corbett George S. Avrunin
 

Summary: Towards Scalable Compositional Analysis
James C. Corbett George S. Avrunin
Department of Information and Computer Science Department of Mathematics and Statistics
University of Hawaii at Manoa University of Massachusetts at Amherst
Honolulu, HI 96822 Amherst, MA 01003-4515
corbett @?hawaii.edu avrunin @math. umass .edu
Abstract
Due to the state explosion problem, analysis of large concur-
rent programs will undoubtedly require compositional tech-
niques. Existing compositional techniques are based on the
idea of replacing complex subsystems with simpler processes
with the same interfaces to their environments, and using
the simpler processes to analyze the full system. Most algo-
rithms for proving equivalence between two processes, how-
ever, require enumerating the states of both processes. When
part of a concurrent system consists of many highly coupled
processes, it may not be possible to decompose the system
into components that are both small enough to enumerate
and have simple interfaces with their environments. In such
cases, analysis of the systems by standard methods will be in-

  

Source: Avrunin, George S. - Department of Mathematics and Statistics, University of Massachusetts at Amherst

 

Collections: Mathematics