Sciweavers

1313 search results - page 247 / 263
» Prioritized Reasoning in Logic Programming
Sort
View
164
Voted
PLPV
2010
ACM
16 years 25 days ago
Singleton types here, singleton types there, singleton types everywhere
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...
Stefan Monnier, David Haguenauer
SIGADA
2004
Springer
15 years 9 months ago
Enforcing security and safety models with an information flow analysis tool
Existing security models require that information of a given security level be prevented from “leaking” into lower-security information. High-security applications must be dem...
Roderick Chapman, Adrian Hilton
PLDI
2003
ACM
15 years 9 months ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
PLDI
2003
ACM
15 years 9 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
158
Voted
MAM
2007
157views more  MAM 2007»
15 years 3 months ago
Executing large algorithms on low-capacity FPGAs using flowpath partitioning and runtime reconfiguration
This paper describes a new method of executing a software program on an FPGA for embedded systems. Rather than combine reconfigurable logic with a microprocessor core, this method...
Darrin M. Hanna, Michael DuChene