Sciweavers

325 search results - page 54 / 65
» Proofs of Restricted Shuffles
Sort
View
TII
2010
146views Education» more  TII 2010»
13 years 4 months ago
A Flexible Design Flow for Software IP Binding in FPGA
Software intellectual property (SWIP) is a critical component of increasingly complex field programmable gate arrays (FPGA)-based system-on-chip (SOC) designs. As a result, develop...
Michael A. Gora, Abhranil Maiti, Patrick Schaumont
POPL
2003
ACM
14 years 10 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...
ICFP
2005
ACM
14 years 9 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
APLAS
2006
ACM
14 years 3 months ago
A Bytecode Logic for JML and Types
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
Lennart Beringer, Martin Hofmann
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
14 years 3 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond