Sciweavers

10 search results - page 2 / 2
» Dual Search in Permutation State Spaces
Sort
View
SPIN
2009
Springer
13 years 11 months ago
Automatic Discovery of Transition Symmetry in Multithreaded Programs Using Dynamic Analysis
While symmetry reduction has been established to be an important technique for reducing the search space in model checking, its application in concurrent software verification is ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Cha...
PACT
2005
Springer
13 years 10 months ago
Optimal Behavior of a Moving Creature in the Cellular Automata Model
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
Mathias Halbach, Rolf Hoffmann
ATAL
2006
Springer
13 years 8 months ago
Integrating parallel interactions into cooperative search
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
Efrat Manisterski, David Sarne, Sarit Kraus
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
13 years 11 months ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 3 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise