Sciweavers

2137 search results - page 163 / 428
» Proving Abstract Non-interference
Sort
View
ACISP
2004
Springer
15 years 8 months ago
Convertible Nominative Signatures
Abstract. A feasible solution to prevent potential misuse of signatures is to put some restrictions on their verification. Therefore S.J.Kim, S.J.Park and D.H.Won introduced the n...
Zhenjie Huang, Yumin Wang
119
Voted
COLT
2004
Springer
15 years 8 months ago
Performance Guarantees for Regularized Maximum Entropy Density Estimation
Abstract. We consider the problem of estimating an unknown probability distribution from samples using the principle of maximum entropy (maxent). To alleviate overfitting with a v...
Miroslav Dudík, Steven J. Phillips, Robert ...
GI
2004
Springer
15 years 8 months ago
A Formal Correctness Proof for Code Generation from SSA Form in Isabelle/HOL
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
Jan Olaf Blech, Sabine Glesner
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
15 years 8 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
15 years 8 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...