메뉴 건너뛰기




Volumn 16, Issue 1, 2009, Pages 73-99

Scalable satisfiability checking and test data generation from modeling diagrams

Author keywords

Databases; Modeling; NP hardness; ORM; ORM ; Test data generation; Testing

Indexed keywords

DATA COMMUNICATION SYSTEMS; HARDNESS; HARDNESS TESTING; LINGUISTICS; POLYNOMIAL APPROXIMATION; TEST FACILITIES;

EID: 60349086827     PISSN: 09288910     EISSN: 15737535     Source Type: Journal    
DOI: 10.1007/s10515-008-0044-6     Document Type: Conference Paper
Times cited : (19)

References (30)
  • 7
    • 0037944958 scopus 로고    scopus 로고
    • On xml integrity constraints in the presence of dtds
    • 3
    • W. Fan L. Libkin 2002 On xml integrity constraints in the presence of dtds J. ACM 49 3 368 406
    • (2002) J. ACM , vol.49 , pp. 368-406
    • Fan, W.1    Libkin, L.2
  • 8
    • 0022287890 scopus 로고
    • Inferences for numerical dependencies
    • 2-3
    • J. Grant J. Minker 1985 Inferences for numerical dependencies Theor. Comput. Sci. 41 2-3 271 287
    • (1985) Theor. Comput. Sci. , vol.41 , pp. 271-287
    • Grant, J.1    Minker, J.2
  • 13
    • 60349095998 scopus 로고    scopus 로고
    • PhD thesis, Vrije Universiteit Brussel, Department of Computer Science (Feb. 2006)
    • Heynmans, S.: Decidable open answer set programming. PhD thesis, Vrije Universiteit Brussel, Department of Computer Science (Feb. 2006)
    • Decidable Open Answer Set Programming
    • Heynmans, S.1
  • 17
    • 77954025605 scopus 로고    scopus 로고
    • Prospects for and issues with mapping the object-role modeling language into DLRifd
    • June 2007
    • Keet, C.M.: Prospects for and issues with mapping the object-role modeling language into DLRifd. In: Proc. 20th International Workshop on Description Logics, June 2007
    • Proc. 20th International Workshop on Description Logics
    • Keet, C.M.1
  • 21
    • 70349287575 scopus 로고    scopus 로고
    • Efficient reasoning about finite satisfiability of uml class diagrams with constrained generalization sets
    • Maraee, A., Balaban, M.: Efficient reasoning about finite satisfiability of uml class diagrams with constrained generalization sets. In: Proc. 3rd European Conference on Model-Driven Architecture, 2007
    • (2007) Proc. 3rd European Conference on Model-Driven Architecture
    • Maraee, A.1    Balaban, M.2
  • 23
    • 0000149921 scopus 로고
    • Generating consistent test data: Restricting the search space by a generator formula
    • A. Neufeld G. Moerkotte P.C. Lockemann 1993 Generating consistent test data: Restricting the search space by a generator formula VLDB J. 2 173 213
    • (1993) VLDB J. , vol.2 , pp. 173-213
    • Neufeld, A.1    Moerkotte, G.2    Lockemann, P.C.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.