Filters








63,527 Hits in 4.6 sec

Static Analysis by Incremental Computation in Go Programming [chapter]

K. Nakamura
2004 Advances in Computer Games  
This paper explores how incremental computation is applied to the static analysis in Go programs, and describes two types of analysis and pattern recognition.  ...  Therefore, we introduced the method of incremental computation as an essential feature in Go programming.  ...  He also would like to thank Shuhei Kitoma, Tomomi Miyashita, Hiroyuki Otsuka, and Ayumi Kondo for their help in implementing the ideas and preparing the manuscript.  ... 
doi:10.1007/978-0-387-35706-5_12 fatcat:rpuijybpbrgy7nnrpminvnguga

Static analysis based on formal models and incremental computation in Go programming

Katsuhiko Nakamura
2005 Theoretical Computer Science  
This paper describes some formal models for static analysis, and explores how incremental computation is applied to the static analysis in Go programs.  ...  Computer-Go programs have high computational costs for static analysis, even though most intersections of the board remain unchanged by one move.  ...  Jaap van den Herik and Professor Hiroyuki Iida for their encouragement and help for his research in Go programming, and Dr. Erik van der Werf and the anonymous referees for their helpful comments.  ... 
doi:10.1016/j.tcs.2005.09.046 fatcat:fn6g4tggmbcjpkudegd7hr3pku

GraphIn: An Online High Performance Incremental Graph Processing Framework [chapter]

Dipanjan Sengupta, Narayanan Sundaram, Xia Zhu, Theodore L. Willke, Jeffrey Young, Matthew Wolf, Karsten Schwan
2016 Lecture Notes in Computer Science  
We further propose a property-based, dual-path execution model to choose between incremental or static computation.  ...  Most prior work processes dynamic graphs by first storing the updates and then repeatedly running static graph analytics on saved snapshots.  ...  Evaluation and Analysis (1) Benefits of Incremental graph computation: From Figs. 3a, 4a, and 5a we can observe that, GraphIn achieves maximum speedups of 407×, 40× and 82× over static computation across  ... 
doi:10.1007/978-3-319-43659-3_24 fatcat:ip3ynlf4ozb33o4khogvcz6i3e

Foreword

H. Jaap van den Herik, Hiroyuki Iida
2005 Theoretical Computer Science  
Moreover, we would like to recognize the support by Martine Tiessen during the editing phase of this special issue, in particular during the final stage of preparing this collection of contributions.  ...  Static analysis based on formal models and incremental computation in Go programming by Katsuhiko Nakamura.  ...  The author describes formal models for static analysis and explores how incremental computation is applied.  ... 
doi:10.1016/j.tcs.2005.09.041 fatcat:3frmn4y5qzh5bldjw2ddvlarz4

Incremental Static Analysis of 2D Flow by Inter-Colliding Point-Particles and Use of Incompressible Rhombic Element

