1108 search results - page 212 / 222 » Model Checking of Safety Properties |
108
Voted
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
81
Voted
LICS
2000
IEEE
15 years 4 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
139
Voted
DLOG
2006
15 years 1 months ago
2006
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
115
click to vote
PODS
2008
ACM
16 years 15 days ago
2008
ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
105
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...