Model Checking Syllabi and Student Carreers

Authors:
Roberto Sebastiani;Alessandro Tomasi;Fausto Giunchiglia
Affiliations:
-;-;-
Venue:
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2001

Citing 5
Cited 0

Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Act, and the rest will follow: exploiting determinism in planning as satisfiability

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Symbolic Model Checking

Symbolic Model Checking
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
The LPSAT engine & its application to resource planning

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Model checking has been conceived as a powerful tool for hardware, software and protocol verification, which has its main application fields in the development of hi-tech and safety-critical systems. We present here a completely novel application in the field of university administration processes, in which model checking is applied to the verification of the coherence of syllabi and to the automated synthesis/simulation of correct student careers under given requirements.