Sciweavers

3333 search results - page 40 / 667
» Abstract Proof Search
Sort
View
TPHOL
2007
IEEE
15 years 4 months ago
Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
Brigitte Pientka
ICFP
1999
ACM
15 years 2 months ago
Principals in Programming Languages: A Syntactic Proof Technique
Programs are often structured around the idea that different pieces of code comprise distinct principals, each with a view of its environment. Typical examples include the module...
Steve Zdancewic, Dan Grossman, J. Gregory Morriset...
CAV
1998
Springer
108views Hardware» more  CAV 1998»
15 years 2 months ago
Decomposing the Proof of Correctness of pipelined Microprocessors
We present a systematic approach to decompose and incrementally build the proof of correctness of pipelined microprocessors. The central idea is to construct the abstraction funct...
Ravi Hosabettu, Mandayam K. Srivas, Ganesh Gopalak...
TPHOL
2000
IEEE
15 years 2 months ago
Proof Terms for Simply Typed Higher Order Logic
Abstract. This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and re...
Stefan Berghofer, Tobias Nipkow
PODC
1987
ACM
15 years 1 months ago
Hierarchical Correctness Proofs for Distributed Algorithms
Abstract: We introduce the input-output automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular...
Nancy A. Lynch, Mark R. Tuttle