Sciweavers

837 search results - page 8 / 168
» Proof Development with OMEGA
Sort
View
KI
2009
Springer
14 years 4 months ago
Presenting Proofs with Adapted Granularity
When mathematicians present proofs they usually adapt their explanations to their didactic goals and to the (assumed) knowledge of their addressees. Modern automated theorem prover...
Marvin Schiller, Christoph Benzmüller
CASSIS
2005
Springer
14 years 3 months ago
Modular Proof Principles for Parameterised Concretizations
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
David Pichardie
ENTCS
2002
90views more  ENTCS 2002»
13 years 9 months ago
Refactoring in maintenance and development of Z specifications
Once you have proved your refinement correct, that is not the end. Real products, and their accompanying specifications, develop over time, with new improved versions having added...
Susan Stepney, Fiona Polack, Ian Toyn
ECAI
1994
Springer
14 years 1 months ago
Reusing Proofs
1 We develop a learning component for a theorem prover designed for verifying statements by mathematical induction. If the prover has found a proof, it is analyzed yielding a so-ca...
Thomas Kolbe, Christoph Walther
MICS
2008
107views more  MICS 2008»
13 years 9 months ago
Automatic Proof of Graph Nonisomorphism
We describe automated methods for constructing nonisomorphism proofs for pairs of graphs. The proofs can be human-readable or machinereadable. We have developed an experimental imp...
Arjeh M. Cohen, Jan Willem Knopper, Scott H. Murra...