866 search results - page 81 / 174 » A Formal Investigation of |
124
click to vote
TACAS
2010
Springer
16 years 21 days ago
2010
Springer
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
144
click to vote
TACAS
2009
Springer
16 years 15 days ago
2009
Springer
Abstract. This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic modelchecking. We encod...
152
click to vote
ISMVL
2009
IEEE
16 years 11 days ago
2009
IEEE
For formal verification of hardware Satisfiability Modulo Theory (SMT) solvers are increasingly applied. Today’s state-of-the-art SMT solvers use different techniques like ter...
143
click to vote
DALT
2009
Springer
16 years 9 days ago
2009
Springer
In this paper, we investigate the multiagent planning problem in the presence of cooperative actions and agents, which have their own goals and are willing to cooperate. To this en...
151
click to vote
CDC
2008
IEEE
16 years 6 days ago
2008
IEEE
— The paper describes a framework for solving the coverage problem for a class of non-convex domains. In [1] we have shown how a diffeomorphism can be used to transform a non-con...