Sciweavers

276 search results - page 5 / 56
» Automatic Generation of Functional Programs from CASL Specif...
Sort
View
115
Voted
ENTCS
2006
153views more  ENTCS 2006»
14 years 11 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
FATES
2003
Springer
15 years 4 months ago
Mutually Enhancing Test Generation and Specification Inference
Generating effective tests and inferring likely program specifications are both difficult and costly problems. We propose an approach in which we can mutually enhance the tests and...
Tao Xie, David Notkin
ICSE
2009
IEEE-ACM
16 years 15 days ago
Equality and hashing for (almost) free: Generating implementations from abstraction functions
ng Implementations from Abstraction Functions Derek Rayside, Zev Benjamin, Rishabh Singh, Joseph P. Near, Aleksandar Milicevic and Daniel Jackson Computer Science and Artificial In...
Derek Rayside, Zev Benjamin, Rishabh Singh, Joseph...
ATS
2009
IEEE
127views Hardware» more  ATS 2009»
15 years 4 months ago
On the Generation of Functional Test Programs for the Cache Replacement Logic
Caches are crucial components in modern processors (both stand-alone or integrated into SoCs) and their test is a challenging task, especially when addressing complex and high-fre...
Wilson J. Perez, Danilo Ravotto, Edgar E. Sá...
OSDI
2006
ACM
15 years 12 months ago
From Uncertainty to Belief: Inferring the Specification Within
Automatic tools for finding software errors require a set of specifications before they can check code: if they do not know what to check, they cannot find bugs. This paper presen...
Ted Kremenek, Paul Twohey, Godmar Back, Andrew Y. ...