Sciweavers

30 search results - page 6 / 6
» Monad Transformers and Modular Interpreters
Sort
View
EMSOFT
2004
Springer
13 years 8 months ago
A methodology for generating verified combinatorial circuits
High-level programming languages offer significant expressivity but provide little or no guarantees about resource use. Resourcebounded languages -- such as hardware-description l...
Oleg Kiselyov, Kedar N. Swadi, Walid Taha
ARITH
2005
IEEE
13 years 10 months ago
Table Lookup Structures for Multiplicative Inverses Modulo 2k
We introduce an inheritance property and related table lookup structures applicable to simplified evaluation of the modular operations “multiplicative inverse”, “discrete l...
David W. Matula, Alex Fit-Florea, Mitchell Aaron T...
CC
2003
Springer
250views System Software» more  CC 2003»
13 years 10 months ago
Automatic Detection of Uninitialized Variables
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
Thi Viet Nga Nguyen, François Irigoin, Cori...
CAV
2008
Springer
122views Hardware» more  CAV 2008»
13 years 6 months ago
Thread Quantification for Concurrent Shape Analysis
In this paper we address the problem of shape analysis for concurrent programs. We present new algorithms, based on abstract interpretation, for automatically verifying properties ...
Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Rama...
FLAIRS
2003
13 years 6 months ago
Advantages of Brahms for Specifying and Implementing a Multiagent Human-Robotic Exploration System
We have developed a model-based, distributed architecture that integrates diverse components in a system designed for lunar and planetary surface operations: an astronaut’s spac...
William J. Clancey, Maarten Sierhuis, Charis Kaski...