Sciweavers

462 search results - page 39 / 93
» Symbolic Bounded Synthesis
Sort
View
126
Voted
EVOW
2007
Springer
15 years 10 months ago
Toward Greater Artistic Control for Interactive Evolution of Images and Animation
We present several practical improvements to the interactive evolution of 2D images, some of which are also applicable to more general genetic programming problems. We introduce tr...
David A. Hart
129
Voted
ENTCS
2007
141views more  ENTCS 2007»
15 years 3 months ago
Compressing BMC Encodings with QBF
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
Toni Jussila, Armin Biere
110
Voted
LICS
2006
IEEE
15 years 9 months ago
Avoiding Determinization
Automata on infinite objects are extensively used in system specification, verification, and synthesis. While some applications of the automata-theoretic approach have been wel...
Orna Kupferman
TACAS
1997
Springer
105views Algorithms» more  TACAS 1997»
15 years 7 months ago
Graphs in METAFrame: The Unifying Power of Polymorphism
We present a highly polymorphic tool for the construction, synthesis, structuring, manipulation, investigation, and (symbolic) execution of graphs. The exibility of this tool, whic...
Michael von der Beeck, Volker Braun, Andreas Cla&s...
114
Voted
OPODIS
2008
15 years 5 months ago
Revising Distributed UNITY Programs Is NP-Complete
We focus on automated revision techniques for adding Unity properties to distributed programs. We show that unlike centralized programs, where multiple safety properties along with...
Borzoo Bonakdarpour, Sandeep S. Kulkarni