Sciweavers

1071 search results - page 46 / 215
» Programming with enumerable sets of structures
Sort
View
96
Voted
DAC
2010
ACM
15 years 1 months ago
An efficient dual algorithm for vectorless power grid verification under linear current constraints
Vectorless power grid verification makes it possible to evaluate worst-case voltage drops without enumerating possible current waveforms. Under linear current constraints, the vec...
Xuanxing Xiong, Jia Wang
77
Voted
CSL
2007
Springer
15 years 6 months ago
Classical Program Extraction in the Calculus of Constructions
We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...
Alexandre Miquel
CADE
2005
Springer
16 years 24 days ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill
ISPASS
2009
IEEE
15 years 7 months ago
Experiment flows and microbenchmarks for reverse engineering of branch predictor structures
Insights into branch predictor organization and operation can be used in architecture-aware compiler optimizations to improve program performance. Unfortunately, such details are ...
Vladimir Uzelac, Aleksandar Milenkovic
85
Voted
ICALP
1999
Springer
15 years 4 months ago
Online Data Structures in External Memory
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
Jeffrey Scott Vitter