DBScholar

Back to papers

Analyzing Workflows implied by Instance-Dependent Access Rules

Summary: Analyzes decidability of form-completability and semi-soundness for workflows implicitly generated by instance-dependent access rules in form-based web systems. Characterizes (un)decidability and complexity across fragments defined by path-language expressiveness and schema-tree depth, pinpointing boundaries for automatic workflow verification. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1380
Venue
PODS
Year
2006
Pagerank
5.093636e-05
Overall Rank
12,678 | 13.02%
DOI
10.1145/1142351.1142365

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{calders_pods06,
        address = {New York, NY, USA},
        series = {{PODS} '06},
        title = {{Analyzing Workflows implied by Instance-Dependent Access Rules}},
        url = {https://dl.acm.org/doi/10.1145/1142351.1142365},
        doi = {10.1145/1142351.1142365},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Calders, Toon and Dekeyser, Stijn and Hidders, Jan and Paredaens, Jan},
        year = {2006}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
2,100 Logical Foundations of Peer-To-Peer Data Integration 2004 PODS 9.1675595e-05
Previous Page 1 / 1 Next

Semantically Similar Papers