Titlebook: Engineering Theories of Software Intensive Systems; Proceedings of the N Manfred Broy,Johannes Grünbauer,Tony Hoare Conference proceedings

crockery

FECT

Formalizing Counterexample-Driven Refinement with Weakest Preconditionsis representation of SLAM simplifies and distills the concepts of counterexample-driven refinement in a form that should be suitable for teaching the process in a few lectures of a graduate-level course.

等待

Keys in Formal Verificationprogress monitor prior to its abstraction. It is claimed that this extended method is complete for proving by abstraction any temporal property of an infinite-state systems..We show that augmented abstraction is a practical approach to proofs of liveness properties, and is simpler to apply than corr

CLOUT

On the Utility of Canonical Abstractionmost precise, but requires the use of a theorem prover. The third method achieves precision close to the second method with tolerable costs, but requires some additional information from the designers of the abstraction..We discuss the canonical-abstraction domain, and show the properties of program