3224 search results - page 400 / 645 » On Checking Model Checkers |
188
click to vote
ENTCS
2006
15 years 6 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
234
click to vote
FMSB
2008
15 years 8 months ago
2008
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
217
click to vote
DLOG
2009
15 years 4 months ago
2009
Abstract. Model-based most specific concepts are a non-standard reasoning service in Description Logics. They have turned out to be useful in knowledge base completion for ontologi...
168
click to vote
QEST
2006
IEEE
16 years 19 days ago
2006
IEEE
This talk will provide an overview of work that I have done with Hana Chockler, Orna Kupferman, and Judea Pearl [1, 2, 10, 9] on defining notions such as causality, explanation, ...
157
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...