Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities betwe...
Data mining focuses on the development of methods and algorithms for such tasks as classification, clustering, rule induction, and discovery of associations. In the database fiel...
We present a query answering technique based on notions and results from modal Correspondence Theory. It allows us to answer a wide family of conjunctive queries by polynomial redu...