Sciweavers

777 search results - page 136 / 156
» Model Checking with Formula-Dependent Abstract Models
Sort
View
PLDI
2009
ACM
15 years 4 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
CISC
2007
Springer
152views Cryptology» more  CISC 2007»
15 years 4 months ago
Orthogonality between Key Privacy and Data Privacy, Revisited
Abstract. Key privacy is a notion regarding the privacy of the owner of a public key, which has important applications in building (receiver) anonymous channels, or privacy-enhance...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai
ISOLA
2004
Springer
15 years 3 months ago
Embedding Finite Automata within regular Expressions
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
PKDD
1999
Springer
272views Data Mining» more  PKDD 1999»
15 years 2 months ago
Handling Missing Data in Trees: Surrogate Splits or Statistical Imputation
Abstract. In many applications of data mining a - sometimes considerable - part of the data values is missing. This may occur because the data values were simply never entered into...
A. J. Feelders
ATAL
1997
Springer
15 years 2 months ago
Approximate Reasoning about Combined Knowledge
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
Frédéric Koriche