Sciweavers

989 search results - page 96 / 198
» Pebbling and Proofs of Work
Sort
View
VL
1996
IEEE
125views Visual Languages» more  VL 1996»
14 years 8 days ago
Teaching Binary Tree Algorithms through Visual Programming
In this paper, we show how visual programming can be used to teach binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating tree fra...
Amir Michail
AADEBUG
1993
Springer
14 years 7 days ago
Slicing Programs with Arbitrary Control-flow
Program slicing is a program transformation that is useful in program debugging, program maintenance, and other applications that involve understanding program behavior. Given a p...
Thomas Ball, Susan Horwitz
ITP
2010
155views Mathematics» more  ITP 2010»
14 years 1 days ago
A Trustworthy Monadic Formalization of the ARMv7 Instruction Set Architecture
Abstract. This paper presents a new HOL4 formalization of the current ARM instruction set architecture, ARMv7. This is a modern RISC architecture with many advanced features. The f...
Anthony C. J. Fox, Magnus O. Myreen
RTA
2010
Springer
14 years 20 hour ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
HASE
2007
IEEE
14 years 10 hour ago
Multiple Pre/Post Specifications for Heap-Manipulating Methods
Automated verification plays an important role for high assurance software. This typically uses a pair of pre/post conditions as a formal (but possibly partial) specification of e...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...