Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: Ph.D. Dissertation
- Language: Farsi
- Document No: 58172 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Izadi, Mohammad
- Abstract:
- Compliance and Conformance are foundations for many applications and technical issues in computing, cybernetics and software engineering. The omnipresent requirement for compliance checking and solving of a system against another system is an essential need in many domains and areas. There are necessary and ever increasing applications and usefulness of compliance solving in modern paradigms of computing, such as cloud and distributed computing, natural computing, complex systems verification, normative systems planning and complex problems solving. Many research fields such as Quality assurance, safety and security, system and software evaluation, system and software architecture and compliance management are profiting and gain advantage from results of compliance solving researches. Compliance is related to semantic, not just syntax, so it is natural and inevitable to employ and engage semantics based approaches for compliance solving. Usually, compliance problem is separated in two partitioned elements: the system under compliance and compliance requirements. Further, formal specifications are derived and provided for these two parts of problem. So far, semantics based compliance solving has been done mostly by utilizing logic solving approaches (particularly, model checking). In this way, formal semantics are exploited, such as: first order logic, modal logics (particularly temporal logics and deontic logics), binary formulae, Kripke structure, transition systems, Reo circuits (and its formal semantics) and games. Solving compliance problem is hard and even in its simple forms is NP-Complete. Present approaches to compliance solving have some shortcomings and suffer from some flaws and deficiencies. According to an analysis that is provided in this thesis, some causes are recognized for these shortcomings, to name a few: utilizing conventional logic solving for compliance solving which is not efficient due to complexity of this problem, relying on restricted and a limited number of semantic models, a reductionism approach to semantics (all things are brought to an elementary level of abstraction and all meanings are reduced to these level constructs and then, the problem would be solved. This procedure could result in state space explosion), lack of a hierarchy of semantics and lack of semantic composition and combination. In order to resolving these issues, the proposed solution of this thesis is based on a network of semantics. This semantics network allows us to build semantic logically, intuitionally and compositionally, based on a set of wide-ranging semantic models. Truly, semantic compilation and semantic composition are done based on numerous foundational semantics. Any intuitive semantic model could become one of foundational semantics. For semantic compilation and building a logical and mathematical construction upon foundational semantics, we could utilize Logic (modal and deontic logics), soft computing (particularly computing with words and perception-based computing), natural computing, grammars, Reo circuits and an occurrence-based semantics (that will be presented by this research). For demonstrating the details of proposed solution for compliance solving problem, some compliance problem cases have been solved during this PhD thesis
- Keywords:
- Compliance Checking ; Intuitionism ; Rule-Based Benchmarking ; Compliance Solving ; Semantic Logic ; Semantic Compilation ; Formal Semantics
Digital Object List
-
محتواي کتاب
- view
Bookmark