1199 search results - page 173 / 240 » Parameterized Proof Complexity |
RSP
1999
IEEE
15 years 5 months ago
1999
IEEE
Formal methods are a nice idea, but the size and complexity of real systems means that they are impractical. We propose that a reasonable alternative to attempting to specify and ...
144
click to vote
WIFT
1998
IEEE
15 years 5 months ago
1998
IEEE
The Unified Modeling Language (UML) is likely to become an important industry standard language for modelling object-oriented systems. However, its use as a precise analysis tool ...
AADEBUG
1993
Springer
15 years 4 months ago
1993
Springer
Program slicing is a program transformation that is useful in program debugging, program maintenance, and other applications that involve understanding program behavior. Given a p...
107
click to vote
CRYPTO
1989
Springer
15 years 4 months ago
1989
Springer
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
114
click to vote
APLAS
2007
ACM
15 years 4 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...