Sciweavers

119 search results - page 11 / 24
» Assertion Application in Theorem Proving and Proof Planning
Sort
View
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
14 years 10 days ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar
JCT
2007
111views more  JCT 2007»
13 years 8 months ago
Removing even crossings
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 9 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
CADE
2002
Springer
14 years 9 months ago
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
Robert R. Schneck, George C. Necula
JAPLL
2010
126views more  JAPLL 2010»
13 years 3 months ago
Justification logics and hybrid logics
Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine thes...
Melvin Fitting