Evaluating well-formedness constraints on incomplete models

In modern modeling tools used for model-driven development, the validation of several well-formedness constraints is continuously been carried out by exploiting advanced graph query engines to highlight conceptual design flaws. However, while models are still under development, they are frequently p...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Semeráth Oszkár
Varró Dániel
Dokumentumtípus: Cikk
Megjelent: 2017
Sorozat:Acta cybernetica 23 No. 2
Kulcsszavak:Informatika, Számítástechnika, Programozás
Tárgyszavak:
doi:10.14232/actacyb.23.2.2017.15

Online Access:http://acta.bibl.u-szeged.hu/50095
LEADER 01901nab a2200241 i 4500
001 acta50095
005 20220620153512.0
008 180213s2017 hu o 0|| eng d
022 |a 0324-721X 
024 7 |a 10.14232/actacyb.23.2.2017.15  |2 doi 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Semeráth Oszkár 
245 1 0 |a Evaluating well-formedness constraints on incomplete models  |h [elektronikus dokumentum] /  |c  Semeráth Oszkár 
260 |c 2017 
300 |a 687-713 
490 0 |a Acta cybernetica  |v 23 No. 2 
520 3 |a In modern modeling tools used for model-driven development, the validation of several well-formedness constraints is continuously been carried out by exploiting advanced graph query engines to highlight conceptual design flaws. However, while models are still under development, they are frequently partial and incomplete. Validating constraints on incomplete, partial models may identify a large number of irrelevant problems. By switching off the validation of these constraints, one may fail to reveal problematic cases which are difficult to correct when the model becomes sufficiently detailed. Here, we propose a novel validation technique for evaluating well-formedness constraints on incomplete, partial models with may and must semantics, e.g. a constraint without a valid match is satisfiable if there is a completion of the partial model that may satisfy it. To this end, we map the problem of constraint evaluation over partial models into regular graph pattern matching over complete models by semantically equivalent rewrites of graph queries. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Informatika, Számítástechnika, Programozás 
700 0 1 |a Varró Dániel  |e aut 
856 4 0 |u http://acta.bibl.u-szeged.hu/50095/1/actacyb_23_2_2017_15.pdf  |z Dokumentum-elérés