Filters








18,449 Hits in 5.1 sec

Runtime validation of memory ordering using constraint graph checking

Kaiyu Chen, Sharad Malik, Priyadarsan Patra
2008 High-Performance Computer Architecture  
of the observed memory ordering by checking for cycles in the constraint graph [11, 12] .  ...  In this paper, we propose an approach for runtime validation of memory ordering. This allows us to survive bugs that escape pre-silicon verification, as well as deal with emerging dynamic errors.  ...  Acknowledgments The authors acknowledge the support of the Gigascale System Research Center, one of five research centers funded under the Focus Center Research Program, a Semiconductor Research Corporation  ... 
doi:10.1109/hpca.2008.4658657 dblp:conf/hpca/ChenMP08 fatcat:yajs763tpnfepbza2kjnu4fzpq

The Smallest Valid Extension-Based Efficient, Rare Graph Pattern Mining, Considering Length-Decreasing Support Constraints and Symmetry Characteristics of Graphs

Unil Yun, Gangin Lee, Chul-Hong Kim
2016 Symmetry  
Traditional graph pattern mining methods use a single minimum support threshold factor in order to check whether or not mined patterns are interesting.  ...  Experimental results provided in this paper demonstrate that the proposed algorithm outperforms previous mining approaches in terms of pattern generation, runtime and memory usage.  ...  Chul-Hong Kim investigated and reviewed references for graph theories and graph pattern mining applications to contribute to enhance the introduction and related work parts.  ... 
doi:10.3390/sym8050032 fatcat:w6cmt75hmrgcpnafi72ikzi2na

Coordination of Dynamic Software Components with JavaBIP [chapter]

Anastasia Mavridou, Valentin Rutz, Simon Bliudze
2017 Lecture Notes in Computer Science  
Additionally, we use directed graphs with edge coloring to model dependencies among components that determine the validity of an online system.  ...  In this paper, we present an extension of JavaBIP that can handle this type of dynamicity. We use first-order interaction logic to define synchronization constraints based on component types.  ...  To check system validity, we use directed graphs with edge coloring to model component synchronization dependencies.  ... 
doi:10.1007/978-3-319-68034-7_3 fatcat:l4tvojwlbnadbibipxjtx4h32e

Tolerating Concurrency Bugs Using Transactions as Lifeguards

Jie Yu, Satish Narayanasamy
2010 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture  
We show that 11 out of 14 real concurrency bugs in programs like Apache, MySQL and Mozilla could be avoided using the proposed approach for a negligible performance overhead.  ...  In this paper, we propose a new method to determine thread interleaving constraints from the tested interleavings in the form of lifeguard transactions (LifeTxes).  ...  This is obtained by tracking conflicting memory access information on every conflict edge in the graph used for conflict-serializability check.  ... 
doi:10.1109/micro.2010.56 dblp:conf/micro/YuN10 fatcat:hwz24rhplbfwrfjgbcmj2wi54i

Using Static Analysis to Reduce Dynamic Analysis Overhead

Suan Hsi Yong, Susan Horwitz
2005 Formal methods in system design  
While we have designed the techniques with a specific dynamic analysis in mind (that used by the Runtime Type-Checking tool), the ideas may be of more general applicability.  ...  We define several techniques that involve using the results of static analysis to identify some cases where instrumentation can safely be removed.  ...  The RTC Tool The RTC (Runtime Type-Checking) tool instruments C programs so that the runtime type of every memory location is tracked during program execution, and inconsistent type uses cause warnings  ... 
doi:10.1007/s10703-005-3401-0 fatcat:d4smabofcbd6nhrsmh5xacil7m

Extending the Consistency Property of Software Transactional Memory Systems with business constraints in OCL and incremental checking

Alberto-Manuel Fernandez-Alvarez, Daniel Fernandez-Lanvin, Manuel Quintela-Pumares
2017 Zenodo  
Keywords: Constraints, Transactional Memory, Consistency checking, Incremental checking.  ...  Software Transactional Memory (STM) systems offer AcId (note the letter case) properties. Consistency is usually regarded from the STM side but not from the business problem point of view.  ...  ACKNOWLEDGEMENTS This work has been funded by the European Union, through the European Regional Development Funds (ERDF); and the Principality of Asturias, through its Science, Technology and Innovation  ... 
doi:10.5281/zenodo.3228150 fatcat:om746o7grvegphgqffh6tmufjy

The Train Benchmark: cross-technology performance evaluation of continuous model queries

Gábor Szárnyas, Benedek Izsó, István Ráth, Dániel Varró
2017 Journal of Software and Systems Modeling  
This paper presents a benchmark for systematically assessing the scalability of validating and revalidating well-formedness constraints over large graph models.  ...  Checking well-formedness constraints can be captured by declarative queries over graph models, while model update operations can be specified as model transformations.  ...  measures the runtime for the continuous revalidation of well-formedness constraints used in many industrial and academic design tools.  ... 
doi:10.1007/s10270-016-0571-8 pmid:30220905 pmcid:PMC6132656 fatcat:7rrvuvl75bblnnr5lcrojpvwsm

Context Generation from Formal Specifications for C Analysis Tools [article]

