309 search results - page 46 / 62 » Termination proofs for systems code |
134
click to vote
CSFW
2009
IEEE
15 years 5 months ago
2009
IEEE
We present the design and implementation of a compiler that, given high-level multiparty session descriptions, generates custom cryptographic protocols. Our sessions specify pre-a...
114
click to vote
CADE
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
152
Voted
POPL
2011
ACM
14 years 4 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
138
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
103
Voted
JCM
2007
15 years 1 months ago
2007
—To establish the interference canceller, generating replicas of unwanted carriers is a key. This paper addresses the design and performances of two types of signal canceller tha...