Sciweavers

Share
POPL
2006
ACM
10 years 1 months ago
Why dependent types matter
We exhibit the rationale behind the design of Epigram, a dependently typed programming language and interactive program development system, using refinements of a well known progr...
James McKinna
POPL
2006
ACM
10 years 1 months ago
Autolocker: synchronization inference for atomic sections
The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. T...
Bill McCloskey, Feng Zhou, David Gay, Eric A. Brew...
POPL
2006
ACM
10 years 1 months ago
The essence of command injection attacks in web applications
Web applications typically interact with a back-end database to retrieve persistent data and then present the data to the user as dynamically generated output, such as HTML web pa...
Zhendong Su, Gary Wassermann
POPL
2006
ACM
10 years 1 months ago
Interruptible iterators
Jed Liu, Aaron Kimball, Andrew C. Myers
POPL
2006
ACM
10 years 1 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
POPL
2006
ACM
10 years 1 months ago
A polymorphic modal type system for lisp-like multi-staged languages
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
Ik-Soon Kim, Kwangkeun Yi, Cristiano Calcagno
POPL
2006
ACM
10 years 1 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
POPL
2006
ACM
10 years 1 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
POPL
2006
ACM
10 years 1 months ago
On flow-sensitive security types
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
Sebastian Hunt, David Sands
POPL
2006
ACM
10 years 1 months ago
Simplifying reductions
We present optimization techniques for high level equational programs that are generalizations of affine control loops (ACLs). Significant parts of the SpecFP and PerfectClub benc...
Gautam Gupta, Sanjay V. Rajopadhye
books