| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Dolors Costal Dolors Costal, Maria-Ribera Sancho , Ernest Teniente : Understanding Redundancy in UML Models for Object-Oriented Analysis. CAiSE 2002 : 659-674 Dolors Costal, Antoni Olivé , Ernest Teniente : Relationship Type Refinement in Conceptual Models with Multiple Classification. ER 2001 : 397-411 Antoni Olivé , Dolors Costal, Maria-Ribera Sancho : Entity Evolution in ISA Hierarchies. ER 1999 : 62-80 Dolors Costal, Maria-Ribera Sancho , Antoni Olivé , Miguel Barceló , Pablo Costa , Carme Quer , Anna Roselló : The Cause-Effect Rules of ROSES. ADBIS 1997 : 399-405 Dolors Costal, Maria-Ribera Sancho , Antoni Olivé , Anna Roselló : The Role of Structural Events in Behaviour Specification. DEXA 1997 : 673-686 Dolors Costal, Ernest Teniente , Toni Urpí : An Approach to Obtain Intensional Translation for Consistent View Updating. DOOD 1997 : 175-192 Dolors Costal, Antoni Olivé , Maria-Ribera Sancho : Temporal Features of Class Populations and Attributes in Conceptual Models. ER 1997 : 57-70 Dolors Costal, Antoni Olivé : Planning Based on View Updating in Deductive Databases. ISMIS 1997 : 348-359 Dolors Costal, Ernest Teniente , Toni Urpí , Carles Farré : Handling Conceptual Model Validation by Planning. CAiSE 1996 : 255-271 Jaume Sistac , Fèlix Saltor , Francesc Costa , Dolors Costal, Carme Martín , Antoni Urpí : Docencia de las bases de Datos en la Facultat d'Informàtica de Barcelona. JIDBD 1996 : 16-23 Pablo Costa , Miguel Barceló , Dolors Costal, Antoni Olivé , Carme Quer , Anna Roselló , Maria-Ribera Sancho : Las Clases de Objetos en ROSES. JIDBD 1996 : 98-108 Dolors Costal: A new Plan Generation Method for Deductive Conceptual Models Validation. DAISD 1993 : 175-200 Dolors Costal, Antoni Olivé : A Method for Reasoning About Deductive Conceptual Models of Information Systems. CAiSE 1992 : 612-631 Dolors Costal: An Approach to Validation of Deductive Conceptual Models. DAISD 1991 : 50-72 1 [ 4 ] [ 11 ] 2 [ 5 ] 3 [ 4 ] [ 11 ] 4 [ 6 ] 5 [ 5 ] 6 [ 2 ] [ 4 ] [ 7 ] [ 8 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] 7 [ 4 ] [ 11 ] 8 [ 4 ] [ 10 ] [ 11 ] 9 [ 5 ] 10 [ 4 ] [ 8 ] [ 10 ] [ 11 ] [ 12 ] [ 14 ] 11 [ 5 ] 12 [ 6 ] [ 9 ] [ 13 ] [ 14 ] 13 [ 5 ] 14 [ 6 ] [ 9 ]  ©2004 Association for Computing Machinery |
