Sciweavers

632 search results - page 92 / 127
» Proving Invariants of Functional Programs
Sort
View
89
Voted
IJCAI
1989
15 years 1 months ago
Learning Novel Domains Through Curiosity and Conjecture
This paper describes DIDO, a system we have developed to carry out exploratory learning of unfamiliar domains without assistance from an external teacher. The program incorporates...
Paul D. Scott, Shaul Markovitch
82
Voted
MP
2007
89views more  MP 2007»
14 years 12 months ago
Globally convergent limited memory bundle method for large-scale nonsmooth optimization
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of thousands of variables. In the paper [Haarala, Miettinen, M¨akel¨a,...
Napsu Haarala, Kaisa Miettinen, Marko M. Mäke...
TAP
2010
Springer
145views Hardware» more  TAP 2010»
14 years 10 months ago
QuickSpec: Guessing Formal Specifications Using Testing
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem ...
Koen Claessen, Nicholas Smallbone, John Hughes
ICLP
2010
Springer
14 years 10 months ago
A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification
We present a framework for (static) verification of general resource usage program properties. The framework extends the criteria of correctness as the conformance of a program to ...
Pedro López-García, Luthfi Darmawan,...
96
Voted
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
15 years 6 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto