Sciweavers

4311 search results - page 104 / 863
» Code Generation for Distributed Systems
Sort
View
ENTCS
2007
97views more  ENTCS 2007»
13 years 10 months ago
Can a Model Checker Generate Tests for Non-Deterministic Systems?
Modern software is increasingly concurrent, timed, distributed, and therefore, non-deterministic. While it is well known that tests can be generated as LTL or CTL model checker co...
Sergiy Boroday, Alexandre Petrenko, Roland Groz
CATS
2006
13 years 11 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
A. V. Kelarev
OSDI
2008
ACM
14 years 10 months ago
KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs
We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentally-intensive prog...
Cristian Cadar, Daniel Dunbar, Dawson R. Engler
ECCC
2010
95views more  ECCC 2010»
13 years 10 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola
WISE
2007
Springer
14 years 4 months ago
Building the Presentation-Tier of Rich Web Applications with Hierarchical Components
Nowadays information systems are increasingly distributed and deployed within the Internet platform. Without any doubt, the World Wide Web represents the de facto standard platform...
Reda Kadri, Chouki Tibermacine, Vincent Le Gloahec