2687 search results - page 111 / 538 » Formal Analysis of PKCS |
122
click to vote
SAS
1994
Springer
15 years 8 months ago
1994
Springer
We definea novelinference systemfor strictness andtotality analysisfor the simplytyped lazy lambda-calculus with constants and fixpoints. Strictness information identifies those t...
151
click to vote
FORMATS
2006
Springer
15 years 7 months ago
2006
Springer
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as...
142
Voted
IFL
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. The paper presents several analyses to detect non-deterministic expressions in the parallel-functional language Eden. First, the need for the analysis is motivated, and t...
139
click to vote
FSEN
2009
Springer
15 years 7 months ago
2009
Springer
This note aims at providing a concise and precise Travellers Guide, Phrase Book or Reference Manual to the timed automata modeling formalism introduced by Alur and Dill [7, 8]. The...
123
click to vote
FMICS
2010
Springer
15 years 4 months ago
2010
Springer
Bitwise instructions, loops and indirect data access pose difficult challenges to the verification of microcontroller programs. In particular, it is necessary to show that an indir...