Panagis G. Papadopoulos, Christopher G. Koutitas, Panos P. Lazaridis
2016 Open Journal of Civil Engineering  
A simple method is proposed, for incremental static analysis of a set of inter-colliding particles, simulating 2D flow.  ...  In final equilibrium state of liquid, the distribution on hydro-static pressure on vessel boundaries, obtained by proposed computational model, is found in satisfactory approximation with corresponding  ...  Computer Program Based on the above-described algorithm, for incremental static analysis of a set of inter-colliding point-particles, simulating 2D flow, a simple and short computer program ("pocket" program  ... 
doi:10.4236/ojce.2016.63034 fatcat:flezbdrcnzg2dlkskdzooufzpu

A proposed java forward slicing approach

Rana Bader, Basem Alukosh, Mohammad Abdallah, Khalil Awad, Amir Ngah
2020 TELKOMNIKA (Telecommunication Computing Electronics and Control)  
Keywords: Direct and indirect dependency Forward and backward slicing Static slicing This is an open access article under the CC BY-SA license.  ...  Program slicing is one of the best techniques to do so. There are many slicing techniques available to solve such problems such as static slicing, dynamic slicing, and amorphous slicing.  ...  Incremental slicing is a static slicing "that computes a slice in several steps, by incorporating additional types of data dependencies at each step" [15] .  ... 
doi:10.12928/telkomnika.v18i1.12655 fatcat:hj6gy7tvwngxlphe5zfkhn6rya

Static Loop Bound Analysis of C Programs Based on Flow Analysis and Abstract Interpretation

Marianne de Michiel, Armelle Bonenfant, Hugues Cassé, Pascal Sainrat
2008 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications  
In this paper, we propose a static loop bound analysis which associates flow analysis and abstract interpretation.  ...  One of the important steps in processing the worst case execution time (WCET) of a program is to determine the loops upper bounds. Such bounds are crucial when verifying real-time systems.  ...  Method In order to determine loop bounds, we develop a method of static analysis based on the execution flow analysis of C programs and on abstract interpretation.  ... 
doi:10.1109/rtcsa.2008.53 dblp:conf/rtcsa/MichielBCS08 fatcat:pv22x23pebalpfywnovne3kl2i

Programming errors in traversal programs over structured data

Ralf Lämmel, Simon Thompson, Markus Kaiser
2013 Science of Computer Programming  
returns a trivial failure term. • It increments some numbers in the input term more than once.  ...  To use a purposely simple example, consider the transformation problem of "incrementing all numbers in a term". (Clearly, programming errors become more severe with increasing the problem size.)  ...  Acknowledgement Simon Thompson has received support by the Vrije Universiteit, Amsterdam for a related research visit in 2004. The authors received helpful feedback from the LDTA reviewers.  ... 
doi:10.1016/j.scico.2011.11.006 fatcat:fkjnenl3cvaxtcy5balzvcldu4

Programming Errors in Traversal Programs Over Structured Data

Ralf Lämmel, Simon Thompson, Markus Kaiser
2009 Electronical Notes in Theoretical Computer Science  
returns a trivial failure term. • It increments some numbers in the input term more than once.  ...  To use a purposely simple example, consider the transformation problem of "incrementing all numbers in a term". (Clearly, programming errors become more severe with increasing the problem size.)  ...  Acknowledgement Simon Thompson has received support by the Vrije Universiteit, Amsterdam for a related research visit in 2004. The authors received helpful feedback from the LDTA reviewers.  ... 
doi:10.1016/j.entcs.2009.09.045 fatcat:m4bi5rzs3zhmrcdfd5a3scw4cm

Scalable and incremental software bug detection

Scott McPeak, Charles-Henri Gros, Murali Krishna Ramanathan
2013 Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2013  
Work units are created and consumed by an analysis master process that coordinates the multiple analysis passes, the flow of information among them, and incrementalizes the computation.  ...  Previous attempts at reducing the analysis time by adding more resources (CPU, memory) or by splitting the analysis into multiple sub-analyses based on defect detection capabilities resulted in limited  ...  [19] provide a static analysis solution for detecting buffer overflows in C code by modeling string manipulations as a linear program.  ... 
doi:10.1145/2491411.2501854 dblp:conf/sigsoft/McPeakGR13 fatcat:kp2kt6xxznh7nhohy2mirzaoqa

Constructing Hybrid Incremental Compilers for Cross-Module Extensibility with an Internal Build System

Jeff Smits, Gabriël D.P. Konat, Eelco Visser
2020 The Art, Science, and Engineering of Programming  
Knowledge: The resulting compiler is already in use as a replacement of the original whole-program compiler.  ...  We address this problem by developing a compiler design approach that reuses parts of an existing non-incremental compiler to lower the cost of building an incremental compiler.  ...  This research was supported by a gift from the Oracle Corporation and by the NWO VICI Language Designer's Workbench project (639.023.206).  ... 
doi:10.22152/programming-journal.org/2020/4/16 fatcat:irkkwfkbhncupjtnicmkt46dhy

Testing Static Analyzers with Randomly Generated Programs [chapter]

Pascal Cuoq, Benjamin Monate, Anne Pacalet, Virgile Prevosto, John Regehr, Boris Yakobowski, Xuejun Yang
2012 Lecture Notes in Computer Science  
Static analyzers should be correct. We used the random Cprogram generator Csmith, initially intended to test C compilers, to test parts of the Frama-C static analysis platform.  ...  Although Frama-C was already relatively mature at that point, fifty bugs were found and fixed during the process, in the front-end (AST elaboration and typechecking) and in the value analysis, constant  ...  For testing this plug-in, the transformed program is compiled and run, and the computed checksum is compared to the checksum computed by the original program.  ... 
doi:10.1007/978-3-642-28891-3_12 fatcat:56wsztwsbnejdp26tm4olshw7a

A Vision for Online Verification-Validation [article]

Matthew A. Hammer, Bor-Yuh Evan Chang, David Van Horn
2016 arXiv   pre-print
To offer verification for this extensible world, we propose online verification-validation (OVV), which consists of language and VM design that enables a "phaseless" approach to program analysis, in contrast  ...  ., by using common JavaScript libraries).  ...  Implicitly-Incremental Meta-Level Computation.  ... 
arXiv:1608.06012v1 fatcat:mtdhk6ot2ncgpii5anq3afhble

Review of Static Analyzer Service Models

Maxim Aleksandrovich Menshikov
2021 Proceedings of the Institute for System Programming of RAS  
The static program analysis is gradually adopting advanced use cases, and integration with programming tools becomes more necessary than ever.  ...  In this paper, we analyze the models which might be used by the static analyzer to provide its services based on aspects of security, performance, long-term storage.  ...  The incremental operation is possible in case snapshots of the internal state are stored by the static analysis host. • Long-term storage: storing analysis artifacts is also mandatory, the influence on  ... 
doi:10.15514/ispras-2021-33(3)-2 fatcat:dyo5ql4imnbtrjnq2cb4zwcude

Towards Static Analysis of Virtualization-Obfuscated Binaries

Johannes Kinder
2012 2012 19th Working Conference on Reverse Engineering  
Static analysis for computing possible variable values is commonly precise only to the program location.  ...  Virtualization-obfuscation protects a program from manual or automated analysis by compiling it into bytecode for a randomized virtual architecture and attaching a corresponding interpreter.  ...  Figure 2 . 2 Unobfuscated example program and its control flow graph, annotated with abstract states computed by a static interval analysis.  ... 
doi:10.1109/wcre.2012.16 dblp:conf/wcre/Kinder12 fatcat:vqk6zufdgrfhtgbmenb5dilrqm
« Previous Showing results 1 — 15 out of 63,527 results