462 search results - page 18 / 93 » Symbolic Bounded Synthesis |
140
Voted
IPL
2011
14 years 7 months ago
2011
Ellul, Krawetz, Shallit and Wang prove an exponential lower bound on the size of any context-free grammar generating the language of all permutations over some alphabet. We genera...
TIT
2008
15 years 3 months ago
2008
The capacity of sticky channels, a subclass of insertion channels where each symbol may be duplicated multiple times, is considered. The primary result is to provide nearly tight n...
101
Voted
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...
228
click to vote
POPL
2005
ACM
16 years 3 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
146
Voted
EUROSYS
2010
ACM
16 years 21 days ago
2010
ACM
Debugging real systems is hard, requires deep knowledge of the code, and is time-consuming. Bug reports rarely provide sufficient information, thus forcing developers to turn int...