Sciweavers

716 search results - page 16 / 144
» Modelling Bounded Rationality Using Evolutionary Techniques
Sort
View
FM
2009
Springer
104views Formal Methods» more  FM 2009»
14 years 2 months ago
A Metric Encoding for Bounded Model Checking
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
ISVLSI
2007
IEEE
131views VLSI» more  ISVLSI 2007»
14 years 2 months ago
Improving the Quality of Bounded Model Checking by Means of Coverage Estimation
Formal verification has become an important step in circuit and system design. A prominent technique is Bounded Model Checking (BMC) which is widely used in industry. In BMC it i...
Ulrich Kühne, Daniel Große, Rolf Drechs...
CHARME
2005
Springer
176views Hardware» more  CHARME 2005»
14 years 1 months ago
An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
Nina Amla, Xiaoqun Du, Andreas Kuehlmann, Robert P...
AFL
2011
98views more  AFL 2011»
12 years 7 months ago
Accepting Networks of Evolutionary Processors with Subregular Filters
In this paper, we propose a new variant of Accepting Networks of Evolutionary Processors, in which the operations can be applied only arbitrarily to the words, while the filters ...
Florin Manea, Bianca Truthe
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 12 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass