602 search results - page 48 / 121 » Program Calculation in Coq |
181
click to vote
CANDC
2005
ACM
15 years 2 months ago
2005
ACM
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
106
Voted
ICFEM
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available...
132
Voted
JSC
2010
15 years 25 days ago
2010
We study the automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls. Given a Hoare-style partial correctness specificati...
124
Voted
AMAST
2008
Springer
15 years 4 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
105
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Single and multi-step time-series predictors were evolved for forecasting minimum bidding prices in a simulated supply chain management scenario. Evolved programs were allowed to ...