503 search results - page 15 / 101 » Verifying Quantitative Properties Using Bound Functions |
128
click to vote
CC
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
91
Voted
CEFP
2005
Springer
15 years 3 months ago
2005
Springer
This chapter describes Hume: a functionally-based language for programming with bounded resource usage, including time and space properties. The purpose of the Hume language design...
106
click to vote
QEST
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— This paper reports on our efforts to link an industrial state-of-the-art modelling tool to academic state-of-the-art analysis algorithms. In a nutshell, we enable timed...
DAC
1999
ACM
15 years 10 months ago
1999
ACM
A number of researchers have proposed using digital marks to provide ownership identification for intellectual property. Many of these techniques share three specific weaknesses: ...
SKG
2006
IEEE
15 years 3 months ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...