Curriculum Model Checking: Declarative Representation and Verification of Properties
نویسندگان
چکیده
When a curriculum is proposed, it is important to verify at least three aspects: that the curriculum allows the achievement of the user’s learning goals, that the curriculum is compliant w.r.t. the course design goals, specified by the institution that offers it, and that the sequence of courses that defines the curriculum does not have competency gaps. In this work, we present a constrained-based representation for specifying the goals of “course design” and introduce a design graphical language, grounded into Linear Time Logic.
منابع مشابه
Declarative representation of curricula models: an LTL- and UML-based approach
In this work, we present a constrained-based representation for specifying the goals of “course design”, that we call curricula model, and introduce a graphical language, grounded into Linear Time Logic, to design curricula models which include knowledge of proficiency levels. Based on this representation, we show how model checking techniques can be used to verify that the user’s learning goal...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملA Bounded Model Checking Approach for the Verification of Web Services Composition
In this paper, we propose a bounded model-checking based approach for the verification of declarative Web services composition processes using satisfiability solving (SAT). The need for the bounded model-checking approach stems from the nature of declarative processes as they are defined by only specifying the constraints that mark the boundary of the solution to the composition process. The pr...
متن کاملBusiness Processes Verification with Temporal Answer Set Programming
The paper provides a framework for the specification and verification of business processes, based on a temporal extension of answer set programming (ASP). The framework allows to capture fluent annotations as well as data awareness in a uniform way. It allows for a declarative specification of business process but also for a direct encoding of processes specified in conventional workflow langu...
متن کامل