Hoare logicfinite state automatonmodel checkingSummary: This paper is a technical supplement of our original research in the combination of genetic programming (GP), Hoare logic, model checking, and finite state automaton for Hoare triple constructions. Although there is no problem in achieving this ...
Model Checking TLA+ Specifications TLA+ is a specification language for concurrent and reactive systems that combines the temporal logic TLA with full first-order logic and ZF set theory. TLC is a new model checker for debugging a TLA+ Y Yuan,P Manolios,L Lamport - Springer-Verlag 被引量:...
which extends traditional Hoare logic with a crash condition, a recovery procedure, and logical address spaces for specifying disk states at different abstraction levels. CHL also reduces the proof effort for developers through proofautomation. Using CHL, we developed, specified, and proved the correct...
This specification uses separation logic in four different address spaces: the bare disk (which implements asynchronous writes and matches the log_rep predicate); the abstract disks inside the transaction, old_state and new_state (which have synchronous writes and match the files_rep predicate); ...
model checkingfinite state automatonThis paper is a technical supplement of our original research in the combination of genetic programming (GP), Hoare logic, model checking, and finite state automaton for Hoare triple constructions. Although there is no problem in achieving this goal by first ...
Model checkingFinite state automatonThis paper is a technical supplement of our original research in the combination of genetic programming (GP), Hoare logic, model checking, and finite state automaton for Hoare triple constructions. Although there is no problem in achieving this goal by first ...