77 search results - page 12 / 16 » Static Determination of Probabilistic Execution Times |
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases. The second extends the first by u...
SP
2010
IEEE
13 years 11 months ago
2010
IEEE
—To handle the growing flood of malware, security vendors and analysts rely on tools that automatically identify and analyze malicious code. Current systems for automated malwar...
FLAIRS
2004
13 years 9 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
VLDB
2004
ACM
14 years 25 days ago
2004
ACM
We introduce an auditing framework for determining whether a database system is adhering to its data disclosure policies. Users formulate audit expressions to specify the (sensiti...
AUSAI
2003
Springer
14 years 22 days ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...