1711 search results - page 317 / 343 » Completing pseudojump operators |
AGENTS
1998
Springer
14 years 1 days ago
1998
Springer
Physical domains are notoriously hard to model completely and correctly, especially to capture the dynamics of the environment. Moreover, since environments change, it is even mor...
PLDI
1997
ACM
14 years 3 hour ago
1997
ACM
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
TLCA
1997
Springer
13 years 12 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
CSFW
2009
IEEE
13 years 11 months ago
2009
IEEE
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
DAC
2010
ACM
13 years 11 months ago
2010
ACM
As device size shrinks to the nanometer range, FPGAs are increasingly prone to manufacturing defects. We anticipate that the ability to tolerate multiple defects will be very impo...