Refinement trees: calculi, tools, and applications

  • Authors:
  • Mihai Codescu;Till Mossakowski

  • Affiliations:
  • DFKI GmbH Bremen;DFKI GmbH Bremen

  • Venue:
  • CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We recall a language for refinement and branching of formal developments. We introduce a notion of refinement tree and present proof calculi for checking correctness of refinements as well as their consistency. Both calculi have been implemented in the Heterogeneous Tool Set (Hets), and have been integrated with other tools like model finders and conservativity checkers. This technique has already been applied for showing the consistency of a first-order ontology that is too large to be tackled directly by model finders.