3831 search results - page 426 / 767 » Dynamic Context Logic |
169
click to vote
SAS
2007
Springer
16 years 25 days ago
2007
Springer
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
202
click to vote
ACSAC
2005
IEEE
16 years 11 days ago
2005
IEEE
Understanding the security goals provided by cryptographic protocol implementations is known to be difficult, since security requirements such as secrecy, integrity and authentici...
149
click to vote
ENC
2005
IEEE
16 years 10 days ago
2005
IEEE
This paper describes SKIMA, a mediation system that gives transparent access to heterogeneous and distributed sources considering their semantics and the semantics of application ...
197
click to vote
BIRTHDAY
2005
Springer
16 years 8 days ago
2005
Springer
Propositional reasoning (SAT) is an essential part of many reasoning tasks. Many problems in computer science can be compiled to SAT and then effectively decided using state-of-th...
177
click to vote
IFL
2005
Springer
16 years 7 days ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...