Sciweavers

458 search results - page 60 / 92
» Imperative Programming with Dependent Types
Sort
View
JFP
2010
82views more  JFP 2010»
13 years 7 months ago
Formal polytypic programs and proofs
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
Wendy Verbruggen, Edsko de Vries, Arthur Hughes
ETFA
2008
IEEE
14 years 3 months ago
Pinpointing interrupts in embedded real-time systems using context checksums
When trying to track down bugs using cyclic debugging, the ability to correctly reproduce executions is imperative. In sequential, deterministic, non-real-time software, this repr...
Daniel Sundmark, Henrik Thane
CF
2005
ACM
13 years 10 months ago
Dynamic loop pipelining in data-driven architectures
Data-driven array architectures seem to be important alternatives for coarse-grained reconfigurable computing platforms. Their use has provided performance improvements over micro...
João M. P. Cardoso
ACL
1992
13 years 9 months ago
Estimating Upper and Lower Bounds on the Performance of Word-Sense Disambiguation Programs
We have recently reported on two new word-sense disambiguation systems, one trained on bilingual material (the Canadian Hansards) and the other trained on monolingual material (Ro...
William A. Gale, Kenneth Ward Church, David Yarows...
EDBT
2000
ACM
14 years 7 days ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu