Sciweavers

503 search results - page 23 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
TOC
2008
89views more  TOC 2008»
14 years 9 months ago
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
Emanuele Viola, Avi Wigderson
VISUALIZATION
1997
IEEE
15 years 1 months ago
The contour spectrum
We introduce the contour spectrum, a user interface component that improves qualitative user interaction and provides real-time exact quanti cation in the visualization of isocont...
Chandrajit L. Bajaj, Valerio Pascucci, Daniel Schi...
ICFP
2010
ACM
14 years 10 months ago
Functional pearl: every bit counts
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
Dimitrios Vytiniotis, Andrew Kennedy
MEMOCODE
2010
IEEE
14 years 7 months ago
Proving transaction and system-level properties of untimed SystemC TLM designs
Electronic System Level (ESL) design manages the complexity of todays systems by using abstract models. In this context Transaction Level Modeling (TLM) is state-of-theart for desc...
Daniel Große, Hoang M. Le, Rolf Drechsler
DSN
2005
IEEE
15 years 3 months ago
A Model of Stateful Firewalls and Its Properties
We propose the first model of stateful firewalls. In this model, each stateful firewall has a variable set called the state of the firewall, which is used to store some packet...
Mohamed G. Gouda, Alex X. Liu