2496 search results - page 179 / 500 » Error-detecting properties of languages |
155
click to vote
CC
2003
Springer
15 years 9 months ago
2003
Springer
Popular mobile code architectures (Java and .NET) include verifiers to check for memory safety and other security properties. Since their formats are relatively high level, suppor...
149
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
154
click to vote
FSTTCS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
142
click to vote
PADO
2001
Springer
15 years 9 months ago
2001
Springer
nt Abstractions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 J¨orgen Gustavsson, Josef Svenningsson Implementing Circularity Using Pa...
135
click to vote
UML
2001
Springer
15 years 8 months ago
2001
Springer
: There are several reasons to specify UML models in a formal way The most important are to avoid inconsistencies and ambiguities and to do verification and forecasting of system p...