K. Aberer, A. Datta, and M. Hauswirth, Multifaceted Simultaneous Load Balancing in DHT-Based P2P Systems: A New Game with Old Balls and Bins, Self-star Properties in Complex Information Systems, pp.373-391, 2005.
DOI : 10.1007/11428589_24

K. Aida, W. Natsume, and Y. Futakata, Distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings., pp.156-163, 2003.
DOI : 10.1109/CCGRID.2003.1199364

P. David and . Anderson, Boinc: A system for public-resource computing and storage, Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing, pp.4-10, 2004.

W. Appelbe and A. P. Ravn, Encapsulation constructs in systems programming languages, ACM Transactions on Programming Languages and Systems, vol.6, issue.2, pp.129-158, 1984.
DOI : 10.1145/2993.69615

I. Attali, D. Caromel, and R. Guider, A Step Toward Automatic Distribution of Java Programs, Proceedings of 2nd Formal Methods for Open Object-based Distributed Systems, pp.141-161, 2000.
DOI : 10.1145/960112.28730

M. Backschat, A. Pfaffinger, and C. Zenger, Economic-based dynamic load distribution in large workstation networks, Euro-Par '96 Parallel Processing , Second International Euro-Par Conference Proceedings, Volume II, pp.631-634, 1996.
DOI : 10.1007/BFb0024758

L. Baduel, F. Baude, and D. Caromel, Object-oriented SPMD, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005., pp.9-12, 2005.
DOI : 10.1109/CCGRID.2005.1558647

A. Barabasi and R. Albert, Emergence of scaling in random networks, Science, vol.286, pp.509-512, 1999.

F. Baude, D. Caromel, F. Huet, L. Mestre, and J. Vayssì-ere, Interactive and descriptor-based deployment of object-oriented grid applications, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing, pp.93-102, 2002.
DOI : 10.1109/HPDC.2002.1029907

F. Baude, D. Caromel, F. Huet, and J. Ere, Communicating Mobile Active Objects in Java, Proceedings of the 8th International Conference on High Performance Computing and Networking Europe, pp.633-643, 2000.
DOI : 10.1007/3-540-45492-6_79

A. Michael, M. O. Bender, and . Rabin, Scheduling cilk multithreaded parallel programs on processors of different speeds, SPAA '00: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures, pp.13-21, 2000.

P. Berenbrink, T. Friedetzky, and L. A. Goldberg, The natural workstealing algorithm is stable, IEEE Symposium on Foundations of Computer Science, pp.178-187, 2001.

F. Berman, G. Fox, and A. J. Hey, Grid Computing: Making the Global Infrastructure a Reality, 2003.
DOI : 10.1002/0470867167

R. D. Blumofe, Managing storage for multithreaded computations Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1992.

R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall et al., Cilk: an efficient multithreaded runtime system, PPOPP '95: Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp.207-216, 1995.
DOI : 10.1006/jpdc.1996.0107

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.3175

D. Robert, C. E. Blumofe, and . Leiserson, Scheduling multithreaded computations by work stealing, Journal of the ACM, vol.46, issue.5, pp.720-748, 1999.

G. Daniel, R. P. Bobrow, J. L. Gabriel, and . White, CLOS in context: the shape of the design space [20] Shahid H. Bokhari. A shortest tree algorithm for optimal assignments across space and time in a distributed processor system, IEEE Transactions on Software Engineering, vol.7, issue.6, pp.29-61583, 1981.

G. Booch, Object-oriented analysis and design with applications

J. Luis-bosque-orero, M. Gil, and L. Pastor, Dynamic load balancing in heterogeneous clusters, Proceedings of IASTED International Conference on Parallel and Distributed Computing and Networks, 2004.

J. Bustos-jiménez, Robin hood: An active objects load balancing mechanism, for intranet, Proceedings of Workshop de Sistemas Distribuidos y Paralelismo, Chile, 2003.

