Filters








1,931 Hits in 4.9 sec

Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding [chapter]

Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan
2012 Lecture Notes in Computer Science  
We prove in this paper that model-checking linear-time properties under scope-bounding is also decidable and is EXPTIME-complete.  ...  We address the model checking problem of omega-regular linear-time properties for shared memory concurrent programs modeled as multi-pushdown systems.  ...  Scope-Bounded Model Checking for MPDS We consider in this section the linear-time model checking problem for MPDS's under scope-bounding.  ... 
doi:10.1007/978-3-642-33386-6_13 fatcat:uxoeg6x6mngm5pblwiftvgw3ee

Distributed dynamic partial order reduction

Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Robert M. Kirby
2010 International Journal on Software Tools for Technology Transfer (STTT)  
The experiments show that DDPOR can give out nearly linear (with respect to the number of CPUs) speedup on realistic multithreaded programs, comparing with sequential stateless model checking that uses  ...  While stateless model checking avoids the memory blow-up problem by not recording the search history, runtime becomes a major limiting factor.  ...  As far as the authors know, our work is the first effort on using parallelism to speed up runtime model checking for multithreaded programs.  ... 
doi:10.1007/s10009-010-0144-z fatcat:e672cnfssjhqflbqm5co2m4cny

The Cilk++ concurrency platform

Charles E. Leiserson
2009 Proceedings of the 46th Annual Design Automation Conference on ZZZ - DAC '09  
This paper overviews the Cilk++ programming environment, which incorporates a compiler, a runtime system, and a race-detection tool.  ...  The availability of multicore processors across a wide range of computing platforms has created a strong demand for software frameworks that can harness these resources.  ...  Thanks to Patrick Madden of SUNY Binghamton for proposing extensive revisions to the original manuscript.  ... 
doi:10.1145/1629911.1630048 dblp:conf/dac/Leiserson09 fatcat:5oenlyp7gvfidgh2snrrik7vdi

Dynamic analysis of java applications for multithreaded antipatterns

S. Boroday, A. Petrenko, J. Singh, H. Hallal
2005 Software engineering notes  
We implement and compare an ad-hoc custom approach and a formal approach to detect common bug patterns in multithreaded Java software.  ...  We use the tracing platform of the Eclipse IDE and state-of-the-art model checker Spin.  ...  This is partially justified by the difficulty of model checking of real-time systems.  ... 
doi:10.1145/1082983.1083247 fatcat:gtfxes2365frjoiwag5s2dfeh4

Sthread: In-Vivo Model Checking of Multithreaded Programs

Gene Cooperman, Martin Quinson
2020 The Art, Science, and Engineering of Programming  
Sthread operates directly on multithreaded C/C++ programs, without the need for an intermediate formal model.  ...  This work is in contrast to Context-Bounded Analysis (CBA), which assumes a preemptive model for threads, and emphasizes implementation bugs such as buffer overruns and write-after-free for memory allocation  ...  The authors are grateful for the detailed comments of the referees and for the careful reading and comments by Gregory Price.  ... 
doi:10.22152/programming-journal.org/2020/4/13 fatcat:caafa2iasjf2hap3lvxecvmdjy

Composable specifications for structured shared-memory communication

Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan Grossman
2010 Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '10  
Our approach complements past efforts for improving the safety of multithreaded programs such as race detection and atomicity checking.  ...  In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication.  ...  We also thank Steve Freund for helpful discussions on dynamic analysis techniques for concurrent programs.  ... 
doi:10.1145/1869459.1869473 dblp:conf/oopsla/WoodSCG10 fatcat:3va36e2x3nd2ro266hhx35ckeq

Composable specifications for structured shared-memory communication

Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan Grossman
2010 SIGPLAN notices  
Our approach complements past efforts for improving the safety of multithreaded programs such as race detection and atomicity checking.  ...  In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication.  ...  We also thank Steve Freund for helpful discussions on dynamic analysis techniques for concurrent programs.  ... 
doi:10.1145/1932682.1869473 fatcat:ozztz22dlvgurll3osfbccqara

Capabilities and Restrictions of Software Model Checkers

E. M. Novikov
2021 Proceedings of the Institute for System Programming of RAS  
Software model checkers enable automatic detection of violations of specified requirements in programs as well as formal proof of correctness under certain assumptions.  ...  This paper considers an interface of software model checkers, their unique capabilities as well as restrictions that prevent their large-scale usage on practice.  ...  Introduction Software model checking helps to find violations of specified requirements in programs noninteractively and prove program correctness formally under certain assumptions.  ... 
doi:10.15514/ispras-2021-33(6)-1 fatcat:xlfcbid35fd7jagvxtqho6yzku

