26 search results - page 2 / 6 » A Complete and Terminating Execution Model for Constraint Ha... |
CAV
2004
Springer
13 years 10 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
DAGSTUHL
1998
13 years 7 months ago
1998
Deductive database technology represents an important step towards the goal of developing highly-declarative database programming languages. In order to make deductive databases a ...
CHARME
2003
Springer
13 years 11 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
ACSD
2005
IEEE
13 years 11 months ago
2005
IEEE
This paper presents our approach to model distributed discrete event simulation systems in the framework of distributed graph transformation. We use distributed typed attributed g...
SP
2010
IEEE
13 years 4 months ago
2010
IEEE
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...