5084 search results - page 122 / 1017 » Proving Possibility Properties |
146
click to vote
RTA
1995
Springer
15 years 9 months ago
1995
Springer
In this paper we study normalization properties of rewrite systems that are typeable using intersection types with and with sorts. We prove two normalization properties of typeable...
149
click to vote
IPL
2006
15 years 5 months ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
152
click to vote
AMC
2005
15 years 5 months ago
2005
In this paper, a Fourier spectral method for numerically solving Cahn-Hilliard equation with periodic boundary conditions is developed. We establish their semi-discrete and fully d...
154
click to vote
ECCC
2000
15 years 5 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
280
click to vote
ACL2
2006
ACM
15 years 9 months ago
2006
ACM
We have extended the ACL2 theorem prover to automatically prove properties of VHDL circuits with IBM's Internal SixthSense verification system. We have used this extension to...