Inclusion Constraints over Non-empty Sets of Trees

Müller, Martin; Niehren, Joachim; Podelski, Andreas

doi:10.1007/BFb0030609

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Inclusion Constraints over Non-empty Sets of Trees

MPS-Authors

/persons/resource/persons45201

Podelski, Andreas
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dvxFz
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Müller, M., Niehren, J., & Podelski, A. (1997). Inclusion Constraints over Non-empty Sets of Trees. In M. Bidoit, & M. Dauchet (Eds.), TAPSOFT '97: Theory and Practice of Software Development (pp. 345-356). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-39E3-0

Abstract

There is no abstract available