A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests

Olivier Raynaud, Eric Thierry. A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests. In Jørgen Lindskov Knudsen, editor, ECOOP 2001 - Object-Oriented Programming, 15th European Conference, Budapest, Hungary, June 18-22, 2001, Proceedings. Volume 2072 of Lecture Notes in Computer Science, pages 165-180, Springer, 2001. [doi]

@inproceedings{RaynaudT01,
  title = {A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests},
  author = {Olivier Raynaud and Eric Thierry},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2072/20720165.htm},
  tags = {testing},
  researchr = {https://researchr.org/publication/RaynaudT01},
  cites = {0},
  citedby = {0},
  pages = {165-180},
  booktitle = {ECOOP 2001 - Object-Oriented Programming, 15th European Conference, Budapest, Hungary, June 18-22, 2001, Proceedings},
  editor = {Jørgen Lindskov Knudsen},
  volume = {2072},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42206-4},
}