Filters








768 Hits in 4.7 sec

Implementation and Verification of Concurrent Sorting Algorithms with CSP based Architecture

Yuki Hasegawa, Yoshinao Isobe, Kazuhito Ohmaki, Hideki Mori, Kensei Tsuchida, Yasunori Shiono
2012 Journal of Information Processing  
We tried to design, implement, and verify concurrent sorting model with CSP based architecture. In this study, we try to parallelize of sorting as the subject of embedded systems for implementing.  ...  Communicating Sequential Processes (CSP) based architecture is regarded as a useful method in the development of concurrent embedded systems. Products around us are embedded in many computer systems.  ...  Zenjiro Ohba of Toyo Univ. and Dr. Kazuhito Matsui of CSP Consortium for helpful discussions.  ... 
doi:10.2197/ipsjjip.20.559 fatcat:dxhfwql6tfhhtjrkg4gnclsxom

Using a CSP Based Programming Model for Reconfigurable Processor Arrays

Zain-ul-Abdin, Bertil Svensson
2008 2008 International Conference on Reconfigurable Computing and FPGAs  
To evaluate the performance of the generated code, we present three implementations of the DCT algorithm.  ...  We propose a method to program an emerging class of reconfigurable processor arrays by using the CSP based programming model of occam-pi.  ...  Following is a brief description of the three different implementations of the DCT algorithm, all based on the dataflow diagram.  ... 
doi:10.1109/reconfig.2008.41 dblp:conf/reconfig/Zain-ul-AbdinS08 fatcat:etv6pvugqjcxvhi4gwwojwjvcu

Parallel Algorithms Development for Programmable Devices with Application from Cryptography

Issam W. Damaj
2007 International journal of parallel programming  
The developed designs are tested under Celoxica's RC-1000 reconfigurable computer with its 2 million gates Virtex-E FPGA. Performance analysis and evaluation of these implementations are included.  ...  The specifications are realized through the use of a combination of function decomposition strategies, data refinement techniques, and off-the-shelf refinements based upon higher-order functions.  ...  Sylvia Jennings, and Dr. John Hawkins for their insightful comments on the research which is partly presented in this paper.  ... 
doi:10.1007/s10766-007-0046-1 fatcat:2xpaoudqsrcz7af4zvrxxcrcb4

Bridging CSP and C++ with selective formalism and executable specifications

W.B. Gardner
2003 First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings.  
CSP specifications are amenable to simulation and formal verification by model-checking tools.  ...  CSP (Communicating Sequential Processes) is a useful algebraic notation for creating a hierarchical behavioural specification for concurrent systems, due to its formal interprocess synchronization and  ...  There are formal models of timed CSP [7] , and one occam -based tool has implemented timing [3] .  ... 
doi:10.1109/memcod.2003.1210108 dblp:conf/memocode/Gardner03 fatcat:vdoqljk22neo5pughay3mue5qy

Experiments in Parallel Constraint-Based Local Search [chapter]

Yves Caniou, Philippe Codognet, Daniel Diaz, Salvador Abreu
2011 Lecture Notes in Computer Science  
We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results on hardware with several hundreds of processors.  ...  Preliminary performance evaluation on a variety of classical CSPs benchmarks shows that speedups are very good for a few tens of processors, and good up to a few hundreds of processors.  ...  It is somehow at the crossroads of combinatorial optimization, constraint satisfaction problems (CSP), declarative programming language and SAT problems (boolean constraint solvers and verification tools  ... 
doi:10.1007/978-3-642-20364-0_9 fatcat:3k3hcwrra5darhjx3rp23fcvfm

An approach to unified cloud service access, manipulation and dynamic orchestration via semantic cloud service operation specification framework

Daren Fang, Xiaodong Liu, Imed Romdhani, Claus Pahl
2015 Journal of Cloud Computing: Advances, Systems and Applications  
Based on the approach, a cloud service operation ontology and a unified service access and manipulation system prototype are implemented.  ...  This significantly limits the effectiveness and efficiency for tasks implementation.  ...  Acknowledgment We wish to thank British Royal Society of Edinburgh (RSE-Napier E4161) and Lawrence Ho Research Fund (LH-Napier2012) for supporting the work presented.  ... 
doi:10.1186/s13677-015-0039-3 fatcat:kiu4kvmkzbcsbkytyvxyja4dci

Abstract Architecture Representation Using VSPEC

Phillip Baraona, Perry Alexander
1999 VLSI design (Print)  
However, there is an alternative to simulation based techniques: formal analysis of abstract architectures at the requirements level.  ...  This paper briefly introduces VSPEC provides a formal definition of VSPEC abstract architectures and presents two examples that illustrate the architectural definition capabilities of the language.  ...  Acknowledgements Support for this work was provided in part by the Advanced Research Projects Agency and monitored by Wright Labs under the RASSP Technology Program, contract number F33615-93-C-1316.  ... 
doi:10.1155/1999/95465 fatcat:bpy2ytkz7vahthglk57jvv3434

Maintain the Consistency of Auditing Cloud

Amol D
2015 International Journal on Recent and Innovation Trends in Computing and Communication  
Then, design algorithms to quantify the commonality of violations metrics, and the staleness of the value of a read metrics.  ...  large amount of data cloud and multiple audit clouds In The Consistency Service model . a data cloud is maintain by Cloud service Provider (CSP) and the number of user constitute group and that group of  ...  Trace-based verifications contain three consistency semantics:, Lamport who propose these 3 semantic regularity, atomicity and safety If a register is safe if read that is not concurrent with any write  ... 
doi:10.17762/ijritcc2321-8169.150124 fatcat:63uiyhzyjvaqzapjrftzu4kzue

CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes [chapter]

Hubert Garavel, Frédéric Lang, Radu Mateescu, Wendelin Serwe
2011 Lecture Notes in Computer Science  
Cadp (Construction and Analysis of Distributed Processes) is a comprehensive software toolbox that implements the results of concurrency theory.  ...  The paper first describes the theoretical principles and the modular architecture of Cadp, which has inspired several other recent model checkers.  ...  It implements partition-refinement algorithms based on the notion of state signature [4] .  ... 
doi:10.1007/978-3-642-19835-9_33 fatcat:4fh2thknsfaergm37j6tgbncze

Combining type-checking with model-checking for system verification

Zhiqiang Ren, Hongwei Xi
2016 2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)  
Thus, it is now the programmers' responsibility to design and implement efficient concurrent software systems to fully exploiting the powerful architecture with those cores.  ...  Model Checking ATS/Veri with CSP# The semantics of both ATS/Veri and CSP# is based on state transition systems.  ... 
doi:10.1109/memcod.2016.7797745 dblp:conf/memocode/RenX16 fatcat:2hjce2siibgtnct2ddl7xvydke

