12981 search results - page 476 / 2597 » Model Checking (Abstract) |
195
Voted
EGCDMAS
2004
15 years 6 months ago
2004
Security policies are abstract descriptions of how a system should behave to be secure. They typically express what is obligatory, permitted, or forbidden in the system. When the s...
154
Voted
ENTCS
2006
15 years 5 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 ...
206
click to vote
FMSB
2008
15 years 6 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 ...
128
click to vote
QEST
2006
IEEE
15 years 11 months 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, ...
133
click to vote
ICFP
2004
ACM
16 years 5 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-...