2137 search results - page 115 / 428 » Proving Abstract Non-interference |
135
click to vote
MKM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We have formalized material from an introductory real analysis textbook in the proof assistant Scunak. Scunak is a system based on set theory encoded in a dependent type ...
102
Voted
RTA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
122
click to vote
SOFSEM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
118
click to vote
TYPES
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Proof erasure plays an essential role in the paradigm of programming with theorem proving. In this paper, we introduce a form of attributive types that carry an attribute...
110
click to vote
ICRA
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— In this paper, the robustness of graspless manipulation (or nonprehensile manipulation) is investigated. We derive some new constraints for static frictional forces in ...