2137 search results - page 259 / 428 » Proving Abstract Non-interference |
144
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
124
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
Program analysis tools typically compute two types of information: (1) may information that is true of all program executions and is used to prove the absence of bugs in the progr...
148
click to vote
ICCAD
2002
IEEE
16 years 22 days ago
2002
IEEE
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
150
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
130
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...