288 search results - page 32 / 58 » Interactive Termination Proofs Using Termination Cores |
76
Voted
ENTCS
2000
14 years 9 months ago
2000
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
118
Voted
ENTCS
2002
14 years 9 months ago
2002
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...
DATE
2006
IEEE
15 years 3 months ago
2006
IEEE
1 This paper presents a test scheduling approach for system-onchip production tests with peak-power constraints. An abort-onfirst-fail test approach is assumed, whereby the test is...
90
Voted
CORR
2004
Springer
14 years 9 months ago
2004
Springer
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
113
click to vote
CSFW
1999
IEEE
15 years 1 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...