| Quellcodebibliothek Statistik Leitseite products/Sources/formale Sprachen/Isabelle/HOL/MicroJava/DFA/ (Beweissystem Isabelle Version 2025-1©) Datei vom 16.11.2025 mit Größe 1 kB |
|
Quelle Typing_Framework.thySprache: Isabelle |
|||||||||||||||
|
(* Title: HOL/MicroJava/DFA/Typing_Framework.thy Author: Tobias Nipkow Copyright 2000 TUM *) section ‹Typing and Dataflow Analysis Framework› theory Typing_Framework imports Listn begin text ‹ The relationship between dataflow analysis and a welltyped-instruction predica › type_synonym 's step_type = "nat ==> 's ==> (nat × 's) list" definition stable :: "'s ord ==> 's step_type ==> 's list ==> nat ==> bool" where "stable r step ss p == ∀(q,s')∈set(step p (ss!p)). s' <=_r ss!q" definition stables :: "'s ord ==> 's step_type ==> 's list ==> bool" where "stables r step ss == ∀p definition wt_step :: "'s ord ==> 's ==> 's step_type ==> 's list ==> bool" where "wt_step r T step ts == ∀p definition is_bcv :: "'s ord ==> 's ==> 's step_type ==> nat ==> 's set ==> ('s list ==> 's list) ==> bool" where "is_bcv r T step n A bcv == ∀ss ∈ list n A. (∀p (∃ts ∈ list n A. ss <=[r] ts & wt_step r T step ts)" end
¤ Dauer der Verarbeitung: 0.11 Sekunden (vorverarbeitet am 2026-05-03) ¤*© Formatika GbR, Deutschland |
|
||||||||||||||
2026-05-26