Filters








5,441 Hits in 5.4 sec

Termination and Cost Analysis of Loops with Concurrent Interleavings [chapter]

Elvira Albert, Antonio Flores-Montoya, Samir Genaim, Enrique Martin-Martin
2013 Lecture Notes in Computer Science  
Interestingly, the same kind of reasoning can be applied to infer upper bounds on the number of iterations of loops with concurrent interleavings.  ...  At the core of the analysis, we use a may-happen-in-parallel analysis to restrict the set of program points whose execution can interleave with the considered loop.  ...  loops with concurrent interleaving.  ... 
doi:10.1007/978-3-319-02444-8_25 fatcat:ubo2mgaa6bblfo6icj7nvg5nua

SACO: Static Analyzer for Concurrent Objects [chapter]

Elvira Albert, Puri Arenas, Antonio Flores-Montoya, Samir Genaim, Miguel Gómez-Zamalloa, Enrique Martin-Martin, German Puebla, Guillermo Román-Díez
2014 Lecture Notes in Computer Science  
Interestingly, SACO is able to infer both liveness (namely termination and resource boundedness) and safety properties (namely deadlock freedom) of programs based on concurrent objects.  ...  SACO provides accurate information about the dependencies which may introduce deadlocks, loops whose termination is not guaranteed, and upper bounds on the resource consumption of methods.  ...  This work was funded partially by the EU project FP7-ICT-610582 ENVISAGE: Engineering Virtualized Services (http://www.envisageproject.eu) and by the Spanish projects TIN2008-05624 and TIN2012-38137.  ... 
doi:10.1007/978-3-642-54862-8_46 fatcat:cnvgwwkkjrgs3ffqa7qwqnwcgy

Resource Analysis: From Sequential to Concurrent and Distributed Programs [chapter]

Elvira Albert, Puri Arenas, Jesús Correas, Samir Genaim, Miguel Gómez-Zamalloa, Enrique Martin-Martin, Germán Puebla, Guillermo Román-Díez
2015 Lecture Notes in Computer Science  
In this talk, we will review the basic techniques used in resource analysis of sequential programs and the new extensions needed to handle concurrent and distributed systems.  ...  Resource analysis aims at automatically inferring upper/lower bounds on the worst/best-case cost of executing programs.  ...  This work was funded partially by the EU project FP7-ICT-610582 ENVISAGE: Engineering Virtualized Services (http://www.envisageproject.eu), by the Spanish MINECO project TIN2012-38137, and by the CM project  ... 
doi:10.1007/978-3-319-19249-9_1 fatcat:focabkuc2benfg7a7sdqnohwse

COSTABS

Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, Germán Puebla
2012 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation - PEPM '12  
This paper presents COSTABS, a COSt and Termination analyzer for ABS, which is able to prove termination and obtain resource usage bounds for both the imperative and functional fragments of programs.  ...  To the best of our knowledge, COSTABS is the first system able to perform resource analysis for a concurrent language.  ...  In the context of termination analysis, Terminator [4] is the only tool to handle concurrent Java programs.  ... 
doi:10.1145/2103746.2103774 dblp:conf/pepm/AlbertAGGP12 fatcat:tf4mrvatora27j56lcdnoocr5u

ConMem

Wei Zhang, Chong Sun, Junghee Lim, Shan Lu, Thomas Reps
2013 ACM Transactions on Software Engineering and Methodology  
Unfortunately, it is difficult to deliver reliable concurrent programs, because of the huge and non-deterministic interleaving space.  ...  Our study of the error-propagation process of real-world concurrency bugs reveals a common pattern (50% in our non-deadlock concurrency bug set) that is highly correlated with program crashes.  ...  Thomas Reps has an ownership interest in GrammaTech, Inc., which has licensed elements of the technology reported in this publication.  ... 
doi:10.1145/2430545.2430546 fatcat:idebb546w5ecdewwqpk7jlarhu

Proving thread termination

Byron Cook, Andreas Podelski, Andrey Rybalchenko
2007 SIGPLAN notices  
The paper gives a description of experimental results using an implementation of our procedure on Windows device drivers, and a description of a previously unknown bug found with the tool.  ...  Concurrent programs are often designed such that certain functions executing within critical threads must terminate.  ...  Acknowledgments We thank Josh Berdine, Georges Gonthier, Peter O'Hearn, and Viktor Vafeiadis for comments and suggestions.  ... 
doi:10.1145/1273442.1250771 fatcat:xjufvkljbvbfrjgay64dmargdi

Automatic algorithm transformation for efficient multi-snapshot analytics on temporal graphs

Manuel Then, Timo Kersten, Stephan Günnemann, Alfons Kemper, Thomas Neumann
2017 Proceedings of the VLDB Endowment  
Thus, SAMS can amortize the cost of random data accesses and improve memory bandwidth utilization-two main cost factors in graph analytics.  ...  The automatic transformation interleaves algorithm executions on multiple snapshots, synergistically shares their graph accesses and traversals, and optimizes the algorithm's data layout.  ...  For Loops Interleaved for loops concurrently iterate over the elements of a collection.  ... 
doi:10.14778/3090163.3090166 fatcat:oegznfd75va2pjad4dfedmbpxa

Exploiting purity for atomicity

C. Flanagan, S.N. Freund, S. Qadeer
2005 IEEE Transactions on Software Engineering  
A procedure is atomic if, for every execution, there is an equivalent serial execution in which the actions of the atomic procedure are not interleaved with actions of other threads.  ...  We develop a static typed-based analysis for atomicity based on this insight, and we illustrate this analysis on a number of interesting examples that could not be verified using earlier tools based purely  ...  Cormac Flanagan was partly supported by the US National Science Foundation (NSF) under Grant CCR-0341179 and by faculty research funds granted by the University of California at Santa Cruz.  ... 
doi:10.1109/tse.2005.47 fatcat:ntztu56grfh6vl2w5ckdvoyini

Accuracy Bugs

Ismail Akturk, Riad Akram, Mohammad Majharul Islam, Abdullah Muzahid, Ulya R. Karpuzcu
2016 ACM Transactions on Architecture and Code Optimization (TACO)  
Under algorithmic noise tolerance, a new class of concurrency bugs, accuracy bugs, degrade the accuracy of computation (often at acceptable levels) rather than causing catastrophic termination.  ...  This article investigates the potential for deviating from the conventional wisdom of writing concurrency bug-free, parallel programs.  ...  Notice that both cost and change variables are used in evaluating the condition of the while loop at line 3.  ... 
doi:10.1145/3017991 fatcat:5uk2fjftojgv7dkgekahbxhd5m

Parallel Cost Analysis of Distributed Systems [chapter]

Elvira Albert, Jesús Correas, Einar Broch Johnsen, Guillermo Román-Díez
2015 Lecture Notes in Computer Science  
Parallel cost differs from the standard notion of serial cost by exploiting the truly concurrent execution model of distributed processing to capture the cost of synchronized tasks executing in parallel  ...  A prototype implementation demonstrates the accuracy and feasibility of the proposed analysis.  ...  We leverage the previous two steps to the concurrent setting by handling tasks whose execution might suspend and interleave with the execution of other tasks at the same location.  ... 
doi:10.1007/978-3-662-48288-9_16 fatcat:j3ivu7en6bfldn3aumartj23k4

ConSeq

Wei Zhang, Junghee Lim, Ramya Olichandran, Joel Scherpelz, Guoliang Jin, Shan Lu, Thomas Reps
2011 Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems - ASPLOS '11  
Traditional techniques for detecting concurrency bugs mostly focus on phase (1)-i.e., on finding certain structural patterns of interleavings that are common triggers of concurrency bugs, such as data  ...  Finally, it monitors a single (correct) execution of a concurrent program and identifies suspicious interleavings that could cause an incorrect state to arise at a critical read and then lead to a software  ...  Thomas Reps has an ownership interest in GrammaTech, Inc., which has licensed elements of the technology reported in this publication.  ... 
doi:10.1145/1950365.1950395 dblp:conf/asplos/ZhangLOSJLR11 fatcat:7w6zqj5hlfb3dd7rpqx23n3tjy

Rely-guarantee bound analysis of parameterized concurrent shared-memory programs

Thomas Pani, Georg Weissenbacher, Florian Zuleger
2021 Formal methods in system design  
AbstractWe present a thread-modular proof method for complexity and resource bound analysis of concurrent, shared-memory programs.  ...  We automate reasoning in our logic by reducing bound analysis of concurrent programs to the sequential case.  ...  To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.  ... 
doi:10.1007/s10703-021-00370-8 fatcat:fuaaruuhkfbflnj3pyzjo7khou

Proving thread termination

Byron Cook, Andreas Podelski, Andrey Rybalchenko
2007 Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation - PLDI '07  
The paper gives a description of experimental results using an implementation of our procedure on Windows device drivers, and a description of a previously unknown bug found with the tool.  ...  Concurrent programs are often designed such that certain functions executing within critical threads must terminate.  ...  Acknowledgments We thank Josh Berdine, Georges Gonthier, Peter O'Hearn, and Viktor Vafeiadis for comments and suggestions.  ... 
doi:10.1145/1250734.1250771 dblp:conf/pldi/CookPR07 fatcat:ebzzv2ikjvhfhogav576olu6be

The Quest for Precision: A Layered Approach for Data Race Detection in Static Analysis [chapter]

Jakob Mund, Ralf Huuck, Ansgar Fehnker, Cyrille Artho
2013 Lecture Notes in Computer Science  
Moreover, we demonstrate the e↵ectiveness of the combined approach by a case study on the open-source TFTP server OpenTFTP, which shows the trade-o↵ between speed and precision in our two-stage analysis  ...  In this work, we combine ideas from run-time verification, static analysis and model checking to balance the above requirements.  ...  NICTA is funded by the Australian Government (Department of Broadband, Communications and the Digital Economy) and the Australian Research Council through the ICT Centre of Excellence program.  ... 
doi:10.1007/978-3-319-02444-8_45 fatcat:4ide3adbibhmno3kqqboq542he

A Method for Automated Test Data Generation from Sequence Diagrams and Object Constraint Language

Thi--Dao Vu, Pham Ngoc Hung, Viet-Ha Nguyen
2015 Proceedings of the Sixth International Symposium on Information and Communication Technology - SoICT 2015  
With strong concurrency coverage, generating exhaustive test cases for all concurrent interleaving sequences is exponential in size.  ...  Test data for testing loop fragments are also generated. A tool supporting the proposed method is implemented and tested with several case studies.  ...  Moreover, we would like to further investigate and evaluate the faultdetection effectiveness, and costs, of the proposed concurrency coverage criteria.  ... 
doi:10.1145/2833258.2833294 dblp:conf/soict/VuHN15 fatcat:fobganfhebcx5hpqup7zofi3ma
« Previous Showing results 1 — 15 out of 5,441 results