@incollection{Mossakowski01,
  abstract = { Development graphs are a tool for dealing with structured
  specifications in a formal program development in order to ease the
  management of change and reusing proofs. Often, different aspects of
  a software system have to be specified in different logics, since
  the construction of a huge logic covering all needed features would
  be too complex to be feasible. Therefore, we introduce {em
    heterogeneous development graphs} as a means to cope with
  heterogeneous specifications.
  
  We cover both the semantics and the proof theory of heterogeneous
  development graphs. A proof calculus can be obtained either by
  combining proof calculi for the individual logics, or by
  representing these in some ``universal'' logic like higher-order
  logic in a coherent way and then ``borrowing'' its calculus for the
  heterogeneous language.},
  added-at = {2016-08-05T15:59:03.000+0200},
  author = {Mossakowski, T.},
  biburl = {https://www.bibsonomy.org/bibtex/20df63ae54c5716cb44465301f5221007/tillmo},
  booktitle = {Foundations of Software Science and Computation Structures},
  editor = {Nielsen, M. and Engberg, U.},
  interhash = {9671cd6230ddd9b90b6a2859681a4046},
  intrahash = {0df63ae54c5716cb44465301f5221007},
  keywords = {imported},
  pages = {326--341},
  pdfurl = {http://www.informatik.uni-bremen.de/~till/papers/hetdg.pdf},
  psurl = {http://www.informatik.uni-bremen.de/~till/papers/hetdg.ps},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  status = {Reviewed},
  timestamp = {2016-08-05T15:59:03.000+0200},
  title = {Heterogeneous development graphs and heterogeneous borrowing},
  url = {http://www.springerlink.com/(bt4qw245oavupgzdxw3zpuul)/app/home/contribution.asp?referrer=parent&backto=searchcitationsresults,1,1;},
  volume = 2303,
  year = 2002
}