Filters








5 Hits in 7.6 sec

Separation logic and abstraction

Matthew Parkinson, Gavin Bierman
2005 Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages - POPL '05  
This provides a flexible mechanism for reasoning about the different forms of abstraction found in modern programming languages, such as abstract datatypes and objects.  ...  We build on the formalism of separation logic and introduce the new notion of an abstract predicate and, more generally, abstract predicate families.  ...  Acknowledgements We should like to thank Peter O'Hearn for insightful comments on earlier versions of this work and proposing the malloc and free example; and Andrew Pitts, Alisdair Wren and the anonymous  ... 
doi:10.1145/1040305.1040326 dblp:conf/popl/ParkinsonB05 fatcat:5upqke663naixktykflnibpbuq

Slot games

Dan R. Ghica
2005 Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages - POPL '05  
We present a games-based denotational semantics for a quantitative analysis of programming languages.  ...  We develop a slot-game model for the language Idealised Concurrent Algol by instrumenting the strategies in its HO game model with token actions.  ...  Acknowledgements The author is indebted to Jakob Rehof for his helpful suggestions.  ... 
doi:10.1145/1040305.1040313 dblp:conf/popl/Ghica05 fatcat:jacmcuzywzeszjydrk5lfvixhm

Parametric polymorphism for XML

Haruo Hosoya, Alain Frisch, Giuseppe Castagna
2005 Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages - POPL '05  
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated.  ...  We exploit this interpretation in every ingredient of our polymorphic type system such as subtyping, inference of type arguments, and so on.  ...  We thank anonymous referees of POPL'05 whose comments and suggestions have greatly improved the presentation of this paper.  ... 
doi:10.1145/1040305.1040310 dblp:conf/popl/HosoyaFC05 fatcat:hd5l736zlvdwxgauj5qy37xigi

Automated soundness proofs for dataflow analyses and transformations via local rules

Sorin Lerner, Todd Millstein, Erika Rice, Craig Chambers
2005 Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages - POPL '05  
We have implemented a soundness checker for Rhodium and have specified and automatically proven the soundness of all of Cobalt's optimizations plus a variety of optimizations not expressible in Cobalt,  ...  We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound.  ...  We would also like to thank Dan Grossman, Alexandru Sȃlcianu, and the anonymous re-viewers for their useful suggestions on how to improve the paper.  ... 
doi:10.1145/1040305.1040335 dblp:conf/popl/LernerMRC05 fatcat:kbghd4yafzctpog6zp6qnq5xgq

Automating Abstract Interpretation of Abstract Machines [article]

James Ian Johnson
2015 arXiv   pre-print
The prevalence of scripting languages in the world suggests programming language interpreters are relatively easy to write.  ...  Users of these languages lament their inability to analyze their code, therefore programming language analyzers are not easy to write.  ...  In Jens Palsberg and Martín Abadi, editors, Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, Long Beach, California, USA, January 12-14, 2005,  ... 
arXiv:1504.08033v1 fatcat:qoppf36sxfhpto7avqoeebauda