116 search results - page 21 / 24 » Automatic Abstraction for Intervals Using Boolean Formulae |
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
AML
2006
14 years 11 months ago
2006
Lukasiewicz's infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Lukasiewicz algebra on the unit real interva...
103
click to vote
ISSTA
2010
ACM
15 years 3 months ago
2010
ACM
In program debugging, finding a failing run is only the first step; what about correcting the fault? Can we automate the second task as well as the first? The AutoFix-E tool au...
TIT
1998
14 years 11 months ago
1998
Abstract— We consider adaptive sequential prediction of arbitrary binary sequences when the performance is evaluated using a general loss function. The goal is to predict on each...
CEC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most o...