48,011 Hits in 3.1 sec

Verifying Concurrent Graph Algorithms [chapter]

Azalea Raad, Aquinas Hobor, Jules Villard, Philippa Gardner
2016 Lecture Notes in Computer Science  
We show how to verify four challenging concurrent finegrained graph-manipulating algorithms, including graph copy, a speculatively parallel Dijkstra, graph marking and spanning tree.  ...  We develop a reasoning method for such algorithms that dynamically tracks the contributions and responsibilities of each thread operating on a graph, even in cases of arbitrary recursive thread creation  ...  However, published examples in these logics focus heavily on verifying concurrent data structures, whereas we focus on verifying concurrent graph algorithms.  ... 
doi:10.1007/978-3-319-47958-3_17 fatcat:dy5quok2tffjvc55vznchnk4x4

UML diagram-driven test scenarios generation based on the temporal graph grammar

2021 KSII Transactions on Internet and Information Systems  
Graph Grammar, or UAGG.  ...  In the UAGG, there are new definitions and parsing algorithms.  ...  Then, new algorithms are designed to verify UML activity diagrams and generate test scenarios. Finally, there is a case study to explain how the proposed algorithms work.  ... 
doi:10.3837/tiis.2021.07.010 fatcat:qtvrtzmigzcp7dwxiw2ilmbt7e

Modelling and Verifying Mobile Systems Using π-Graphs [chapter]

Frédéric Peschanski, Joël-Alexis Bialkiewicz
2009 Lecture Notes in Computer Science  
concurrency (polyadic marking) Practice Our tool Iterators Bisimulation-based algorithms (weak*,weak,etc.)  ...  Comparisons with other verifiers Outline Introduction Introducing the pi-graphs Graph structures pi-box calculus Formal investigations Basic results Bisimulation framework Verification algorithm  ... 
doi:10.1007/978-3-540-95891-8_40 fatcat:tfw3pvrztrdajme6dt62fmhqny

Concurrency Protocol Aiming at High Performance of Execution and Replay for Smart Contracts [article]

Shuaifeng Pang, Xiaodong Qi, Zhao Zhang, Cheqing Jin, Aoying Zhou
2019 arXiv   pre-print
Also, a graph partition algorithm is devised to divide the original schedule log into small pieces and further reduce the communication cost; and (ii) in the second phase, we give a deterministic OCC protocol  ...  Specifically, (i) in the first phase, we give a variant of OCC (Optimistic Concurrency Control) protocol based on {\em batching} feature to improve the concurrent execution efficiency for the miner and  ...  Moreover, all smart contracts belonging to the same sub-graph will be verified in the same core.  ... 
arXiv:1905.07169v1 fatcat:sl6hem7j5zezraqqkx432ehdau

Slicing-based Reductions for Rebeca

Hamideh Sabouri, Marjan Sirjani
2010 Electronical Notes in Theoretical Computer Science  
For applying the slicing techniques, the Rebeca dependence graph (RDG) is introduced.  ...  We also propose a static slicing algorithm for deadlock detection (in absence of any particular property).  ...  In [3] the notion of slicing is extended for concurrent programs and a graph-theoretical approach to slicing concurrent programs is presented.  ... 
doi:10.1016/j.entcs.2009.12.039 fatcat:exia5xm2drafdnhci4s7pgfgaq

Model Checking: Historical Perspective and Example (Extended Abstract) [chapter]

Edmund M. Clarke, Sergey Berezin
1998 Lecture Notes in Computer Science  
An exhaustive search of the global state transition graph or system model is used to determine if the specification is true or not.  ...  Model checking is an automatic verification technique for finite state concurrent systems such as sequential circuit designs and communication protocols.  ...  Alternative techniques for verifying concurrent systems were proposed by a number of other researchers.  ... 
doi:10.1007/3-540-69778-0_3 fatcat:flyys7zuefhpzou562dwv7hufa

Precise Analysis of Java Programs Using JOANA

Dennis Giffhorn, Christian Hammer
2008 2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation  
It contains a wide range of analysis techniques such as dependence graph computation, slicing and chopping for sequential and concurrent programs, computation of path conditions and algorithms for software  ...  In the current version, a user can compute and navigate through dependence graphs for full Java bytecode, analyze Java programs with a broad range of slicing and chopping algorithms, and use precise algorithms  ...  over precise slicing algorithms for concurrent programs [2] to special algorithms for barrier-or level slicing and -chopping [8] .  ... 
doi:10.1109/scam.2008.17 dblp:conf/scam/GiffhornH08 fatcat:trza2jz32rclfkaafmiambjbqm

Efficient Checking of Link-Reversal-Based Concurrent Systems [chapter]

