Sciweavers

141 search results - page 17 / 29
» Boolean Function Representation Using Parallel-Access Diagra...
Sort
View
VMCAI
2005
Springer
15 years 2 months ago
Information Flow Analysis for Java Bytecode
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
Samir Genaim, Fausto Spoto
DATE
2000
IEEE
108views Hardware» more  DATE 2000»
15 years 1 months ago
Automatic Abstraction for Worst-Case Analysis of Discrete Systems
c Abstraction for Worst-Case Analysis of Discrete Systems Felice Balarin Cadence Berkeley Laboratories Recently, a methodology for worst-case analysis of discrete systems has been...
Felice Balarin
SIAMCOMP
2011
14 years 4 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
IAT
2009
IEEE
15 years 1 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
IPPS
2007
IEEE
15 years 3 months ago
Using Speed Diagrams for Symbolic Quality Management
We present a quality management method for multimedia applications. The method takes as input an application software composed of actions. The execution times of actions are unkno...
Jacques Combaz, Jean-Claude Fernandez, Joseph Sifa...