POPL 2010 - PDF Preprint Papers

POPL 2010 Annual Symposium on Principles of Programming Languages

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed POPL-2010 Paper

click to vote

POPL
2010
ACM

303views Programming Languages» more POPL 2010»

Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification

14 years 8 months ago

Download www.kb.ecei.tohoku.ac.jp

We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...

Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno

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	303	Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification	claim
2	285	Reconfigurable asynchronous logic automata: (RALA)	claim
3	265	On the Verification Problem for Weak Memory Models	claim
4	264	Dependent types and program equivalence	claim
5	263	A Relational Modal Logic for Higher-Order Stateful ADTs	claim
6	262	Lightweight asynchrony using parasitic threads	claim
7	251	Nominal System T	claim
8	248	Dependent Types from Counterexamples	claim
9	246	Toward a Verified Relational Database Management System	claim
10	238	Dynamically Checking Ownership Policies in Concurrent C/C++ Programs	claim
11	237	Static Determination of Quantitative Resource Usage for Higher-Order Programs	claim
12	236	Efficient parallel programming in Poly/ML and Isabelle/ML	claim
13	234	Low-Level Liquid Types	claim
14	231	From Program Verification to Program Synthesis	claim
15	227	Contracts Made Manifest	claim
16	225	Ypnos: declarative, parallel structured grid programming	claim
17	224	Modular Verification of Security Protocol Code by Typing	claim
18	223	Pure Subtype Systems	claim
19	218	Monads in Action	claim
20	218	Programming with angelic nondeterminism	claim
21	212	A Verified Compiler for an Impure Functional Language	claim
22	211	Automatically Generating Instruction Selectors Using Declarative Machine Descriptions	claim
23	207	Nested interpolants	claim
24	206	Paralocks : Role-Based Information Flow Control and Beyond	claim
25	204	Structuring the verification of heap-manipulating programs	claim
26	201	Verified just-in-time compiler on x86	claim
27	199	Continuity Analysis of Programs	claim
28	199	Compress-and-conquer for optimal multicore computing	claim
29	195	Semantics and Algorithms for Data-dependent Grammars	claim
30	194	A Theory of Indirection via Approximation	claim
31	192	Counterexample-Guided Focus	claim
32	192	Type inference for datalog with complex type hierarchies	claim
33	190	Sequential Verification of Serializability	claim
34	190	Program Analysis via Satisfiability Modulo Path Programs	claim
35	188	Decision Procedures for Algebraic Data Types with Abstractions	claim
36	188	Integrating Typed and Untyped Code in a Scripting Language	claim
37	188	Generating Compiler Optimizations from Proofs	claim
38	186	Coarse-Grained Transactions	claim
39	186	Modular Session Types for Distributed Object-Oriented Programming	claim
40	177	Compositional May-Must Program Analysis: Unleashing the Power of Alternation	claim
41	176	A simple, verified validator for software pipelining	claim
42	176	Automatic Numeric Abstractions for Heap-Manipulating Programs	claim
43	176	Abstraction-guided synthesis of synchronization	claim
44	175	Threesomes, With and Without Blame	claim
45	173	Parallelizing constraint programs	claim
46	163	S-Net for multi-memory multicores	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers