Titlebook: Interactive Theorem Proving; 7th International Co Jasmin Christian Blanchette,Stephan Merz Conference proceedings 2016 Springer Internation

PANEL

Proof of OS Scheduling Behavior in the Presence of Interrupt-Induced Concurrencynd use it to prove the principal scheduling property of the embedded, real-time . .: that the running task is always the highest-priority runnable task. The key differentiator of this verification is that the . code itself runs with interrupts ., even within the scheduler, to minimise latency. Our r

付出

向宇宙

encomiast

lethargy

Visual Theorem Proving with the Incredible Proof Machineort graphs, which is akin?to, but even more natural than, natural deduction. In particular, we describe a way to determine the scope of local assumptions and variables implicitly. Our practical classroom experience backs these claims.

neurologist

Two-Way Automata in Coqduction from nondeterministic two-way automata to one-way automata that leads to a doubly-exponential increase in the number of states. By adapting the work of Shepherdson and Vardi, we obtain a singly-exponential translation from nondeterministic two-way automata to DFAs. The translation employs a

切碎

incisive

The Flow of ODEstion needs to be at the correct level of abstraction, in order to avoid drowning in tedious reasoning about technical details. The . of an ODE, i.e., the solution depending on initial conditions, and a dedicated type of bounded linear functions yield suitable abstractions. The dedicated type integra

物質(zhì)

取之不竭

Formalizing the Edmonds-Karp Algorithmook proof, and is accessible even without being an expert in Isabelle/HOL — the interactive theorem prover used for the formalization. We then use stepwise refinement to obtain the Edmonds-Karp algorithm, and formally prove a bound on its complexity. Further refinement yields a verified implementati