Distributed Constraint Satisfaction Problem (DSCP) has been proposed as a methodology to frame and analyze coordination in software development. Here, we propose concrete ways to cast rich social and product dependence graphs of software projects into the DSCP framework, suggest how the lack of congruence among these graphs may affect primary software engineering outcomes, and discuss the DSCP machinery that is most likely to provide necessary tools to test these hypotheses.

9 pages

*Avaya Labs Research, Basking Ridge, NJ
**Bosch Corporate Research, Pittsburgh, PA

Return to: SCS Technical Report Collection
School of Computer Science homepage

This page maintained by reports@cs.cmu.edu