id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
cord-030704-cgoq0m5u	Wimmer, Simon	Verified Certification of Reachability Checking for Timed Automata	2020-03-13		.txt	text/plain	6786	389	60	The resulting tool is evaluated on a set of standard benchmarks to demonstrate its practicality, using a new unverified model checker implementation in Standard ML to construct the certificates. Previous work [31] has addressed this problem by constructing a model checker for timed automata that is fully verified using Isabelle/HOL [25] . We use a new unverified model checker called Mlunta, which is implemented in Standard ML (SML), to generate certificates for a set of standard benchmarks, and to evaluate our verified certifier's performance on these benchmarks 1 . Thus, model checking algorithms for timed automata are based on the idea of abstracting from concrete valuations to sets of clock valuations of type (nat ⇒ real ) set, often called zones. Using these techniques, we obtain a simple certificate checker that is executable, provided that we can implement the elementary model checking primitives such as the subsumption check or computing the list of successors of a state.	./cache/cord-030704-cgoq0m5u.txt	./txt/cord-030704-cgoq0m5u.txt