1410 search results - page 158 / 282 » Proving theorems by reuse |
162
Voted
ESORICS
2010
Springer
15 years 7 months ago
2010
Springer
Sun and the CERT recommend for secure Java development to not allow partially initialized objects to be accessed. The CERT considers the severity of the risks taken by not followin...
167
click to vote
ECCC
2007
15 years 6 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
152
click to vote
FSS
2010
15 years 4 months ago
2010
The paper investigates fuzzy relations on a finite domain in the cutworthy framework, dealing with a new property coming from the information theory. If the domain of a relation i...
168
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
149
click to vote
FROCOS
2007
Springer
16 years 7 days ago
2007
Springer
Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...