ICFP 2005 - PDF Preprint Papers

ICFP 2005 International Conference on Functional Programming

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICFP-2005 Paper

click to vote

ICFP
2005
ACM

321views Programming Languages» more ICFP 2005»

Modular verification of concurrent assembly code with dynamic thread creation and termination

14 years 10 months ago

Download flint.cs.yale.edu

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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	321	Modular verification of concurrent assembly code with dynamic thread creation and termination	claim
2	218	A computational approach to reflective meta-reasoning about languages with bindings	claim
3	211	Dynamic optimization for functional reactive programming using generalized algebraic data types	claim
4	177	Associated type synonyms	claim
5	166	PolyAML: a polymorphic aspect-oriented functional programming language	claim
6	155	Combining programming with theorem proving	claim
7	152	Types with semantics: soundness proof assistant	claim
8	145	Monadic augment and generalised short cut fusion	claim
9	145	AtomCaml: first-class atomicity via rollback	claim
10	142	Acute: high-level programming language design for distributed computation	claim
11	139	Translating specifications from nominal logic to CIC with the theory of contexts	claim
12	130	Fast narrowing-driven partial evaluation for inductively sequential programs	claim
13	127	Continuations from generalized stack inspection	claim
14	125	Type inference, principal typings, and let-polymorphism for first-class mixin modules	claim
15	125	Combining higher-order abstract syntax with first-order abstract syntax in ATS	claim
16	118	The anatomy of a loop: a story of scope and control	claim
17	117	Scrap your nameplate: (functional pearl)	claim
18	112	Scrap your boilerplate with class: extensible generic functions	claim
19	112	Simple, partial type-inference for System F based on type-containment	claim
20	105	A unified category-theoretic formulation of typed binding signatures	claim
21	104	Towards a type theory of contexts	claim
22	99	High-level views on low-level representations	claim
23	95	Witnessing side-effects	claim
24	94	A formal treatment of the barendregt variable convention in rule inductions	claim
25	93	A language-based approach to functionally correct imperative programming	claim
26	92	Aspectual Caml: an aspect-oriented functional language	claim
27	92	Toward a general theory of names: binding and scope	claim
28	91	Qualified types for MLF	claim
29	90	A step-indexed model of substructural state	claim
30	88	A principled approach to operating system construction in Haskell	claim
31	86	A logical analysis of aliasing in imperative higher-order functions	claim
32	84	Recursive type generativity	claim
33	76	An expressive language of signatures	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers