Model Checking Puzzles in - Calculus 1
نویسندگان
چکیده
Tne paper discusses some issues related to model checking utility and reliability: (1) utility of model checking and games for solving puzzles, and (2) importance of games and puzzles for validation of model checkers.
منابع مشابه
Puzzles for Learning Model Checking, Model Checking for Programming Puzzles, Puzzles for Testing Model Checkers
Paper discuss some issues related to model checking: (1) early model checking teaching via games, (2) utility of model checking and games for solving puzzles, (3) importance of games for validation of model checkers. Basic ideas are illustrated by a model checking based solution for a complicated puzzle how to identify a unique false coin among given ones balancing them limited times.
متن کامل1 Summary of Research Results 1 . 1 Research Objectives
We present a static analysis that detects potential runtime exceptions that are raised and never handled inside Standard ML(SML) programs. This analysis will predict abrupt termination of SML programs, which is SML’s only “safety hole.” Our implementation of this analysis has been applied to realistic SML programs and shows a promising cost-accuracy performance. For the ML-Lex program, for exam...
متن کاملSokoban: Reversed Solving
This article describes a new method for attempting to solve Sokoban puzzles by means of an efficient algorithm, a task which has proven to be extremely difficult because of both the huge search tree depth and the large branching factor. We present a way of solving Sokoban puzzles that, using several heuristics, starts from the final state of a puzzle, and from there works its way back to the in...
متن کاملEnriched µ-Calculi Module Checking
The model checking problem for open systems has been widely studied in the literature, for both finite–state (module checking) and infinite–state (pushdown module checking) systems, with respect to CTL and CTL. In this paper, we further investigate this problem with respect to the μ-calculus enriched with nominals and graded modalities (hybrid graded μ-calculus), in both the finite–state and in...
متن کاملLocal Model Checking in Park's -calculus
Temporal logic model checking is a veriication method for reactive systems. In global model checking , the truth of a formula (and its subformulae) is determined for all the states in the model. Local model checking procedures are designed for proving that a speciic state of the model satisses a given formula. This may avoid the exhaustive traversal of a model and can thus be applied also to in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007