1001 search results - page 125 / 201 » Testing Formal Dialectic |
104
click to vote
FOSSACS
2003
Springer
15 years 7 months ago
2003
Springer
In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compu...
97
Voted
ICCS
2003
Springer
15 years 7 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
113
click to vote
PLDI
2000
ACM
15 years 6 months ago
2000
ACM
This paper presents a static race detection analysis for multithreaded Java programs. Our analysis is based on a formal type system that is capable of capturing many common synchr...
147
click to vote
CARDIS
2000
Springer
15 years 6 months ago
2000
Springer
This article describes a Java Card programming environment which to a large extent is generated from formal specifications of the syntax and semantics of Java Card, the JCRE (Jav...
97
Voted
ACSAC
1999
IEEE
15 years 6 months ago
1999
IEEE
The Automatic Authentication Protocol Analyzer, 2nd Version AAPA2 is a fast, completely automatic tool for formally analyzing cryptographic protocols. It correctly identi es vulne...