@inproceedings{CMCalco2011,
  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.
},
  added-at = {2016-08-05T15:59:03.000+0200},
  author = {Codescu, Mihai and Mossakowski, Till},
  biburl = {https://www.bibsonomy.org/bibtex/2c242138c7ab66946b88c1327e939f236/tillmo},
  booktitle = {Algebra and Coalgebra in Computer Science, CALCO'11},
  editor = {Andrea Corradini, Bartek Klin},
  interhash = {06f7a2fe7e4b09fa97d7feba524120bb},
  intrahash = {c242138c7ab66946b88c1327e939f236},
  keywords = {architectural calculus consistency institution proof refinement specification},
  pages = {145-160},
  pdfurl = {https://svn.omdoc.org/repos/latin/public/refinement-calco2011.pdf},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  status = {Reviewed},
  timestamp = {2016-08-05T15:59:03.000+0200},
  title = {Refinement trees: calculi, tools and applications},
  url = {http://dx.doi.org/10.1007/978-3-642-22944-2_11},
  volume = 6859,
  year = 2011
}