메뉴 건너뛰기




Volumn , Issue , 2006, Pages 460-467

Modelling and reasoning for confidentiality requirements in software development

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL; CASE BASED REASONING; COMPUTER SIMULATION; DATA PRIVACY; REQUIREMENTS ENGINEERING; SPECIFICATIONS;

EID: 34250014499     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECBS.2006.50     Document Type: Conference Paper
Times cited : (2)

References (26)
  • 1
    • 34249981227 scopus 로고    scopus 로고
    • G. Antoniou, D. Billington, G. Governatori, M. J. Maher, and A. Rock. A Family of Defeasible Reasoning Logics and its Implementation. In W. Horn, editor, Proceedings 14th European Conference on Artificial Intelligence, pages 459-463, Berlin, Germany, 20-25 August 2000.
    • G. Antoniou, D. Billington, G. Governatori, M. J. Maher, and A. Rock. A Family of Defeasible Reasoning Logics and its Implementation. In W. Horn, editor, Proceedings 14th European Conference on Artificial Intelligence, pages 459-463, Berlin, Germany, 20-25 August 2000.
  • 6
    • 33748037549 scopus 로고    scopus 로고
    • Accessed 5 January, 2006
    • B. Dick. Grounded Theory: A Thumbnail Sketch. http://www.scu.edu.au/ schools/gcm/ar/arp/grounded.html, 2005. Accessed 5 January, 2006.
    • (2005) Grounded Theory: A Thumbnail Sketch
    • Dick, B.1
  • 13
    • 0010947176 scopus 로고    scopus 로고
    • Grounded Theory as Scientific Method
    • Accessed 5 January
    • B. D. Haig. Grounded Theory as Scientific Method. Philosophy of Education, 1995. http://www.ed.uiuc.edu/EPS/PES-Yearbook/ 95_docs/haig.html Accessed 5 January, 2006.
    • (2006) Philosophy of Education, 1995
    • Haig, B.D.1
  • 18
    • 0030734230 scopus 로고    scopus 로고
    • Formal Methods: Promises and Problems
    • January
    • Luqi and J. Goguen. Formal Methods: Promises and Problems. IEEE Software, 14(1):73-85, January 1997.
    • (1997) IEEE Software , vol.14 , Issue.1 , pp. 73-85
    • Luqi1    Goguen, J.2
  • 19
    • 85008541130 scopus 로고    scopus 로고
    • Propositional Defeasible Logic has Linear Complexity
    • M. J. Maher. Propositional Defeasible Logic has Linear Complexity. Theory and Practice of Logic Programming, 1(6):691-711, 2001.
    • (2001) Theory and Practice of Logic Programming , vol.1 , Issue.6 , pp. 691-711
    • Maher, M.J.1
  • 22
    • 5644219981 scopus 로고    scopus 로고
    • The Creation of Theory: A Recent Application of the Grounded Theory Method
    • 24, Dec 1996, Accessed 5 January
    • N. R. Pandit. The Creation of Theory: A Recent Application of the Grounded Theory Method. The Qualitative Report, 2(4), Dec 1996. http://www.nova.edu/ssss/QR/QR2-4/pandit.html Accessed 5 January, 2006.
    • (2006) The Qualitative Report
    • Pandit, N.R.1
  • 26
    • 0030781944 scopus 로고    scopus 로고
    • Towards Modelling and Reasoning Support for Early-Phase Requirements Engineering
    • Annapolis, MD, USA, January
    • E. Yu. Towards Modelling and Reasoning Support for Early-Phase Requirements Engineering. In Proceedings 3rd IEEE International Symposium on Requirements Engineering, pages 226-235, Annapolis, MD, USA, January 1997.
    • (1997) Proceedings 3rd IEEE International Symposium on Requirements Engineering , pp. 226-235
    • Yu, E.1


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