598 search results - page 81 / 120 » Efficient and User-Friendly Verification |
ACL
1997
14 years 3 days ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
CADE
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
Restricted Boltzmann machines were developed using binary stochastic hidden units. These can be generalized by replacing each binary unit by an infinite number of copies that all ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
nd Counterexample-Based Abstraction Niklas Een, Alan Mishchenko EECS Department, University of California Berkeley, USA. Nina Amla Cadence Research Laboratroy Berkeley, USA. This p...
IJISEC
2008
13 years 10 months ago
2008
We study the multicast stream authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. In such a model, packet overhead...