An axiomatic theory represents mathematical knowledge declaratively as a set of axioms. An algorithmic theory represents mathematical knowledge procedurally as a set of algorithms....
Supporting SPARQL queries over relational databases becomes an active topic recently. However, it has not received enough consideration when SPARQL queries include restrictions on...
Nominal subtyping (or user-defined subtyping) and structural subtyping each have their own strengths and weaknesses. Nominal subtyping allows programmers to explicitly express de...
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
Slowdown, defined as the ratio of a request’s queueing delay to its service time, is accepted as an important quality of service metric of Internet servers. In this paper, we i...
Xiaobo Zhou, Yu Cai, C. Edward Chow, Marijke F. Au...