Sciweavers

707 search results - page 66 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
14 years 1 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
BMCBI
2010
233views more  BMCBI 2010»
13 years 8 months ago
Odefy -- From discrete to continuous models
Background: Phenomenological information about regulatory interactions is frequently available and can be readily converted to Boolean models. Fully quantitative models, on the ot...
Jan Krumsiek, Sebastian Pölsterl, Dominik M. ...
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 5 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
CCS
2006
ACM
13 years 11 months ago
Cryptanalysis of the "Grain" family of stream ciphers
Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFS...
Alexander Maximov
IAT
2009
IEEE
13 years 12 months ago
Combining Boolean Games with the Power of Ontologies for Automated Multi-attribute Negotiation in the Semantic Web
Recently, multi-attribute negotiation has been extensively studied from a game-theoretic viewpoint. Since normal and extensive form games have the drawback of requiring an explicit...
Thomas Lukasiewicz, Azzurra Ragone