1512 search results - page 289 / 303 » When Suboptimal Rules |
PPOPP
1997
ACM
14 years 2 months ago
1997
ACM
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
ECOOP
2007
Springer
14 years 1 months ago
2007
Springer
UML class diagrams are usually annotated with OCL expressions that constrain their possible instantiation. In our work we have investigated how OCL annotations can be automatically...
EUROCAST
2007
Springer
14 years 1 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
EDBT
2009
ACM
14 years 1 months ago
2009
ACM
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
CAV
2004
Springer
14 years 1 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...