Filters








89 Hits in 1.9 sec

The Interprocedural Express-Lane Transformation [chapter]

David Melski, Thomas Reps
2003 Lecture Notes in Computer Science  
Section 4.1 discusses the effects of the various express-lane transformations on interprocedural range analysis.  ...  Our experiments show that optimization based on an interprocedural express-lane transformation does benefit performance, though usually not enough to overcome the costs of the transformation.  ...  Strategy 1 is based on the Coarsest Partitioning Algorithm [1, 11] . 2. Strategy 2 preserves all data-flow facts.  ... 
doi:10.1007/3-540-36579-6_15 fatcat:jgii6ott3nf2ld4lpsekcwodiy

Interprocedural analyses: a comparison

Helmut Seidl, Christian Fecht
2000 The Journal of Logic Programming  
Our framework is based on a small-step operational semantics and subsumes both frameworks for imperative and for logic languages.  ...  We present a framework for program analysis of languages with procedures which is general enough to allow for a comparison of various approaches to interprocedural analysis.  ...  analysis of imperative languages, as well as the anonymous referees for numerous valuable comments on earlier drafts and important pointers to the literature.  ... 
doi:10.1016/s0743-1066(99)00058-8 fatcat:dr53bgkxmfa6zdzmatu7hkyaoq

MOPS

Hao Chen, David Wagner
2002 Proceedings of the 9th ACM conference on Computer and communications security - CCS '02  
Because manual verification is too expensive, we have built a program analysis tool to automate this process.  ...  The major advantages of this approach are that it is sound in verifying the absence of certain classes of vulnerabilities, that it is fully interprocedural, and that it is efficient and scalable.  ...  Second, because it fully supports interprocedural analysis and because interprocedural bugs are more elusive than intraprocedural ones, MOPS promises to complement manual auditing where an automated tool  ... 
doi:10.1145/586139.586142 fatcat:j7vthesr2rh6rlkznpuqy3lqfa

The analysis and design of architecture systems for speech recognition on modern handheld-computing devices

Andreas Hagen, Daniel A. Connors, Bryan L. Pellom
2003 Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign & system synthesis - CODES+ISSS '03  
We evaluate the University of Colorado Sonic speech recognition software on the IMPACT architectural simulator and compiler framework.  ...  Embedded systems have more stringent constraints on cost and power consumption that lead to design bottlenecks for many computationallyintensive applications.  ...  Profiling information was also used for improved optimization, and the use of inlining/interprocedural analysis improved the base code performance by 10%.  ... 
doi:10.1145/944645.944661 dblp:conf/codes/HagenCP03 fatcat:zkfdf5bmzndylo53lmhw4srob4

The analysis and design of architecture systems for speech recognition on modern handheld-computing devices

Andreas Hagen, Daniel A. Connors, Bryan L. Pellom
2003 Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign & system synthesis - CODES+ISSS '03  
We evaluate the University of Colorado Sonic speech recognition software on the IMPACT architectural simulator and compiler framework.  ...  Embedded systems have more stringent constraints on cost and power consumption that lead to design bottlenecks for many computationallyintensive applications.  ...  Profiling information was also used for improved optimization, and the use of inlining/interprocedural analysis improved the base code performance by 10%.  ... 
doi:10.1145/944658.944661 fatcat:y3dbmsb3hrakfixhrigzxuhgma

Pushdown Control-Flow Analysis of Higher-Order Programs [article]

Christopher Earl, Matthew Might, David Van Horn
2010 arXiv   pre-print
One instantiation of this framework marks the first polyvariant pushdown analysis of higher-order programs; another marks the first polynomial-time analysis.  ...  Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites---a property that eliminates spurious interprocedural paths.  ...  As an infinite-state system, a PDA-based abstraction preserves more information than a classical finite-state analysis.  ... 
arXiv:1007.4268v1 fatcat:7lhbwmzqqfahhezs755ai4pvti

Faster Algorithms for Weighted Recursive State Machines [chapter]

Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis
2017 Lecture Notes in Computer Science  
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis.  ...  ., interprocedural reachability and dataflow analysis problems. Our main contributions are new algorithms for several fundamental problems.  ...  Introduction Interprocedural analysis. One of the classical algorithmic analysis problems in programming languages is the interprocedural analysis.  ... 
doi:10.1007/978-3-662-54434-1_11 fatcat:m5do7fcslbbrbptcxcwrob452y

Enhancing Compiler Techniques for Memory Energy Optimizations [chapter]

Joseph Zambreno, Mahmut Taylan Kandemir, Alok Choudhary
2002 Lecture Notes in Computer Science  
Much research has focused on the memory subsystems of these devices since they are a leading energy consumer.  ...  Used in conjunction with these four optimization modes is the -IPA flag that turns on the interprocedural analysis optimizations, which include function inlining, interprocedural constant propagation,  ...  On average, compiling with the -IPA flag leads to a code size that is 19% larger as compared to the same level of optimization without interprocedural analysis.  ... 
doi:10.1007/3-540-45828-x_27 fatcat:drwwgbv5x5hnfptnz2i7agcrwy

Subcubic Certificates for CFL Reachability [article]

Dmitry Chistikov and Rupak Majumdar and Philipp Schepper
2021 arXiv   pre-print
Many problems in interprocedural program analysis can be modeled as the context-free language (CFL) reachability problem on graphs and can be solved in cubic time.  ...  The certificates are based on grammar-based compression of paths (for positive instances) and on invariants represented as matrix constraints (for negative instances).  ...  Introduction Context-free reachability is a fundamental problem in interprocedural program analysis, verification of recursive programs, and database theory [20, 56, 38, 43, 8] .  ... 
arXiv:2102.13095v1 fatcat:j6z6kddsc5cylma35j733n7mdq

Faster Algorithms for Weighted Recursive State Machines [article]

Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis
2017 arXiv   pre-print
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis.  ...  ., interprocedural reachability and dataflow analysis problems. Our main contributions are new algorithms for several fundamental problems.  ...  Introduction Interprocedural analysis. One of the classical algorithmic analysis problems in programming languages is the interprocedural analysis.  ... 
arXiv:1701.04914v1 fatcat:xtmgz2yiwvav5j4d52eaccsotq

Mining API patterns as partial orders from source code

Mithun Acharya, Tao Xie, Jian Pei, Jun Xu
2007 Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering - ESEC-FSE '07  
We adapt a model checker to generate interprocedural control-flow-sensitive static traces related to the APIs of interest.  ...  Our experience of applying the framework on 72 X11 clients with 200K LOC in total has shown that the extracted API partial orders are useful in assisting effective API reuse and checking.  ...  This mechanism is based on an assumption [4, 8, 27 ] that a client generally uses an API or a set of APIs correctly most of the times.  ... 
doi:10.1145/1287624.1287630 dblp:conf/sigsoft/AcharyaXPX07 fatcat:bl7t3amwnfdq3kpko4esostfae

Distributed execution for resource-constrained mobile consumer devices

Seonggun Kim, Heungsoon Rim, Hwansoo Han
2009 IEEE transactions on consumer electronics  
Since the modified bytecode is still a legal Java bytecode, mobile devices can download and run the modified bytecode on standard JVMs, cooperating with surrogate servers.  ...  Using a similar approach to J-Orchestra [3] , we can determine the methods to stay at the client side based on the call graph analysis.  ...  Based on the field access analysis described in the previous section, the serialized arguments only include the values to be used in the offloaded method and its descendant methods.  ... 
doi:10.1109/tce.2009.5174397 fatcat:wt6auybnrbfv3m3fglpglgambq

Pushdown flow analysis with abstract garbage collection

J. IAN JOHNSON, ILYA SERGEY, CHRISTOPHER EARL, MATTHEW MIGHT, DAVID VAN HORN
2014 Journal of functional programming  
collection, on the other hand, needs full access to the entire stack to compute a root set, just as concrete collection does.  ...  Pushdown flow analysis grants unbounded yet computable polyvariance to the analysis of return-flow in higher-order programs.  ...  Interprocedural dependence analysis In interprocedural dependence analysis, the goal is to determine, for each λ -term, the set of resources which it may read or write when it is called.  ... 
doi:10.1017/s0956796814000100 fatcat:wrkxdigcibdfdoy6i3axm6blhq

Testing Inter-layer and Inter-task Interactions in RTES Applications

Ahyoung Sung, Witawas Srisa-an, Gregg Rothermel, Tingting Yu
2010 2010 Asia Pacific Software Engineering Conference  
Thus, many kernels schedule tasks based on priority assignment. The HAL is a runtime system that manages device drivers and provides interfaces by which higher level software  ...  and user tasks; this is the first work to address RTES dependability in this context; (2) while our testing techniques build on existing dataflow analysis and testing approaches, we adapt them to solve  ...  An ICFG [31, 33] is a model of a system's control flow that can support interprocedural dataflow analysis.  ... 
doi:10.1109/apsec.2010.38 dblp:conf/apsec/SungSRY10 fatcat:5tvelgowovecjdzjqgox3ptmzq

Checking conformance of a producer and a consumer

Evan Driscoll, Amanda Burton, Thomas Reps
2011 Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering - SIGSOFT/FSE '11  
The trade-offs between VPAS and FAs mirror trade-offs that one can make in traditional interprocedural dataflow analysis.  ...  During the inference phase, PCCA uses CodeSurfer/C [10] to per-form pointer analysis and build an interprocedural controlflow graph (ICFG) and call graph for each component.  ... 
doi:10.1145/2025113.2025132 dblp:conf/sigsoft/DriscollBR11 fatcat:o5o4x2ctz5frfcqzaktbovlpvu
« Previous Showing results 1 — 15 out of 89 results