1322 search results - page 197 / 265 » Unsound Theorem Proving |
EUROCRYPT
2005
Springer
14 years 2 months ago
2005
Springer
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
GI
2004
Springer
14 years 2 months ago
2004
Springer
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
ICFEM
2003
Springer
14 years 2 months ago
2003
Springer
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...
ATAL
2009
Springer
14 years 1 months ago
2009
Springer
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
KBSE
1999
IEEE
14 years 1 months ago
1999
IEEE
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...