CADP 2011: a toolbox for the construction and analysis of distributed processes

Hubert Garavel, Frédéric Lang, Radu Mateescu, Wendelin Serwe
2012 International Journal on Software Tools for Technology Transfer (STTT)  
Cadp (Construction and Analysis of Distributed Processes) is a comprehensive software toolbox that implements the results of concurrency theory.  ...  The paper first describes the theoretical principles and the modular architecture of Cadp, which has inspired several other recent model checkers.  ...  The formal modeling, functional verification, and performance evaluation of hardware architectures with a high degree of asynchronous concurrency have been the subject of collaborations with Bull, STMicroelectronics  ... 
doi:10.1007/s10009-012-0244-z fatcat:fdch5egwpneebjd3bo6lozyhby

On the whereabouts of CSP-CASL – A survey

Andy Gimblett, Temesghen Kahsai, Liam O'Reilly, Markus Roggenbach
2013 Electronic Communications of the EASST  
of the process algebra CSP with the algebraic specification language CASL, to the design of the concrete syntax, and also to tool support for CSP-CASL, where the theorem prover Isabelle should provide  ...  In all this, BKB provided inspiration and guidance, funding, and also a helping hand when needed.  ...  Towards a verification of EP2 We consider two levels of the EP2 specification, namely: the architectural level (Arch) and the abstract component level (ACL = T = F Csp-Casl T σ F Fig. 5.  ... 
doi:10.14279/tuj.eceasst.62.873 dblp:journals/eceasst/GimblettKOR13 fatcat:awfis5comjevbmrwzb5n6w5cyq

Privacy-preserving matrix factorization

Valeria Nikolaenko, Stratis Ioannidis, Udi Weinsberg, Marc Joye, Nina Taft, Dan Boneh
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
We further fully implement our system, and demonstrate that even on commodity hardware with 16 cores, our privacy-preserving implementation can factorize a matrix with 10K ratings within a few hours.  ...  Our design uses oblivious sorting networks in a novel way to leverage sparsity in the data. This yields an efficient implementation, whose running time is Θ(M log 2 M ) in the number of ratings M .  ...  Our approach is based on Yao's garbled circuits. In short, in a basic architecture, the CSP prepares a garbled circuit that implements matrix factorization, and provides it to the Rec-Sys.  ... 
doi:10.1145/2508859.2516751 dblp:conf/ccs/NikolaenkoIWJTB13 fatcat:zyxevnggunejrl4ouseljbaxhi

SME: A High Productivity FPGA Tool for Software Programmers [article]

Carl-Johannes Johnsen, Alberte Thegler, Kenneth Skovhede, Brian Vinter
2021 arXiv   pre-print
Synchronous Message Exchange (SME) is a runtime environment that allows development, testing and verification of hardware designs for FPGA devices in C#, with access to modern debugging and code features  ...  Lastly, a selection of student projects and examples will be presented in order to show how it is possible to create quite complex structures in SME, even by students with no hardware experience.  ...  Because SME is built on CSP, we can avoid deadlocks and race conditions, which are normally associated with concurrent programming.  ... 
arXiv:2104.09768v1 fatcat:rrikiql6bbagtjzdlda6olmcam

OPEN/CÆSAR: An open software architecture for verification, simulation, and testing [chapter]

Hubert Garavel
1998 Lecture Notes in Computer Science  
This paper presents the OPEN/CIESAR software architecture, which allows to integrate in a common framework different languages/formalisms for the description of concurrent systems, as well as tools with  ...  various functionalities, such as random execution, interactive simulation, on-the-fly and exhaustive verification, test generation, etc..  ...  This kind of information is needed by verification algorithms using partial orders and symmetries.  ... 
doi:10.1007/bfb0054165 fatcat:xk3xknnglvgb5gtd5cuj5zedfu
« Previous Showing results 1 — 15 out of 768 results