J. Bustos-jiménez, D. Caromel, A. Di-costanzo, M. Leyton, and J. M. Piquer, Balancing Active Objects on a Peer to Peer Infrastructure, XXV International Conference of the Chilean Computer Science Society (SCCC'05), pp.109-115, 2005.
DOI : 10.1109/SCCC.2005.1587872

J. Bustos-jiménez, D. Caromel, A. Iosup, M. Leyton, and . Piquer, The rocking chair and the grid: Balancing load across project grids, Integrated Research in Grid Computing, CoreGrid Integration Workshop, pp.117-128, 2006.

J. Bustos-jiménez, D. Caromel, M. Leyton, and . Piquer, Coupling contracts for deployment on alien grids Lecture Notes in Computer Science, CoreGRID Workshop on Grid Middleware (in conjunction with EuroPar), 2006.

J. Bustos-jiménez, D. Caromel, M. Leyton, and . Piquer, Load information sharing policies in communication-intensive parallel applications, ISSADS, Lecture Notes in Computer Science, 2006.

J. Bustos-jiménez, D. Caromel, and . Piquer, Load Balancing: Toward the Infinite Network and Beyond, Proceedings of 12th Workshop on Job Scheduling Strategies for Parallel Processing, pp.176-191, 2006.
DOI : 10.1007/978-3-540-71035-6_9

D. Caromel, A general model for concurrent and distributed object-oriented programming, Proceedings of the 1988 ACM SIGPLAN workshop on Object-based concurrent programming, pp.102-104, 1989.

D. Caromel, Service, asynchrony, and wait-by-necessity, Journal of Object- Oriented Programming, vol.2, issue.4, pp.12-22, 1989.

D. Caromel, Toward a method of object-oriented concurrent programming, Communications of the ACM, vol.36, issue.9, pp.90-102, 1993.
DOI : 10.1145/162685.162711

D. Caromel, F. Belloncle, and Y. Roudier, The C++// Language, Parallel Programming using C++, pp.257-296, 1996.

D. Caromel and L. Henrio, A Theory of Distributed Objects, 2005.

D. Caromel, L. Henrio, and B. Serpette, Asynchronous and Deterministic Objects, Proceedings of the 31st ACM Symposium on Principles of Programming Languages, pp.123-134, 2004.
DOI : 10.1145/982962.964012

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.9095

T. Casavant and J. Kuhl, Effects of response and stability on scheduling in distributed computing systems, IEEE Transactions on Software Engineering, vol.14, issue.11, pp.1578-1588, 1988.
DOI : 10.1109/32.9046

T. Casavant and J. Kuhl, A taxonomy of scheduling in general-purpose distributed computing systems, IEEE Transactions on Software Engineering, vol.14, issue.2, pp.141-154, 1988.
DOI : 10.1109/32.4634

S. Chapin, D. Katramatos, J. Karpovich, and A. Grimshaw, The Legion Resource Management System, Job Scheduling Strategies for Parallel Processing, pp.162-178, 1999.
DOI : 10.1007/3-540-47954-6_9

F. Chung and L. Lu, The Average Distance in a Random Graph with Given Expected Degrees, Internet Mathematics, vol.1, issue.1, pp.91-113, 2005.
DOI : 10.1080/15427951.2004.10129081

G. Combs, Ethereal: The world's most popular network protocol analyzer

K. Czarnecki and U. Eisenecker, Generative Programming, 2000.
DOI : 10.1007/3-540-36208-8_2

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.6297

O. Dalle, Techniques et Outils pour les communicatios et la répartition dynamique de charge dans les réseaux de stations de travail, 1999.

P. Dasgupta, J. J. Richard, M. Leblanc, U. Ahamad, and . Ramachandran, The Clouds distributed operating system, Computer, vol.24, issue.11, pp.34-44, 1991.
DOI : 10.1109/2.116849

A. Di and C. , Modèle et infrastructure de programmation pair-` a-pair, 2004.

R. Diestel, G. Graph-theory-dobber, R. D. Koole, and . Van-der-mei, Dynamic load balancing for a grid application, High Performance Computing -HiPC, pp.342-352, 2000.

P. Domingues, P. Marques, and L. Silva, Resource Usage of Windows Computer Laboratories, 2005 International Conference on Parallel Processing Workshops (ICPPW'05), pp.469-476, 2005.
DOI : 10.1109/ICPPW.2005.77

L. Santos, Load distribution: a survey, 1996.

P. Erd?-os and A. Rényi, On random graphs I, Publ. Mathematica, vol.6, pp.290-297, 1959.

P. Erd?-os and A. Rényi, On the evolution of random graphs, Publ. Mathematica . Inst. Hungar. Acad. Sci, vol.5, pp.17-61, 1960.

M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the Internet topology, ACM SIGCOMM Computer Communication Review, vol.29, issue.4, pp.251-262, 1999.
DOI : 10.1145/316194.316229

D. Fensel and C. Bussler, The Web Service Modeling Framework WSMF, Electronic Commerce Research and Applications, pp.113-137, 2002.
DOI : 10.1016/S1567-4223(02)00015-7

J. Ferber, Computational reflection in class based object-oriented languages Conference proceedings on Object-oriented programming systems , languages and applications, OOPSLA '89, pp.317-326, 1989.

D. Ferrari and S. Zhou, An empirical investigation of load indices for load balancing applications, Performance '87: Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation, pp.515-528, 1988.

M. Flynn, Some Computer Organizations and Their Effectiveness, IEEE Transactions on Computers, vol.21, issue.9, pp.948-960, 1972.
DOI : 10.1109/TC.1972.5009071

I. Foster, What is the grid? -a three point checklist, GRIDtoday, vol.1, issue.6, 2002.

I. Foster and C. Kesselman, Computational grids In The Grid: blueprint for a new computing infrastructure, pp.15-51, 1999.

I. Foster, C. Kesselman, and S. Tuecke, The Anatomy of the Grid: Enabling Scalable Virtual Organizations, International Journal of High Performance Computing Applications, vol.15, issue.3, pp.200-222, 2001.
DOI : 10.1177/109434200101500302

J. Frey, T. Tannenbaum, M. Livny, I. Foster, and S. Tuecke, Condor-G: a computation management agent for multi-institutional grids, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing, pp.237-246, 2002.
DOI : 10.1109/HPDC.2001.945176

M. Frigo, C. E. Leiserson, and K. H. Randall, The implementation of the Cilk-5 multithreaded language, PLDI '98: Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, pp.212-223, 1998.

T. El, Allocation dynamique de processus dans les systèmes distribués et paralì eles : ´ etat de l´art, 1995.

E. Gilbert, Random Graphs, The Annals of Mathematical Statistics, vol.30, issue.4, pp.1141-1144, 1959.
DOI : 10.1214/aoms/1177706098

A. Grimshaw, W. Wulf, J. French, A. Weaver, and P. R. Jr, Legion, Proceedings of the 7th workshop on ACM SIGOPS European workshop Systems support for worldwide applications, EW 7, 1994.
DOI : 10.1145/504450.504487

E. Heymann, M. A. Senar, E. Luque, and M. Livny, Adaptive Scheduling for Master-Worker Applications on the Computational Grid, GRID, pp.214-227, 1971.
DOI : 10.1007/3-540-44444-0_20

F. Huet, Objets mobiles : conception d´un middleware etévaluationet´etévaluation de la communication, 2002.

F. Huet, D. Caromel, and H. Bal, A High Performance Java Middleware with a Real Application, Proceedings of the ACM/IEEE SC2004 Conference, pp.2-17, 2004.
DOI : 10.1109/SC.2004.4

B. Huffaker, M. Fomenkov, D. Plummer, D. Moore, and K. Claffy, Distance metrics in the internet, 2002.

S. Ichikawa, Mathematical programming approach for static load balancing of parallel PDE solver, Proceedings of the 16th IASTED International Conference on Applied Informatics, 1998.

A. Iosup, C. Dumitrescu, D. Epema, H. Li, and L. Wolters, An analysis of four long-term grid traces, 2006.

A. Iosup, P. Garbacki, J. Pouwelse, and D. Epema, Correlating topology and path characteristics of overlay networks and the internet Realistic modeling and synthesis of resources for computational grids, CCGRID '06: Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid Proceedings of the ACM/IEEE conference on Supercomputing (SC), pp.10-18, 2004.

G. Kiczales and J. D. Rivieres, The Art of the Metaobject Protocol, 1991.

J. M. Kleinberg, The small-world phenomenon, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.163-170, 2000.
DOI : 10.1145/335305.335325

J. Kleinoder and M. Golm, MetaJava: an efficient run-time meta architecture for Java/sup TM/, Proceedings of the Fifth International Workshop on Object-Orientation in Operation Systems, pp.54-61, 1996.
DOI : 10.1109/IWOOOS.1996.557866

D. Kondo, M. Taufer, C. L. Brooks, I. , H. Casanova et al., Characterizing and evaluating desktop grids: an empirical study, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., pp.26-35, 2004.
DOI : 10.1109/IPDPS.2004.1302936

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.4764

O. Kremien and J. Kramer, Methodical analysis of adaptive load sharing algorithms, IEEE Transactions on Parallel and Distributed Systems, vol.3, issue.6, pp.747-760, 1992.
DOI : 10.1109/71.180629

N. P. Kronenberg, H. M. Levy, and W. D. Strecker, VAXcluster: a closely-coupled distributed system, ACM Transactions on Computer Systems, vol.4, issue.2, pp.130-146, 1986.
DOI : 10.1145/214419.214421

T. Kunz, The influence of different workload descriptions on a heuristic load balancing scheme, IEEE Transactions on Software Engineering, vol.17, issue.7, pp.725-730, 1991.
DOI : 10.1109/32.83908

B. Kuszmaul, The StarTech Massively Parallel Chess Program, Journal of the International Computer Chess Association, vol.18, issue.1, pp.3-19, 1995.

M. Lewis and A. Grimshaw, The core Legion object model, Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing HPDC-96, pp.551-561, 1996.
DOI : 10.1109/HPDC.1996.546226

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.9588

F. Lin and R. Keller, The Gradient Model Load Balancing Method, IEEE Transactions on Software Engineering, vol.13, issue.1, pp.32-38, 1987.
DOI : 10.1109/TSE.1987.232563

M. Lo and S. Dandamudi, Performance of hierarchical load sharing in heterogeneous distributed systems, Proceedings of International Conference on Parallel and Distributed Computing Systems, pp.370-377, 1996.

D. Lu and P. A. Dinda, Synthesizing Realistic Computational Grids, Proceedings of the 2003 ACM/IEEE conference on Supercomputing, SC '03, p.16, 2003.
DOI : 10.1145/1048935.1050167

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.80

P. Maes, Concepts and experiments in computational reflection Conference proceedings on Object-oriented programming systems, languages and applications, OOPSLA '87, pp.147-155, 1987.

J. Malenfant, M. Jaques, and F. N. Demers, A tutorial on behavioral reflection and its implementation, Proceedings of the Reflection 96 Conferencext, pp.1-20, 1996.

E. Medernach, Workload Analysis of a Cluster in a Grid Environment, Proceedings of 11th Workshop on Job Scheduling Strategies for Parallel Processing, pp.36-61, 2005.
DOI : 10.1007/11605300_2

URL : https://hal.archives-ouvertes.fr/in2p3-00024274

J. Meehean and M. Livny, A service migration case study: Migrating the Condor schedd, Midwest Instruction and Computing Symposium, 2005.

M. Miron-livny, M. Litzkow, and . Mutka, Condor -a hunter of idle workstations, Proceedings of 8th International Conference on Distribuited Computing Systems, pp.104-111, 1998.

S. Milgram, The small world problem, Psychology Today, vol.2, issue.1, pp.60-67, 1967.
DOI : 10.1037/e400002009-005

R. Mirchandaney, D. Towsley, and J. A. Stankovic, Adaptive load sharing in heterogeneous distributed systems, Journal of Parallel and Distributed Computing, vol.9, issue.4, pp.331-346, 1990.
DOI : 10.1016/0743-7315(90)90118-9

M. Mitzenmacher, The power of two choices in randomized load balancing, IEEE Transactions on Parallel and Distributed Systems, vol.12, issue.10, 1996.
DOI : 10.1109/71.963420

M. Mitzenmacher, On the analysis of randomized load balancing schemes, SPAA '97: Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, pp.292-301, 1997.

M. Mitzenmacher, How useful is old information?, IEEE Transactions on Parallel and Distributed Systems, vol.11, issue.1, pp.6-20, 2000.
DOI : 10.1109/71.824633

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.8231

K. Murata, N. Horspool, E. Manning, Y. Yokote, and M. Tokoro, Unification of active and passive objects in an object-oriented operating system, Proceedings of International Workshop on Object Orientation in Operating Systems, pp.68-71, 1995.
DOI : 10.1109/IWOOS.1995.470576

O. Group and . Sohpia-antipolis, Proactive, the java library for parallel , distributed, concurrent computing with security and mobility [98] Pragyansmita Paul. Seti @ home project and its website, Crossroads, vol.8, issue.3, pp.3-5, 2002.

S. Pulidas, D. Towsley, and J. Stankovic, Design of efficient parameter estimators for decentralized load, 1987.

R. Raman, M. Livny, and M. Solomon, Matchmaking: distributed resource management for high throughput computing, Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244), pp.140-146, 1998.
DOI : 10.1109/HPDC.1998.709966

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.1251

R. Riedl and L. Richter, Classification of load distribution algorithms, Proceedings of 4th Euromicro Workshop on Parallel and Distributed Processing, pp.404-413, 1996.
DOI : 10.1109/EMPDP.1996.500613

J. Ritter, Why Gnutella can't scale. No, really, 2001.

M. Roussopoulos and M. Baker, Practical load balancing for content requests in peer-to-peer networks. The Computing Research Repository, cs.NI/0209023, 2002.

S. Roy, C. , and B. Gupta, A probabilistic dynamic load balancing algorithm for homogeneous distributed systems (with extension to hypercubes) In CSC '94: Proceedings of the 22nd annual ACM computer science conference on Scaling up: Meeting the challenge of complexity in real-world computing applications, pp.165-172, 1994.

E. Satu and . Schaeffer, Algorithms for nonuniform networks, 2006.

R. Schollmeier, A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications, Proceedings First International Conference on Peer-to-Peer Computing, 2001.
DOI : 10.1109/P2P.2001.990434

C. Shen and W. Tsai, A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion, IEEE Transactions on Computers, vol.34, issue.3, pp.197-203, 1985.

G. Niranjan, P. Shivaratri, M. Krueger, and . Singhal, Load distributing for locally distributed systems, Computer, vol.25, issue.12, pp.33-44, 1992.

J. Shurkin, Engines of the Mind: A History of the Computer, 1984.

B. Cantwell and S. , Reflection and Semantics in a Procedural Language, 1982.

T. Sterling, D. Savarese, D. Becker, J. Dorband, U. Ranawake et al., BEOWULF: A parallel workstation for scientific computation, Proceedings of the 24th International Conference on Parallel Processing, pp.11-14, 1995.

V. Sunderam, PVM: A framework for parallel distributed computing, Concurrency: Practice and Experience, vol.4, issue.4, pp.315-339, 1990.
DOI : 10.1002/cpe.4330020404

A. S. Tanenbaum, R. Van-renesse, H. Van-staveren, G. J. Sharp, and S. J. Mullender, Experiences with the Amoeba distributed operating system, Communications of the ACM, vol.33, issue.12, pp.46-63, 1990.
DOI : 10.1145/96267.96281

D. Thain and M. Livny, Error scope on a computational grid: theory and practice, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing, pp.199-208, 2002.
DOI : 10.1109/HPDC.2002.1029919

D. Thain, T. Tannenbaum, and M. Livny, Distributed computing in practice: the Condor experience, Concurrency and Computation: Practice and Experience, vol.11, issue.2-4, pp.323-356, 2005.
DOI : 10.1002/cpe.938

M. Theimer and K. Lantz, Finding idle machines in a workstation-based distributed system, IEEE Transactions on Software Engineering, vol.15, issue.11, pp.1444-1458, 1989.
DOI : 10.1109/32.41336

R. V. Van-nieuwpoort, Efficient Java-Centric Grid-Computing, 2003.

R. V. Van-nieuwpoort, T. Kielmann, and H. E. Bal, Satin: Efficient Parallel Divide-and-Conquer in Java, Proceedings of EuroPar, pp.690-699, 2000.
DOI : 10.1007/3-540-44520-X_96

R. V. Van-nieuwpoort, T. Kielmann, and H. E. Bal, Efficient load balancing for wide-area divide-and-conquer applications, ACM SIGPLAN Notices, vol.36, issue.7, pp.34-43, 2001.
DOI : 10.1145/568014.379563

R. V. Van-nieuwpoort, J. Maassen, T. Kielmann, and H. E. Bal, Satin, ACM Transactions on Programming Languages and Systems, vol.32, issue.3, pp.19-32, 2003.
DOI : 10.1145/1709093.1709096

L. Todd, D. Veldhuizen, and . Gannon, Active Libraries: Rethinking the roles of compilers and libraries, Proceedings of the SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing (OO'98), 1998.

E. Satu and . Virtanen, Properties of nonuniform random graph models, Research Report, vol.77, 2003.

J. Waldo and K. Arnold, The Jini Specifications, Second Edition, 2000.

M. Wand and D. P. Friedman, The mystery of the tower revealed: A nonreflective description of the reflective tower, LFP '86: Proceedings of the 1986 ACM conference on LISP and functional programming, pp.298-307, 1986.
DOI : 10.1007/BF01806174

T. Watanabe and A. Yonezawa, Reflection in an object-oriented concurrent language Conference proceedings on Object-oriented programming systems, languages and applications, OOPSLA '88, pp.306-315, 1988.

D. Watts and S. Strogatz, Collective dynamics of " small world " networks, Nature, vol.393, issue.6684, pp.440-442, 2005.
DOI : 10.1038/30918

B. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, vol.6, issue.9, pp.1617-1622, 1988.
DOI : 10.1109/49.12889

P. Wegner, Concepts and paradigms of object-oriented programming, ACM SIGPLAN OOPS Messenger, vol.1, issue.1, pp.7-87, 2005.
DOI : 10.1145/382192.383004

C. Jerry, S. F. Yan, and . Lundstrom, The post-game analysis framework -developing resource management strategies for concurrent systems, IEEE Transactions on Knowledge and Data Engineering, vol.1, issue.3, pp.293-309, 1989.

Y. Yokote and M. Tokoro, Concurrent programming in concurrent smalltalk, Object-oriented concurrent programming, pp.129-158, 1987.