14 search results - page 3 / 3 » Exploiting Regularities for Boolean Function Synthesis |
DAC
2006
ACM
14 years 6 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
DAC
1995
ACM
13 years 9 months ago
1995
ACM
— Software components for embedded reactive real-time applications must satisfy tight code size and runtime constraints. Cooperating finite state machines provide a convenient i...
ASPLOS
2006
ACM
13 years 11 months ago
2006
ACM
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...