Sciweavers

797 search results - page 89 / 160
» Eliminating Proofs from Programs
Sort
View
LPNMR
2009
Springer
14 years 4 months ago
A Deductive System for FO(ID) Based on Least Fixpoint Logic
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
Ping Hou, Marc Denecker
CCS
2008
ACM
13 years 12 months ago
On the protocol composition logic PCL
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
Cas J. F. Cremers
ESOP
2003
Springer
14 years 3 months ago
Modeling Web Interactions
Programmers confront a minefield when they design interactive Web programs. Web interactions take place via Web browsers. With browsers, consumers can whimsically navigate among t...
Paul T. Graunke, Robert Bruce Findler, Shriram Kri...
IPPS
2006
IEEE
14 years 4 months ago
A code motion technique for accelerating general-purpose computation on the GPU
Recently, graphics processing units (GPUs) are providing increasingly higher performance with programmable internal processors, namely vertex processors (VPs) and fragment process...
T. Ikeda, Fumihiko Ino, Kenichi Hagihara
MICRO
2000
IEEE
133views Hardware» more  MICRO 2000»
14 years 2 months ago
Compiler controlled value prediction using branch predictor based confidence
Value prediction breaks data dependencies in a program thereby creating instruction level parallelism that can increase program performance. Hardware based value prediction techni...
Eric Larson, Todd M. Austin