Large, dynamic, and ad-hoc organizations must frequently initiate data integration and sharing efforts with insufficient awareness of how organizational data sources are related. ...
Ken Smith, Craig Bonaceto, Chris Wolf, Beth Yost, ...
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
We study generalizations of shortest programs as they pertain to Schaefer’s MIN∗ problem. We identify sets of m-minimal and T-minimal indices and characterize their truth-tabl...
Research on formulae production in spreadsheets has established the practice as high risk yet unrecognised as such by industry. There are numerous software applications that are d...