462 search results - page 5 / 93 » Symbolic Bounded Synthesis |
DAC
2001
ACM
15 years 10 months ago
2001
ACM
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
MFCS
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise a...