Sciweavers

1414 search results - page 90 / 283
» Combining Intruder Theories
Sort
View
LICS
2006
IEEE
14 years 4 months ago
Boolean Algebras for Lambda Calculus
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
Giulio Manzonetto, Antonino Salibra
SMI
2005
IEEE
14 years 3 months ago
Maximizing Adaptivity in Hierarchical Topological Models
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
Peer-Timo Bremer, Valerio Pascucci, Bernd Hamann
LPAR
2005
Springer
14 years 3 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
PODC
2004
ACM
14 years 3 months ago
Completely fair SFE and coalition-safe cheap talk
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...
ILP
2004
Springer
14 years 3 months ago
Learning Ensembles of First-Order Clauses for Recall-Precision Curves: A Case Study in Biomedical Information Extraction
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik