Filters








136 Hits in 4.0 sec

Trace-based control-flow analysis

Benoît Montagu, Thomas Jensen
2021 Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation  
We define a small-step semantics for the untyped λ-calculus, that traces the β-reductions that occur during evaluation.  ...  We define ∇CFA, a widening-based analysis that limits the cycles in call stacks, and can achieve better precision than -CFA at a similar cost.  ...  This semantics is then abstracted in order to obtain a closure analysis that approximates the control flow of the program.  ... 
doi:10.1145/3453483.3454057 fatcat:hpnb2jttn5anbpg6sd4bhwtxcq

Abstracting Abstract Machines: A Systematic Approach to Higher-Order Program Analysis [article]

David Van Horn, Matthew Might
2011 arXiv   pre-print
What analysis designers need is a principled method for navigating the gap between semantics and analytic models: analysis designers need a method that tames the interaction of complex languages features  ...  , and even garbage collection.  ...  ACKNOWLEDGMENTS We thank Matthias Felleisen, Jan Midtgaard, Sam Tobin-Hochstadt, and Mitchell Wand for discussions, and the anonymous reviewers of ICFP'10 for their close reading and helpful critiques;  ... 
arXiv:1105.1743v1 fatcat:sf2vmzg3nfh5vlrpjexlzhbkga

Particpants' Proceedings on the Workshop: Types for Program Analysis

Hanne Riis Nielson, Kirsten Lackner Solberg
1995 DAIMI Report Series  
<p>As a satellite meeting of the TAPSOFT'95 conference we organized a small workshop on program analysis.  ...  The title of the workshop, "Types for Program Analysis´´, was motivated by the recent trend of letting the presentation and development of program analyses be influenced by annotated type systems, effect  ...  control-flow analysis via polymorphic splitting.  ... 
doi:10.7146/dpb.v24i493.7021 fatcat:lmukdqmlbfabppmrrnczbslyxe

Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators

Stefan Holdermans, Jurriaan Hage
2010 SIGPLAN notices  
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism.  ...  As flow typing is archetypical to a whole class of type and effect systems, our approach can be used to boost the precision of a wide range of type-based program analyses for higher-order languages.  ...  The authors would like to thank Arie Middelkoop and Jeroen Weijers for their helpful comments on a draft of this paper, and the anonymous reviewers for their insightful feedback on the submitted version  ... 
doi:10.1145/1932681.1863554 fatcat:lfj7biojorgt5mowiaxpx65c2m

Abstracting abstract machines

David Van Horn, Matthew Might
2010 SIGPLAN notices  
even garbage collection.  ...  For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses  ...  Acknowledgments: We thank Matthias Felleisen, Jan Midtgaard, and Sam Tobin-Hochstadt for discussions and suggestions.  ... 
doi:10.1145/1932681.1863553 fatcat:zupwxrjpgjdzpf6tyqllnpesxe

Abstracting abstract machines

David Van Horn, Matthew Might
2011 Communications of the ACM  
even garbage collection.  ...  For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses  ...  Acknowledgments: We thank Matthias Felleisen, Jan Midtgaard, and Sam Tobin-Hochstadt for discussions and suggestions.  ... 
doi:10.1145/1995376.1995400 fatcat:zxmjehncnrfqdp4zwijasn5u7a

Abstracting Abstract Machines [article]

David Van Horn, Matthew Might
2010 arXiv   pre-print
even garbage collection.  ...  For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses  ...  Acknowledgments: We thank Matthias Felleisen, Jan Midtgaard, and Sam Tobin-Hochstadt for discussions and suggestions.  ... 
arXiv:1007.4446v2 fatcat:lrf375hox5htxdwuwevpqd2wre

Abstracting abstract machines

David Van Horn, Matthew Might
2010 Proceedings of the 15th ACM SIGPLAN international conference on Functional programming - ICFP '10  
even garbage collection.  ...  For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses  ...  Acknowledgments: We thank Matthias Felleisen, Jan Midtgaard, and Sam Tobin-Hochstadt for discussions and suggestions.  ... 
doi:10.1145/1863543.1863553 dblp:conf/icfp/HornM10 fatcat:liy6ejmwmjbw5ptitjll42kxzi

Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators

Stefan Holdermans, Jurriaan Hage
2010 Proceedings of the 15th ACM SIGPLAN international conference on Functional programming - ICFP '10  
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism.  ...  As flow typing is archetypical to a whole class of type and effect systems, our approach can be used to boost the precision of a wide range of type-based program analyses for higher-order languages.  ...  The authors would like to thank Arie Middelkoop and Jeroen Weijers for their helpful comments on a draft of this paper, and the anonymous reviewers for their insightful feedback on the submitted version  ... 
doi:10.1145/1863543.1863554 dblp:conf/icfp/HoldermansH10 fatcat:q3jsirvqjzb4zhlbfp4tvuwohq

Systematic abstraction of abstract machines

DAVID VAN HORN, MATTHEW MIGHT
2012 Journal of functional programming  
garbage collection.  ...  For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique of store-allocated continuations, leads to machines that abstract into static analyses simply  ...  We thank Greg Morrisett for valuable feedback on this work for Communications of the ACM and we are grateful to Olivier Danvy and Jan Midtgaard for writing a lucid technical perspective for CACM.  ... 
doi:10.1017/s0956796812000238 fatcat:looe6lgksnelnhuq4tbybaykli

Systematic Abstraction of Abstract Machines [article]

David Van Horn, Matthew Might
2011 arXiv   pre-print
even garbage collection.  ...  For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique of store-allocated continuations, leads to machines that abstract into static analyses simply  ...  We are grateful to Olivier Danvy and Jan Midtgaard for writing a lucid technical perspective on this work for Communications of the ACM.  ... 
arXiv:1107.3539v1 fatcat:k36y7odo6vgn5j5ipiyw7moqli

From Polyvariant flow information to intersection and union types

JENS PALSBERG, CHRISTINA PAVLOPOULOU
2001 Journal of functional programming  
We use the theorem as basis for a new flow-type system in the spirit of the λ CIL -calculus of Wells, Dimock, Muller, and Turbak, in which types are annotated with flow information.  ...  A flow-type system is useful as an interface between a flowanalysis algorithm and a program optimizer.  ...  We thank Mitchell Wand for many discussions on polyvariant flow analysis.  ... 
doi:10.1017/s095679680100394x fatcat:h4ddsoodafajrfjjom4a2nqmji

From polyvariant flow information to intersection and union types

Jens Palsberg, Christina Pavlopoulou
1998 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98  
We use the theorem as basis for a new flow-type system in the spirit of the λ CIL -calculus of Wells, Dimock, Muller, and Turbak, in which types are annotated with flow information.  ...  A flow-type system is useful as an interface between a flowanalysis algorithm and a program optimizer.  ...  We thank Mitchell Wand for many discussions on polyvariant flow analysis.  ... 
doi:10.1145/268946.268963 dblp:conf/popl/PalsbergP98 fatcat:4drw44vsmjbspjo7uagx4t73ki

Optimizing abstract abstract machines

J. Ian Johnson, Nicholas Labich, Matthew Might, David Van Horn
2013 Proceedings of the 18th ACM SIGPLAN international conference on Functional programming - ICFP '13  
This article contributes a complementary step-by-step process for subsequently going from a naive analyzer derived under the AAM approach, to an efficient and correct implementation.  ...  The technique of abstracting abstract machines (AAM) provides a systematic approach for deriving computable approximations of evaluators that are easily proved sound.  ...  Acknowledgments We thank Suresh Jagannathan for providing source code to the polymorphic splitting analyzer [31] and Ilya Sergey for the introspective pushdown analyzer [9] .  ... 
doi:10.1145/2500365.2500604 dblp:conf/icfp/JohnsonLMH13 fatcat:oqfftpsyyzfbjgyweeloyuj7gy

Topologies, Continuity and Bisimulations

J. M. Davoren
1999 RAIRO - Theoretical Informatics and Applications  
We give a topological characterization of bisimularity for preorders, and then use the topology as a route to examining the algebraic semantics for the µ-calculus, developed in recent work of Kwiatkowska  ...  Of late, it has come to take a particular significance in work on the formal analysis and verification of hybrid control systems, where system properties are expressible by formulas of the modal µ-calculus  ...  Our analysis of bisimulation preorders leads to a simple condition for semantic agreement. Proof.  ... 
doi:10.1051/ita:1999123 fatcat:4jmkakzrkrgebftotagvu7ll4e
« Previous Showing results 1 — 15 out of 136 results