Michele Alberti, Julien Signoles
2017 arXiv   pre-print
This is applied to a subset of the ACSL specification language in order to generate suitable contexts for the abstract interpretation-based value analysis plug-ins of Frama-C, a framework for analysis  ...  of code written in C.  ...  Thanks to the anonymous reviewers for many useful suggestions and advice.  ... 
arXiv:1709.04497v1 fatcat:52wd6g5lczccveo7tgdeh7czs4

Reducing the Overhead of Dynamic Analysis1 1This work was supported in part by the National Science Foundation under grants CCR-9970707 and CCR-9987435

Suan Hsi Yong, Susan Horwitz
2002 Electronical Notes in Theoretical Computer Science  
While we have designed the techniques with a specific dynamic analysis in mind (that used by the Runtime Type-Checking tool), the ideas may be of more general applicability.  ...  We define several techniques that involve using the results of static analysis to identify some cases where instrumentation can safely be removed.  ...  A runtime-type of ⊥ means that an expression could have more than one incompatible runtime type. Figure 5 gives the constraints for computing the runtime-type of each node in the assignment graph.  ... 
doi:10.1016/s1571-0661(04)80583-8 fatcat:esxfzp5qj5g5bjdzb6mmxtrbdi

The Choice Construct in the Souffle Language [article]

Xiaowen Hu, Joshua Karp, David Zhao, Abdul Zreika, Xi Wu, Bernhard Scholz
2021 arXiv   pre-print
With the choice construct, we can express worklist algorithms such as spanning trees in a few lines of code.  ...  This work is an experience report that describes the implementation of a choice construct in the Datalog engine Souffle.  ...  overall runtime and memory consumption.  ... 
arXiv:2108.11212v1 fatcat:6qhhd2c67zbexi6q4qncp4sgyq

A Functional Reactive Programming Language for Small-Scale Embedded Systems with Recursive Data Types

Akihiko Yokoyama, Sosuke Moriguchi, Takuo Watanabe
2021 Journal of Information Processing  
Because the language can statically determine the amount of runtime memory and guarantee the termination of reactive actions, a program written in Emfrp can safely continue reactive behaviors in resource-constrained  ...  After explaining that through examples, we describe the features of Emfrp BCT , formalize the language, present an algorithm for statically computing the runtime memory bounds, and prove its soundness.  ...  , and the amount of memory used by the language runtime.  ... 
doi:10.2197/ipsjjip.29.685 fatcat:3g62miwotbhdvhem7h4acq6vr4

MACE

Qian Feng, Aravind Prakash, Heng Yin, Zhiqiang Lin
2014 Proceedings of the 30th Annual Computer Security Applications Conference on - ACSAC '14  
Overall, MACE can construct a kernel object graph from a memory image in just a few minutes, and achieves over 95% recall and over 96% precision.  ...  the robustness by only leveraging pointer constraints (which are hard to manipulate) and evaluating these constraint globally (to even tolerate certain amount of pointer attacks).  ...  Any opinion, findings, conclusions, or recommendation are those of the authors and not necessarily of the funding agencies.  ... 
doi:10.1145/2664243.2664248 dblp:conf/acsac/FengPYL14 fatcat:z3aheiikjbc6jg5ewegjxhywhq

Scalable Pattern Matching in Metadata Graphs via Constraint Checking [article]

Tahsin Reza, Hassan Halawa, Matei Ripeanu, Geoffrey Sanders, Roger Pearce
2020 arXiv   pre-print
(up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar  ...  The key contribution of this work is a design following the constraint checking approach for exact matching and its experimental evaluation.  ...  Non-local Constraint Checking Non-local Constraint Checking iterates over K 0 , the set of non-local constraints to be checked, and validates each C 0 ∈ K 0 one at a time.  ... 
arXiv:1912.08453v2 fatcat:jrf3hcy6bnbcff6z256yefjowu

Ensuring code safety without runtime checks for real-time control systems

Sumant Kowshik, Dinakar Dhurjati, Vikram Adve
2002 Proceedings of the international conference on Compilers, architecture, and synthesis for embedded systems - CASES '02  
The language permits pointer-based data structures, restricted dynamic memory allocation, and restricted array operations, without requiring any runtime checks on memory operations and without garbage  ...  We propose a language called Control-C that is essentially a subset of C, but with key restrictions designed to ensure that memory safety of code can be verified entirely by static checking, under certain  ...  (We rely on some system support to trap accesses to a range of reserved addresses, in order to eliminate all runtime checks; otherwise, some NULL pointer runtime checks are required at runtime.)  ... 
doi:10.1145/581630.581678 dblp:conf/cases/KowshikDA02 fatcat:nbop6goaz5ftvo4ssgbrvbociu

Ensuring code safety without runtime checks for real-time control systems

Sumant Kowshik, Dinakar Dhurjati, Vikram Adve
2002 Proceedings of the international conference on Compilers, architecture, and synthesis for embedded systems - CASES '02  
The language permits pointer-based data structures, restricted dynamic memory allocation, and restricted array operations, without requiring any runtime checks on memory operations and without garbage  ...  We propose a language called Control-C that is essentially a subset of C, but with key restrictions designed to ensure that memory safety of code can be verified entirely by static checking, under certain  ...  (We rely on some system support to trap accesses to a range of reserved addresses, in order to eliminate all runtime checks; otherwise, some NULL pointer runtime checks are required at runtime.)  ... 
doi:10.1145/581677.581678 fatcat:d6uyzdv35ral3hy4pu7545ovza
« Previous Showing results 1 — 15 out of 18,449 results