1302 search results - page 190 / 261 » Fair Equivalence Relations |
160
click to vote
TLCA
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
167
click to vote
DSN
2007
IEEE
16 years 20 days ago
2007
IEEE
New versions of existing large-scale web services such as Passport.com© have to go through rigorous performance evaluations in order to ensure a high degree of availability. Perf...
199
click to vote
LICS
2007
IEEE
16 years 18 days ago
2007
IEEE
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
151
click to vote
LICS
2007
IEEE
16 years 18 days ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
151
click to vote
PG
2007
IEEE
16 years 18 days ago
2007
IEEE
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision on a uniform grid of any size. Other exact evaluation technique either restrict t...