797 search results - page 138 / 160 » Eliminating Proofs from Programs |
116
Voted
IPL
2008
15 years 16 days ago
2008
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
108
Voted
AAECC
2005
Springer
15 years 14 days ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
115
Voted
BMCBI
2005
15 years 13 days ago
2005
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
72
Voted
EOR
2002
15 years 10 days ago
2002
ct 9 The new concepts of repelling inequalities, repelling paths, and prime analytic centers are introduced. A repelling 10 path is a generalization of the analytic central path fo...
122
click to vote
SAC
2008
ACM
15 years 18 hour ago
2008
ACM
In this paper we investigate and propose a fully automated technique to perform conformance checking of Java implementations against UML class diagrams. In our approach, we reused...