Sciweavers

1763 search results - page 17 / 353
» A Formalization of Polytime Functions
Sort
View
DIGRA
2005
Springer
14 years 3 months ago
Towards the unification of intuitive and formal game concepts with applications to computer chess
A general technique is proposed to deal with the formalization of intuition and human-oriented concepts in competition thinking games like chess, such as defensive play, attack, t...
Ariel Arbiser
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
13 years 8 months ago
Polynomial datapath optimization using constraint solving and formal modelling
For a variety of signal processing applications polynomials are implemented in circuits. Recent work on polynomial datapath optimization achieved significant reductions of hardware...
Finn Haedicke, Bijan Alizadeh, Görschwin Fey,...
CEFP
2007
Springer
14 years 4 months ago
Proving Properties of Lazy Functional Programs with Sparkle
This tutorial paper aims to provide the necessary expertise for working with the proof assistant Sparkle, which is dedicated to the lazy functional programming language Clean. The ...
Maarten de Mol, Marko C. J. D. van Eekelen, Rinus ...
DAC
2002
ACM
14 years 11 months ago
Deriving a simulation input generator and a coverage metric from a formal specification
This paper presents novel uses of functional interface specifications for verifying RTL designs. We demonstrate how a simulation environment, a correctness checker, and a function...
Kanna Shimizu, David L. Dill
ENTCS
2006
176views more  ENTCS 2006»
13 years 10 months ago
Automatic Formal Synthesis of Hardware from Higher Order Logic
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Sl...