59,520 Hits in 3.2 sec

Saturn: A SAT-Based Tool for Bug Detection [chapter]

Yichen Xie, Alex Aiken
2005 Lecture Notes in Computer Science  
The goal of the Saturn project is to realize SAT's potential for precise checking on very large software systems.  ...  Using this instrumentation for locks, we infer the locking behavior of a function f by issuing SAT queries for each possible pair of start and finish states of each lock f uses.  ... 
doi:10.1007/11513988_13 fatcat:e5g2qidgyvaabd2bfn346fakse


Gautam Altekar, Ion Stoica
2009 Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles - SOSP '09  
Unfortunately, existing replay systems for multiprocessor programs fall short.  ...  In this paper, we present ODR-a software-only replay system that reproduces bugs and provides low-overhead multiprocessor recording.  ...  Finally, this research is supported in part by gifts from Sun Microsystems, Google, Microsoft, Amazon Web Services, Cisco Systems, Facebook, Hewlett-Packard, Network Appliance, and VMWare, and by matching  ... 
doi:10.1145/1629575.1629594 dblp:conf/sosp/AltekarS09 fatcat:occy6omjnbakhcqzlygut2syda

Checkbochs: Use Hardware to Check Software [article]

Sorav Bansal
2006 arXiv   pre-print
In this paper, we present a system called Checkbochs, a machine simulator that checks rules about its guest operating system and applications at the hardware level.  ...  The author would also like to thank Ben Pfaff for very insightful discussions, help with testing Checkbochs on pintos, and making Checkbochs available to CS140 students.  ...  all layers of software running on the system.  ... 
arXiv:cs/0601068v1 fatcat:rufmlxdnv5h7zm6wq7dy4pno74

Detecting race conditions in large programs

Cormac Flanagan, Stephen N. Freund
2001 Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering - PASTE '01  
Experience with programs containing up to 500,000 lines of code indicate that it is an effective tool for identifying races in large-scale software systems.  ...  To achieve practical analysis of large programs, we developed an annotation inference system for rccjava based on the Houdini framework [11] .  ...  Section 3 introduces Houdini/rcc, our annotation inference system for rccjava, and Section 4 describes extensions to the system necessary for handling large programs.  ... 
doi:10.1145/379605.379687 dblp:conf/paste/FlanaganF01 fatcat:zwlfe5swuzcarnqcmc7e4kvhlq

Towards Scalable Modular Checking of User-Defined Properties [chapter]

Thomas Ball, Brian Hackett, Shuvendu K. Lahiri, Shaz Qadeer, Julien Vanegue
2010 Lecture Notes in Computer Science  
However, such tools have seldom been deployed on large software applications of industrial relevance.  ...  We describe our experience in using a modular checker to create various property checkers for finding errors in a well-tested application of this scale, and our design decisions to find them with low false  ...  INTRODUCTION Developing and maintaining systems software such as operating systems kernels and device drivers is a challenging task.  ... 
doi:10.1007/978-3-642-15057-9_1 fatcat:ysq3ug6xffbzrbqxnk65tp542a


Brian Demsky, Patrick Lam
2013 ACM Transactions on Software Engineering and Methodology  
Cherem et al. describe a technique for inferring locks from atomic sec- tion declarations [Cherem et al. 2008].  ...  We pair the basic approach with an inference algorithm that can infer view incompatibility specifications for many applications.  ... 
doi:10.1145/2430536.2430538 fatcat:ud6jq3qe6fdhhachtf2ll7lmj4

Combining Lock Inference with Lock-Based Software Transactional Memory [chapter]

Stefan Kempf, Ronald Veldema, Michael Philippsen
2014 Lecture Notes in Computer Science  
A compiler analysis determines if lock inference can achieve a fine-grained synchronization or if STM is better for an atomic block.  ...  In the past, software transactional memory (STM) and lock inference have been used to implement atomic blocks. Both approaches have strengths and weaknesses.  ...  The remainder of this paper first covers the building blocks of software transactional memory and lock inference in Sec. 2.  ... 
doi:10.1007/978-3-319-09967-5_19 fatcat:iej2e4y35vb5zola2wxcjk7vya

Locking discipline inference and checking

Michael D. Ernst, Alberto Lovato, Damiano Macedonio, Fausto Spoto, Javier Thaine
2016 Proceedings of the 38th International Conference on Software Engineering - ICSE '16  
To the best of our knowledge, these are the first tools that can soundly infer and check a locking discipline for Java.  ...  Concurrency is a requirement for much modern software, but the implementation of multithreaded algorithms comes at the risk of errors such as data races.  ...  Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.  ... 
doi:10.1145/2884781.2884882 dblp:conf/icse/ErnstLMST16 fatcat:zyxcwtoepvdbnhppnrgjss4b7q

