Sciweavers

967 search results - page 31 / 194
» Building a Calculus of Data Structures
Sort
View
AMAST
2008
Springer
13 years 9 months ago
Explaining Verification Conditions
The Hoare approach to program verification relies on the construction and discharge of verification conditions (VCs) but offers no support to trace, analyze, and understand the VCs...
Ewen Denney, Bernd Fischer 0002
IEEEPACT
2005
IEEE
14 years 1 months ago
Dual-Core Execution: Building a Highly Scalable Single-Thread Instruction Window
Current integration trends embrace the prosperity of single-chip multi-core processors. Although multi-core processors deliver significantly improved system throughput, single-thr...
Huiyang Zhou
POPL
2010
ACM
14 years 5 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
P2P
2005
IEEE
14 years 1 months ago
Heterogeneity-Aware Distributed Access Structure
Efficient access to distributed and dynamic multidimensional data is vital for applications in large, heterogeneous, decentralised, resource-sharing environments such as Grids an...
Alejandra González Beltrán, Peter Mi...
CADE
2007
Springer
14 years 8 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur