Filters








8,481 Hits in 3.9 sec

Timestamped whole program path representation and its applications

Youtao Zhang, Rajiv Gupta
2001 Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation - PLDI '01  
A whole program path (WPP) is a complete control flow trace of a program's execution.  ...  To solve this problem we advocate the application of compaction techniques aimed at providing easy access to path traces on a per function basis.  ...  [ COMPACTION ALGORITHM As mentioned earlier, a whole program path (WPP) is a complete control flow trace of a program execution. Consider the program and a sample WPP shown in Figure 1 .  ... 
doi:10.1145/378795.378835 dblp:conf/pldi/ZhangG01 fatcat:z4rybzte3bfkfhgw2aorvltuae

Whole execution traces and their applications

Xiangyu Zhang, Rajiv Gupta
2005 ACM Transactions on Architecture and Code Optimization (TACO)  
We present two applications of WETs, dynamic program slicing and dynamic version matching, which make effective use of multiple kinds of profile information contained in WETs.  ...  The key features of our WET representation are: WET is constructed by labeling a static program representation with profile information such that relevant and related profile information can be directly  ...  In this paper we present an unified representation and show that it is possible to maintain and make use of such a representation.  ... 
doi:10.1145/1089008.1089012 fatcat:72oajob6dresbhv7vt472jvp6u

Extended whole program paths

S. Tallam, R. Gupta, Xiangyu Zhang
2005 14th International Conference on Parallel Architectures and Compilation Techniques (PACT'05)  
We describe the design, generation and compression of the extended whole program path (eWPP) representation that not only captures the control flow history of a program execution but also its data dependence  ...  The code for the checks is designed to minimize the increase in the program execution time and the extended control flow trace size when compared to directly collecting control flow and dependence traces  ...  Acknowledgements: We would like to especially thank Hoi Vo of Microsoft Corp. for his support in both obtaining and using the Phoenix Research Development Kit (RDK).  ... 
doi:10.1109/pact.2005.22 dblp:conf/IEEEpact/TallamGZ05 fatcat:c2dcyz24gzblxghitwdpfz2lau

Unified control flow and data dependence traces

Sriraman Tallam, Rajiv Gupta
2007 ACM Transactions on Architecture and Code Optimization (TACO)  
We describe the design, generation, and compression of the extended whole program path (eWPP), representation that not only captures the control flow history of a program execution but also its data dependence  ...  The code for the checks is designed to minimize the increase in program execution time and the extended control flow trace size when compared to directly collecting control flow and address traces.  ...  ACKNOWLEDGMENTS We would like to especially thank Hoi Vo of Microsoft Corp. for his support in both obtaining and using the Phoenix Research Development Kit (RDK).  ... 
doi:10.1145/1275937.1275943 fatcat:vwjgcqbadrdb7o64s5me5mjmkq

MG++: Memory graphs for analyzing dynamic data structures

Vineet Singh, Rajiv Gupta, Iulian Neamtiu
2015 2015 IEEE 22nd International Conference on Software Analysis, Evolution, and Reengineering (SANER)  
Experiments studying the time and space efficiency for real-world programs show that MG++ representation is space-efficient and the time overhead for MG++ construction algorithm is practical.  ...  We present a new memory graph representation, MG++, and a memory graph construction algorithm, that greatly enhance the utility of memory graphs.  ...  The experiments indicate that the representation and construction technique are practical, efficient, and effective in real-world applications.  ... 
doi:10.1109/saner.2015.7081839 dblp:conf/wcre/SinghGN15 fatcat:gsv3y6urafbgpcarcnwcbmttce

Extracting Critical Path Graphs from MPI Applications

Martin Schulz
2005 Proceedings IEEE International Conference on Cluster Computing  
We have developed a toolset that identifies the critical path of MPI applications, extracts it, and then produces a graphical representation of the corresponding program execution graph to visualize it  ...  The critical path is one of the fundamental runtime characteristics of a parallel program. It identifies the longest execution sequence without wait delays.  ...  The graph form has the further advantage, in contrast to profiling data or tabular representations, that it retains much of the structural information of the initial application execution and with that  ... 
doi:10.1109/clustr.2005.347035 dblp:conf/cluster/Schulz05 fatcat:px2p3wlt5jae7ffhtykjl2mtaq

Timestamp Based Execution Control for C and Java Programs [article]

Kazutaka Maruyama, Minoru Terada
2003 arXiv   pre-print
Step (2) is easy if we can somehow mark the last write found in step (1) and control the execution-point to move it back to this time.  ...  The usual technique for removing such bugs starts with the debugger by (1) finding the last write and (2) moving the control point of execution back to that time by re-executing the program from the beginning  ...  Section 2 proposes the notion of "position" and describes the advantages of its applications.  ... 
arXiv:cs/0309031v1 fatcat:bnugb757xbgrbalcg6qunxipxe

Logical Foundations of Continuous Query Languages for Data Streams [chapter]

Carlo Zaniolo
2012 Lecture Notes in Computer Science  
This language is called Streamlog and takes the query and application languages of DSMS to new levels of expressive power, by removing the unnecessary limitations that severely impair current commercial  ...  Indeed, the banning of blocking queries and the fact that stream data are ordered by their arrival timestamps represent major new aspects that have yet to be characterized by simple theories.  ...  This quadratic expression of transitive closure requires only the memorization of path; it is thus preferable to a linear rule that uses both arc and path, both of which then require memorization.  ... 
doi:10.1007/978-3-642-32925-8_18 fatcat:2t2mjqjso5ft5as3hwxkijiul4

Temporal Slicing in the Evaluation of XML Queries [chapter]

Dengfeng Gao, Richard T. Snodgrass
2003 Proceedings 2003 VLDB Conference  
We carefully made ¢ XQuery compatible with XQuery to ensure the smooth migration from nontemporal application to temporal application; this compatibility also simplifies the semantics and its implementation  ...  Representational queries have the same semantics with XQuery, ensuring that ¢ XQuery is upward compatible with XQuery.  ...  This research was supported in part by NSF grants IIS-0100436 and EIA-0080123 and grants from the Boeing Corporation and Microsoft.  ... 
doi:10.1016/b978-012722442-8/50062-8 dblp:conf/vldb/GaoS03 fatcat:pai5rsoxgnfr3fpuc6p4z4qlmu

Model checking transactional memory with spin

John O'Leary, Bratin Saha, Mark R. Tuttle
2008 Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08  
Transactional memory makes it possible to write properlysynchronized multi-threaded programs without the explicit use of locks.  ...  We describe our model of Intel's implementation, our experience with Spin, what we have shown, and what obstacles remain to showing more.  ...  Acknowledgments: We thank three anonymous referees for many helpful questions and comments.  ... 
doi:10.1145/1400751.1400816 dblp:conf/podc/OLearyST08 fatcat:6npoopsjjnfxhpz2ns4uc4fxpq

Understanding Algorithms by Means of Visualized Path Testing [chapter]

Ari Korhonen, Erkki Sutinen, Jorma Tarhio
2002 Lecture Notes in Computer Science  
Path testing is expected to lead into more accurate evaluation of learning outcomes because it supports systematic instruction in addition to more free trial-and-error heuristics.  ...  Assignments are based on the flowchart and on the coverage conditions of path testing.  ...  This was easy to accomplish because those lines never executed still have the timestamp zero and all the other lines have timestamp greater than zero.  ... 
doi:10.1007/3-540-45875-1_20 fatcat:5s3o55gtnzhfjhkkyg2lbwnhqu

Towards Instruction Level Record and Replay of Sensor Network Applications

Lipeng Wan, Qing Cao
2013 2013 IEEE 21st International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems  
infer and replay the actual execution paths of applications at instruction level in a post-mortem manner.  ...  Our key idea is to combine the static, structural information of the assembly-level code with their dynamic, run-time traces as measured by timestamps and basic block counters, so that we can faithfully  ...  (JDRD) program.  ... 
doi:10.1109/mascots.2013.69 dblp:conf/mascots/WanC13 fatcat:y5dzu3curzgopfkofgh3dkgpey

High-Level Portable Programming Language for Optimized Memory Use of Network Processors

Yasusi Kanada
2015 Communications and Network  
Network processors (NPs) are widely used for programmable and high-performance networks; however, the programs for NPs are less portable, the number of NP program developers is small, and the development  ...  To implement the abstraction, four representations of packet data type that cover all the packet operations (including substring, concatenation, input, and output) are introduced.  ...  members of the project for discussions and evaluations.  ... 
doi:10.4236/cn.2015.71006 fatcat:suy7mmyk5zbujkvueok2bu226q

A tree clock data structure for causal orderings in concurrent executions

Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç, Mahesh Viswanathan
2022 Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems  
CCS CONCEPTS • Software and its engineering → Software verification and validation; • Theory of computation → Theory and algorithms for application domains; Program analysis.  ...  Dynamic techniques are a scalable and effective way to analyze concurrent programs.  ...  Mahesh Viswanathan is partially supported by grants NSF SHF 1901069 and NSF CCF 2007428.  ... 
doi:10.1145/3503222.3507734 fatcat:z6bdu45mvfegpijky5rriicnme

Processing Uncertain RFID Data in Traceability Supply Chains

Dong Xie, Jie Xiao, Guangjun Guo, Tong Jiang
2014 The Scientific World Journal  
In addition, a path coding scheme is proposed to significantly compress massive data by aggregating the path sequence, the position, and the time intervals.  ...  However, massive uncertain data produced by RFID readers are not effective and efficient to be used in RFID application systems.  ...  For example, an object is uploaded at a timestamp, and its timestamp may not be different with other objects' timestamps, but their timestamps are continuous within the same time interval.  ... 
doi:10.1155/2014/535690 pmid:24737978 pmcid:PMC3967727 fatcat:ajtutlkxkjb2nmpnlkipvqxvna
« Previous Showing results 1 — 15 out of 8,481 results