Sciweavers

608 search results - page 5 / 122
» Tests, Proofs and Refinements
Sort
View
100
Voted
ENTCS
2008
106views more  ENTCS 2008»
14 years 10 months ago
Verifying Test-Hypotheses: An Experiment in Test and Proof
HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. The HOL-TestGen method is two-staged: first, the origina...
Achim D. Brucker, Lukas Brügger, Burkhart Wol...
95
Voted
JANCL
2006
100views more  JANCL 2006»
14 years 10 months ago
An efficient relational deductive system for propositional non-classical logics
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
Andrea Formisano, Marianna Nicolosi Asmundo
80
Voted
ASM
2008
ASM
15 years 7 days ago
Model Based Refinement and the Tools of Tomorrow
The ingredients of typical model based development via refinement are re-examined, and some well known frameworks are reviewed in that light, drawing out commonalities and differen...
Richard Banach
TLCA
2005
Springer
15 years 3 months ago
Can Proofs Be Animated By Games?
Proof animation is a way of executing proofs to nd errors in the formalization of proofs. It is intended to be \testing in proof engineering". Although the realizability inter...
Susumu Hayashi
80
Voted
ACTA
2006
108views more  ACTA 2006»
14 years 10 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink