DBScholar

Back to papers

Method Schemas

Summary: Introduces “method schemas”: a minimal formal model capturing OO features (classes, methods, inheritance, name overloading, late binding). Studies consistency of schemas, proves general undecidability, pinpoints decidable fragments (monadic/recursion‑free), analyzes covariance and sketches incremental/sound checking. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
884
Venue
PODS
Year
1990
Pagerank
7.6525725e-05
Overall Rank
3,191 | 78.11%
DOI
10.1145/298514.298538

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{abiteboul_pods90,
        address = {New York, NY, USA},
        series = {{PODS} '90},
        title = {{Method Schemas}},
        url = {https://dl.acm.org/doi/10.1145/298514.298538},
        doi = {10.1145/298514.298538},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Abiteboul, Serge and Kanellakis, Paris C. and Waller, Emmanuel},
        year = {1990}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers