Sciweavers

447 search results - page 68 / 90
» Bounded Model Checking with Parametric Data Structures
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 9 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
12 years 3 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
TII
2010
124views Education» more  TII 2010»
13 years 2 months ago
Address-Independent Estimation of the Worst-case Memory Performance
Abstract--Real-time systems are subject to temporal constraints and require a schedulability analysis to ensure that task execution finishes within lower and upper specified bounds...
Basilio B. Fraguela, Diego Andrade, Ramon Doallo
ICFP
2012
ACM
11 years 10 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
JSW
2007
156views more  JSW 2007»
13 years 7 months ago
An Automatic Test Case Generation Framework for Web Services
— BPEL (Business Process Execution Language) as a de-facto standard for web service orchestration has drawn particularly attention from researchers and industries. BPEL is a semi...
Yongyan Zheng, Jiong Zhou, Paul Krause