Sciweavers

556 search results - page 7 / 112
» Pair Programming: Not for Everyone
Sort
View
IJMMS
2008
90views more  IJMMS 2008»
13 years 7 months ago
Pair programming and the mysterious role of the navigator
Computer programming is generally understood to be highly challenging and since its inception a wide range of approaches, tools and methodologies have been developed to assist in ...
Sallyann Bryant, Pablo Romero, Benedict du Boulay
LOPSTR
2004
Springer
14 years 1 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
AGILEDC
2004
IEEE
13 years 11 months ago
An Initial Exploration of the Relationship Between Pair Programming and Brooks' Law
Through his law, "adding manpower to a late software project makes it later," Brooks asserts that the assimilation, training, and intercommunication costs of adding new ...
Laurie A. Williams, Anuja Shukla, Annie I. Ant&oac...
XPU
2010
Springer
13 years 6 months ago
Towards Understanding Communication Structure in Pair Programming
Pair Programming has often been reported to be beneficial in software projects. To better understand where these benefits come from we evaluate the aspect of intra-pair communica...
Kai Stapel, Eric Knauss, Kurt Schneider, Matthias ...
FLOPS
2004
Springer
14 years 1 months ago
Set-Sharing Is Not Always Redundant for Pair-Sharing
Sharing among program variables is vital information when analyzing logic programs. This information is often expressed either as sets or as pairs of program variables that (may) s...
Francisco Bueno, Maria J. García de la Band...