Efficient algorithms for verifying memory consistency

Chaiyasit Manovit, Sudheendra Hangal
2005 Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05  
In this paper, we present a suite of post-mortem algorithms that perform the compliance check in an efficient, although not exhaustive, manner.  ...  It has been shown in prior work, however, that accurately verifying such compliance even of a single execution result is an NP-complete problem, for an unlimited number of processors.  ...  ACKNOWLEDGMENTS We thank the anonymous reviewers for their comments, Robert Cypher for many helpful discussions regarding this work; Ravi Hosabettu for a related proof on atomic transactions; Joseph Lu  ... 
doi:10.1145/1073970.1074011 dblp:conf/spaa/ManovitH05 fatcat:7ks4xzcrwvalfo3scljn57yblq

A Temporal Logic for Multi-threaded Programs [chapter]

Salvatore La Torre, Margherita Napoli
2012 Lecture Notes in Computer Science  
Temporal logics for nested words are a specification formalism for procedural programs, since they express requirements about matching calls and returns.  ...  We study both the satisfiability and the model-checking problems, when the multiply nested words are runs of multi-stack pushdown systems (Mpds).  ...  We thank Gennaro Parlato for helpful discussions. References  ... 
doi:10.1007/978-3-642-33475-7_16 fatcat:2grzmiks3fae3gzircfec66yey

Checking race freedom via linear programming

Tachio Terauchi
2008 SIGPLAN notices  
We present a new static analysis for race freedom and race detection. The analysis checks race freedom by reducing the problem to (rational) linear programming.  ...  We achieve efficiency by utilizing modern linear programming solvers that can quickly solve large linear programming instances.  ...  The key idea is to reduce the race checking problem to a linear programming problem such that if there exists a solution to the constructed linear programming instance, then the program is guaranteed to  ... 
doi:10.1145/1379022.1375583 fatcat:zedikjgf2vgtlhmlmw3ilyzfry

Checking race freedom via linear programming

Tachio Terauchi
2008 Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI '08  
We present a new static analysis for race freedom and race detection. The analysis checks race freedom by reducing the problem to (rational) linear programming.  ...  We achieve efficiency by utilizing modern linear programming solvers that can quickly solve large linear programming instances.  ...  The key idea is to reduce the race checking problem to a linear programming problem such that if there exists a solution to the constructed linear programming instance, then the program is guaranteed to  ... 
doi:10.1145/1375581.1375583 dblp:conf/pldi/Terauchi08 fatcat:lszhe3i4zzgwdpri7wb26dhtua

Ravenscar-Java: a high-integrity profile for real-time Java

Jagun Kwon, Andy Wellings, Steve King
2005 Concurrency and Computation  
This restricted programming model removes language features with high overheads and complex semantics, on which it is hard to perform timing and functional analyses.  ...  However, the expressive power of these features means that very complex programming models can be created, necessitating complexity in the supporting real-time virtual machine.  ...  Acknowledgements This work has been funded by the EPSRC under award number GR/M94113. The authors gratefully acknowledge the comments of Greg Bollella on an early draft of this paper.  ... 
doi:10.1002/cpe.843 fatcat:e5qpwkrudfafzjsaeqfagcuas4

Developing safety critical Java applications with oSCJ/L0

Ales Plsek, Lei Zhao, Veysel H. Sahin, Daniel Tang, Tomas Kalibera, Jan Vitek
2010 Proceedings of the 8th International Workshop on Java Technologies for Real-Time and Embedded Systems - JTRES '10  
It does this by defining a subset of the Real-time Specification for Java that trades expressiveness for verifiability.  ...  We compare SCJ to C on both a real-time operating system on the LEON3 platform and Linux on a x86.  ...  Allocation is constant time, as it boils down to bumping a pointer. Deallocation is linear in the size of the scope (due to the time spent zeroing memory on exit).  ... 
doi:10.1145/1850771.1850786 dblp:conf/jtres/PlsekZSTKV10 fatcat:buohgi6kt5hk7mjgtcq5hbcwzq

Techniques for obtaining high performance in Java programs

Iffat H. Kazi, Howard H. Chen, Berdenia Stanley, David J. Lilja
2000 ACM Computing Surveys  
The standard technique for Java execution is interpretation, which provides for extensive portability of programs.  ...  Execution time performance of Java programs can be improved through compilation, possibly at the expense of portability.  ...  ACKNOWLEDGMENTS We thank Amit Verma and Shakti Davis for their help in gathering some of the information used in this paper.  ... 
doi:10.1145/367701.367714 fatcat:76fvbgkvnffodgpip2lhajvz4m
« Previous Showing results 1 — 15 out of 1,931 results