Publication type: |
Article in Collection |

Author: |
T. Mossakowski |

Editor: |
M. Nielsen, U. Engberg |

Title: |
Heterogeneous development graphs and heterogeneous borrowing |

Book / Collection title: |
Foundations of Software Science and Computation Structures |

Volume: |
2303 |

Page(s): |
326 – 341 |

Series: |
Lecture Notes in Computer Science |

Year published: |
2002 |

Publisher: |
Springer-Verlag |

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. |

Internet: |
http://www.springerlink.com/(bt4qw245oavupgzdxw3zpuul)/app/home/contribution.asp?referrer=parent&backto=searchcitationsresults,1,1; |

PDF Version: |
http://www.informatik.uni-bremen.de/~till/papers/hetdg.pdf |

PostScript Version: |
http://www.informatik.uni-bremen.de/~till/papers/hetdg.ps |

Status: |
Reviewed |

Last updated: |
31. 01. 2006 |