632 search results - page 15 / 127 » Combining programming with theorem proving |
APLAS
2005
ACM
15 years 1 months ago
2005
ACM
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
CONCUR
2010
Springer
15 years 24 days ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
171
click to vote
POPL
2008
ACM
16 years 8 hour ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
107
click to vote
FMCAD
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We present a formal verification methodology for datapathdominated hardware. This provides a systematic but flexible framework within which to organize the activities und...
FUIN
2006
14 years 11 months ago
2006
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...