Matthias Függer, Josef Widder
2012 Lecture Notes in Computer Science  
For resource allocation, conflicts can be represented by conflict graphs, and link reversal algorithms work on these graphs to resolve conflicts.  ...  In this paper we establish that executions of link reversal algorithms on large graphs are similar (a notion which we make precise in the paper) to executions on smaller graphs.  ...  The application of link-reversal algorithms ranges from routing and other problems in wireless networks [16, 15, 5] to resource allocation in concurrent systems [6, 3] .  ... 
doi:10.1007/978-3-642-32940-1_34 fatcat:hwwvpis2k5cobif2grmakjz45y

Specification, validation, and verification of time-critical systems

Shiuh-Pyng Shieh, Jun-Nan Chen
1998 Computer Communications  
A given time-dependent specification can be formalized as a Timed CFSM, from which the reachability graph is constructed to verify the correctness of the specification.  ...  Timed CFSM preserves the advantages of CFSM, such as the ability to express communication, synchronization and concurrency in computer systems.  ...  Repeat (1) through (3) until all concurrent path sets are verified. The space requirement of the revised algorithm would be less than that of the original algorithm.  ... 
doi:10.1016/s0140-3664(97)00145-x fatcat:5ytepocptreazd2rgdqzkkdl54

Systematic functional coverage metric synthesis from hierarchical temporal event relation graph

Young-Su Kwon, Young-Il Kim, Chong-Min Kyung
2004 Proceedings of the 41st annual conference on Design automation - DAC '04  
The HiTER is the graph where nodes represent basic temporal properties or subgraph and edges represent time-shift value between two nodes.  ...  Concurrent edge groups make it possible to generate more comprehensive temporal properties and hierarchical structure makes it easy to describe large design by combining multiple subgraphs.  ...  The algorithm for temporal property generation makes all possible coverage tasks by traversing the graph while removing the invalid properties.  ... 
doi:10.1145/996566.996580 dblp:conf/dac/KwonKK04 fatcat:hqpalywip5dutn6sosvsrytk4a

Barrier matching for programs with textually unaligned barriers

Yuan Zhang, Evelyn Duesterwald
2007 Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '07  
algorithms.  ...  After computing the multi-valued expression slice we determine the concurrent paths in the program by marking the concurrent split and meet points in the graph.  ... 
doi:10.1145/1229428.1229472 dblp:conf/ppopp/ZhangD07 fatcat:bbfpuchmbfad7c56cilnev5x3e

Safe Execution of Concurrent Programs by Enforcement of Scheduling Constraints [article]

Patrick Metzler, Habib Saissi, Péter Bokor, Neeraj Suri
2020 arXiv   pre-print
Automated software verification of concurrent programs is challenging because of exponentially large state spaces with respect to the number of threads and number of events per thread.  ...  Program executions are safe as long as the same scheduling constraints are enforced under which the program has been verified, e.g., by instrumenting a program with additional synchronization.  ...  The IRS Algorithm An IRS algorithm consists of a verifier and an execution environment, which run concurrently.  ... 
arXiv:1809.01955v2 fatcat:ukokailobjccvgakagipnqvswa

Parallel N-free order recognition

Laurent Viennot
1997 Theoretical Computer Science  
G is the line graph of R as its arcs (u, v) are those verifying u E Sj and v E Tj for some j E {l,...  ...  The second algorithm employs the arbitrary concurrent-read concurrent-write (arbitrary-CRCW for short) PRAM. In case of write conflict, only one arbitrary processor succeeds in writing its value.  ... 
doi:10.1016/s0304-3975(96)00210-1 fatcat:7g7ogu4g3ff3zgpdqtj3ktxtbm

Concurrent Edge Prevision and Rear Edge Pruning Approach for Frequent Closed Itemset Mining

Anurag Choubey, Dr. Ravindra, Dr. J.L.
2011 International Journal of Advanced Computer Science and Applications  
It implements a completely unique sequence finality verification model by constructing a Graph structure that build by an approach labeled "Concurrent Edge Prevision and Rear Edge Pruning" briefly will  ...  any algorithms those cited in literature frequently.  ...  Algorithm 1: Concurrent Edge Prevision to build graph structure and Rear Edge Pruning Step This segment focuses mainly on providing evidence on asserting the claimed assumptions that 1) The CEG&REP is  ... 
doi:10.14569/ijacsa.2011.021111 fatcat:47p43znhp5hajgijojxkbehatm

Automated Verification of Parallel Nested DFS [chapter]

Wytse Oortwijn, Marieke Huisman, Sebastiaan J. C. Joosten, Jaco van de Pol
2020 Lecture Notes in Computer Science  
This paper shows how the VerCors concurrency verifier is used to mechanically verify the parallel nested depth-first search (NDFS) graph algorithm of Laarman et al. [25] .  ...  Model checking algorithms are typically complex graph algorithms, whose correctness is crucial for the usability of a model checker.  ...  [38] verified four concurrent graph algorithms in the context of CoLoSL, but the proofs have not been automated. Sergey et al.  ... 
doi:10.1007/978-3-030-45190-5_14 fatcat:mxlh3zbyl5ehtjtfhskpv3cwn4
« Previous Showing results 1 — 15 out of 48,011 results