407 search results - page 13 / 82 » Malleable Proof Systems and Applications |
CCS
2009
ACM
14 years 8 months ago
2009
ACM
Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing sp...
CADE
2004
Springer
14 years 7 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
ICFEM
2007
Springer
14 years 1 months ago
2007
Springer
Simulink is popular in industry for modeling and simulating embedded systems. It is deficient to handle requirements of high-level assurance and timing analysis. Previously, we sh...
ISDA
2006
IEEE
14 years 1 months ago
2006
IEEE
The last decade has witnessed an exponential growth of sequence information in the field of biological macromolecules such as proteins and nucleic acids and their interactions wit...
LICS
2003
IEEE
14 years 23 days ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...