4340 search results - page 350 / 868 » Formal Methods and Cryptography |
161
click to vote
SAS
2007
Springer
16 years 26 days ago
2007
Springer
Variables in programs are usually confined to a fixed number of bits and results that require more bits are truncated. Due to the use of 32-bit and 64-bit variables, inadvertent ...
164
click to vote
TYPES
2007
Springer
16 years 25 days ago
2007
Springer
This paper gives a characterisation, via intersection types, of the strongly normalising terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the ...
152
click to vote
SAS
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
198
click to vote
SAS
2005
Springer
16 years 6 days ago
2005
Springer
We show that the idea of predicates on heap objects can be cast in the framework of predicate abstraction. This leads to an alternative view on the underlying concepts of three-val...
153
click to vote
SAS
2005
Springer
16 years 6 days ago
2005
Springer
The termination insensitive secure information flow problem can be reduced to solving a safety problem via a simple program transformation. Barthe, D’Argenio, and Rezk coined th...