151 search results - page 11 / 31 » Handling Boolean A Boxes |
RC
2007
13 years 7 months ago
2007
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...
VMCAI
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
AISC
2006
Springer
13 years 11 months ago
2006
Springer
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
CC
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Several mathematical frameworks for static analysis of programs have been developed in the past decades. Although these tools are quite useful, they have still many limit...
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
Technology mapping based on DAG-covering suffers from the problem of structural bias: the structure of the mapped netlist depends strongly on the subject graph. In this paper we ...