Performance Analysis of NodeLock Licensing Methodology with RMPRSA Cryptography

Cuddapah Anitha, Prof.M. Padmavathamma
2014 IOSR Journal of Computer Engineering  
Despite of this, it has become a major challenge in the software industry and for the developers of the software products in protecting their intellectual property rights.  ...  To control this access towards copying the software products on various systems, software developers generally define certain restrictions by controlling its operation being used in a particular environment  ...  Lokanatha Reddy, one of the contributors of the innovation, towards his continued support for the entire work to see its light today.  ... 
doi:10.9790/0661-16283544 fatcat:yb4tomjd6nabxdrxkqjv7r5zfy

Inferential Queueing and Speculative Push

Ravi Rajwar, Alain Kägi, James R Goodman
2004 International journal of parallel programming  
In this paper, we argue for the use of two mechanisms to reduce these communication latencies: Inferentially Queued locks (IQLs) and Speculative Push (SP).  ...  With IQLs, the processor infers the existence, and limits, of a critical section from the use of synchronization instructions and joins a queue of lock requestors, reducing synchronization delay.  ...  The deferrable rd X lp request is used for inferred locks and ensures that the IQL protocol is invoked only for inferred synchronization operations.  ... 
doi:10.1023/b:ijpp.0000029274.45582.a8 fatcat:vktr4w3qc5fixmop2qws5hrtpu


Jinlin Yang, David Evans, Deepali Bhardwaj, Thirumalesh Bhat, Manuvir Das
2006 Proceeding of the 28th international conference on Software engineering - ICSE '06  
Dynamic inference techniques have been demonstrated to provide useful support for various software engineering tasks including bug finding, test suite evaluation and improvement, and specification generation  ...  We describe our approximate inference algorithm, present and evaluate heuristics for winnowing the large number of inferred properties to a manageable set of interesting properties, and report on experiments  ...  ACKNOWLEDGEMENTS We thank Joel Winstead for the earlier discussion of the inference algorithm and Willem Visser for help using Java Pathfinder.  ... 
doi:10.1145/1134285.1134325 dblp:conf/icse/YangEBBD06 fatcat:htvkw65af5bw5aeofmmheafq6u

The Method of Realizing IPLL with Software

Lingzhi Xia, Jitao Zhu, Shuang Xia, Zhixia Zhang, Jing Xu
2014 Sensors & Transducers  
for demand.  ...  In this paper, according to the characteristics of the virtual radio technology and the basic principle of phase-locked loop to build software phase-locked loop, through the analysis of the improved phase-locked  ...  The development of Phase-locked loop (PLL) was an important significance for the progress of communication technology and motor servo control system in the past 30 years.  ... 
doaj:c7fe223fd0cb420fad7b4a123ba706b3 fatcat:ng5rgddxrnflvo4gqzvtoujwl4

Page 3308 of Mathematical Reviews Vol. , Issue 2004d [page]

2004 Mathematical Reviews  
These inference systems are related in a natural way: the inference system for early equivalence is obtained from the one for late equivalence by replacing the inference rule for in- put prefix, while  ...  the inference system for the version of z-calculus with mismatch is obtained by adding a single inference rule for mismatch to the one for the version without it.  ... 

An Automated Refactoring Approach to Improve IoT Software Quality

Yang Zhang, Shuai Shao, Minghan Ji, Jing Qiu, Zhihong Tian, Xiaojiang Du, Mohsen Guizani
2020 Applied Sciences  
Internet of Things (IoT) software should provide good support for IoT devices as IoT devices are growing in quantity and complexity.  ...  This paper proposes a general refactoring framework for fine-grained read–write locking and implements an automatic refactoring tool to help developers convert built-in monitors into fine-grained ReentrantReadWriteLocks  ...  We designed five lock modes for fine-grained ReentrantReadWriteLocks, which could be inferred by our analysis and followed the inference rules.  ... 
doi:10.3390/app10010413 fatcat:dyxglusisfakphmub3wbzavpba


Lin Tan, Ding Yuan, Gopal Krishna, Yuanyuan Zhou
2007 Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles - SOSP '07  
Commenting source code has long been a common practice in software development. Compared to source code, comments are more direct, descriptive and easy-to-understand.  ...  As software evolves, they can easily grow out-of-sync, indicating two problems: (1) bugsthe source code does not follow the assumptions and requirements specified by correct program comments; (2) bad comments  ...  ACKNOWLEDGMENTS We greatly appreciate our shepherd, Stefan Savage, for his invaluable feedback, precious time, and the anonymous reviewers for their insightful comments.  ... 
doi:10.1145/1294261.1294276 dblp:conf/sosp/TanYKZ07 fatcat:2wen7dwubbh6xarlldpkyp4xhq
« Previous Showing results 1 — 15 out of 59,520 results