SAT-based techniques in system synthesis

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2003, Pages 1168-1169

  Haubelt, Christian ^a   Teich, Jürgen ^a   Feldmann, Rainer ^b   Monien, Burkhard ^b  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINDING PROBLEM; BOOLEAN FORMULAE; BOOLEAN SATISFIABILITY PROBLEMS; DESIGN SPACE EXPLORATION; ELECTRONIC SYSTEMS; PROBLEM INSTANCES; QUANTIFIED BOOLEAN FORMULAS; SYSTEM SYNTHESIS;

EMBEDDED SYSTEMS; EXHIBITIONS;

BOOLEAN FUNCTIONS;

EID: 50249155492     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2003.1253784     Document Type: Conference Paper

References (3)

1. T. Blickle, J. Teich, and L. Thiele. System-Level Synthesis Using Evolutionary Algorithms. In R. Gupta, editor, Design Automation for Embedded Systems, 3, pages 23-62. Kluwer, Jan. 1998
2. R. Feldmann, B. Monien, and S. Schamberger. A Distributed Algorithm to Evaluate Quantified Boolean Formulas. In Proc. of the 17th Nat. Conf. on Artificial Intelligence (AAAI-00), pages 285-290, 2000
3. C. Scholl and B. Becker. Checking Equivalence for Partial Implementations. In Proc. of 38th Design Automation Conference, pages238-243, Las Vegas, USA, 2001