Sciweavers

135 search results - page 2 / 27
» Bounded Synthesis
Sort
View
ISSS
2000
IEEE
127views Hardware» more  ISSS 2000»
13 years 11 months ago
Lower Bound Estimation for Low Power High-Level Synthesis
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Sta...
FMCAD
2009
Springer
14 years 1 months ago
Finding heap-bounds for hardware synthesis
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
Byron Cook, Ashutosh Gupta, Stephen Magill, Andrey...
FMICS
2006
Springer
13 years 11 months ago
Automated Incremental Synthesis of Timed Automata
Abstract. In this paper, we concentrate on incremental synthesis of timed automata for automatic addition of different types of bounded response properties. Bounded response
Borzoo Bonakdarpour, Sandeep S. Kulkarni
DATE
2003
IEEE
100views Hardware» more  DATE 2003»
14 years 19 days ago
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals
: Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfiability (SAT) Solvers, on the other hand, have been gaining
Gianpiero Cabodi, Sergio Nocco, Stefano Quer
AUTOMATICA
2004
147views more  AUTOMATICA 2004»
13 years 7 months ago
Interval analysis and dioid: application to robust controller design for timed event graphs
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
Mehdi Lhommeau, Laurent Hardouin, Bertrand Cottenc...