Filters








776 Hits in 4.4 sec

Graph models for reachability analysis of concurrent programs

Mauro Pezzè, Richard N. Taylor, Michal Young
1995 ACM Transactions on Software Engineering and Methodology  
[n Proceedings of the 2nd Workshop on Software Testing, Verification, and Analy.ws (  ...  ., AND STEFFEN, B. 1990 A semantics-based verification tool for finite-state systems. In Protocol Specification, Testing, and Verification, IX.  ... 
doi:10.1145/210134.210180 fatcat:etnb2vkbyrfwzima4leg4tl4q4

Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems [article]

Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos
2009 arXiv   pre-print
This allows the design of new, efficient authenticated data structures for fundamental problems on networks, such as path and connectivity queries over graphs, and complex queries on two-dimensional geometric  ...  Authenticated data structures provide cryptographic proofs that their answers are as accurate as the author intended, even if the data structure is being controlled by a remote untrusted host.  ...  We would like to thank Robert Cohen for contributing to the results of Section 4 and for coauthoring a preliminary version of this paper [33] .  ... 
arXiv:0908.4116v1 fatcat:5onk5pmq2rb5dpituu3h4msgwy

Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems

Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos
2009 Algorithmica  
when a user queries a responder, along with the answer to the issued query, he receives a cryptographic proof that allows the verification of the answer trusting only a short statement (digest) signed  ...  Algorithmica (2011) 60: 505-552 path and connectivity queries over graphs, and complex queries on two-dimensional geometric objects, such as intersection and containment queries.  ...  We would like to thank Robert Cohen for contributing to the results of Sect. 4 and for coauthoring a preliminary version of this paper [30] .  ... 
doi:10.1007/s00453-009-9355-7 fatcat:uqs4mxcy2rg2dmvpkvrcvcrfhi

Model-Based Stochastic Simulation of P2P VoIP Using Graph Transformation System [chapter]

Ajab Khan, Reiko Heckel, Paolo Torrini, István Ráth
2010 Lecture Notes in Computer Science  
We propose an approach to modelling and simulation of P2P systems based on graph transformations, a visual rule based formalism that has recently been supported by facilities for stochastic modelling and  ...  Focussing on P2P VoIP applications such as Skype, we model alternative solutions to the problem of selection of and connection to super nodes (i.e., the peers acting as servers in the network) and evaluate  ...  Graph transformation can not only model these networks but it also support a number of validation and verification techniques.  ... 
doi:10.1007/978-3-642-13568-2_15 fatcat:xcayxkx4xzbozpql3rnfgzke2a

Page 5170 of Mathematical Reviews Vol. , Issue 87i [page]

1987 Mathematical Reviews  
Fich, Friedhelm Meyer auf der Heide, Eli Upfal and Avi Wigderson, A tradeoff between search and update time for the implicit dictionary problem (pp. 50-59); Franz-J.  ...  , specification and verification (pp. 442-509); A.  ... 

SybilShield: An agent-aided social network-based Sybil defense among multiple communities

Lu Shi, Shucheng Yu, Wenjing Lou, Y. Thomas Hou
2013 2013 Proceedings IEEE INFOCOM  
These solutions are mostly built on the assumption that the social network graph can be partitioned into two loosely linked regions -a tightly connected non-Sybil region and a Sybil region.  ...  Our scheme leverages the sociological property that the number of cutting edges between a non-Sybil community and a Sybil community, which represent human-established trust relationships, is much smaller  ...  Although the Sybil acceptance rate rises a little, the tradeoff between greatly reduced false positive rate and Sybil acceptance rate is acceptable.  ... 
doi:10.1109/infcom.2013.6566893 dblp:conf/infocom/ShiYLH13 fatcat:ipq2ueoc3fd4najfgqzlm5rcwm

TESTOR: A Modular Tool for On-the-Fly Conformance Test Case Generation [chapter]

Lina Marsso, Radu Mateescu, Wendelin Serwe
2018 Lecture Notes in Computer Science  
Compared to the existing tool TGV, TESTOR has a more modular architecture, based on generic graph transformation components, is capable of extracting a test case completely on the fly, and enables a more  ...  Concretely, given a formal specification of a system and a test purpose, TESTOR automatically generates test cases, which assess using black box testing techniques the conformance to the specification  ...  We are grateful to Alexander Graf-Brill and Holger Hermanns for providing us with the model and test purposes of their EnergyBus case study.  ... 
doi:10.1007/978-3-319-89963-3_13 fatcat:lb6746dmrbg75gnbcrv3qavere

Page 339 of Mathematical Reviews Vol. , Issue 84a [page]

1984 Mathematical Reviews  
Gurari and Oscar H. Ibarra, Two-way counter machines and Diophantine equations (pp. 45-52); Pavol Diiris and Zvi Galil, A time-space tradeoff for language recognition (pp. 53-57); W.  ...  This book fills the gap and covers the field rather completely. It also contributes much to the interconnections between image processing, computer graphics and picture recognition.  ... 

Keystroke Dynamics Authentication Using a Small Number of Samples

Jan Čapek, Miloslav Hub
2020 E & M Ekonomie a Management  
The verification of a person's identity is very important in today's information society, especially in e-commerce systems and directly affects user account management and administration.  ...  The solution is a two-factor authentication where a user needs to know the right password and at the same time, he must write this password in the correct way.  ...  We think that a much more convenient tool for comparing different methods is the Detection Error Tradeoff (DET) graph than only one point on this graph.  ... 
doi:10.15240/tul/001/2020-4-014 fatcat:psvmuo7hevhxrmrjmjui2y3vju

Discovering Empirical Theories of Modular Software Systems. An Algebraic Approach [chapter]

Nicola Angius, Petros Stefaneas
2016 Computing and Philosophy  
Empirical theories of computational systems are required to be modular, as modular are most software verification and testing activities.  ...  Both deductive top-down and inductive bottom-up approaches in the discovery of semantic software theories are refused to argue in favour of the abductive process of hypothesising and refining models at  ...  This research has been co-financed by the European Union (European Social Fund-ESF) and Greek national funds through the Operational Program Education and Lifelong Learning of the National Strategic Reference  ... 
doi:10.1007/978-3-319-23291-1_7 fatcat:dsqxvydsbrg5jhb7hhsjhqe74e

CEV Framework: A Central Bank Digital Currency Evaluation and Verification Framework With a Focus on Consensus Algorithms and Operating Architectures

Si Yuan Jin, Yong Xia
2022 IEEE Access  
We propose a Central Bank Digital Currency Evaluation and Verification (CEV) Framework for recommending and verifying technical solutions in the central bank digital currency (CBDC) system.  ...  We demonstrate two sub-frameworks: an evaluation sub-framework that provides consensus algorithm and operating architecture solutions and a verification sub-framework that validates the proposed solutions  ...  A tradeoff [6] exists between CBDC system features that we cannot achieve excellent performance, security, and privacy simultaneously.  ... 
doi:10.1109/access.2022.3183092 fatcat:2fktxwruezc2bopf2lincmafcq

Stimulating Participation in Wireless Community Networks

E. C. Efstathiou, P. A. Frangoudis, G. C. Polyzos
2006 Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications  
The receipts form a receipt graph, which is used as input to a reciprocity algorithm that identifies contributing users using network flow techniques.  ...  We rely on reciprocity: a person participates in the WCN and provides 'free' Internet access to mobile users in order to enjoy the same benefit when mobile.  ...  ACKNOWLEDGMENT We thank our fellow participants in the Athens Wireless Metropolitan Network for their advice and support, and the anonymous reviewers whose comments helped improve the quality of the paper  ... 
doi:10.1109/infocom.2006.320 dblp:conf/infocom/EfstathiouFP06 fatcat:moff2ss6rrf4reucmtvukwczte

Sequential decision models for expert system optimization

V.S. Mookerjee, M.V. Mannino
1997 IEEE Transactions on Knowledge and Data Engineering  
Sequential decision models are an important element of expert system optimization when the cost or time to collect inputs is significant and inputs are not known until the system operates.  ...  A wide variety of sequential decision models are discussed in this taxonomy.  ...  The noise in the input can be reduced by verification or resampling resulting in a cost-quality tradeoff for the information.  ... 
doi:10.1109/69.634747 fatcat:chvlqultkrcqfggehcr2ga6fve

Footprint: Detecting Sybil Attacks in Urban Vehicular Networks

Shan Chang, Yong Qi, Hongzi Zhu, Jizhong Zhao, Xuemin Shen
2012 IEEE Transactions on Parallel and Distributed Systems  
Rigorous security analysis and extensive trace-driven simulations demonstrate the efficacy of Footprint.  ...  In urban vehicular networks, where privacy, especially the location privacy of anonymous vehicles is highly concerned, anonymous verification of vehicles is indispensable.  ...  Thus, there exists a small "cut" on the graph of trust relationship between the forged identities and the real ones.  ... 
doi:10.1109/tpds.2011.263 fatcat:riygie4mgnd5jjmpqqyman5qjy

Lightweight, pollution-attack resistant multicast authentication scheme

Ya-Jeng Lin, Shiuhpyng Shieh, Warren W. Lin
2006 Proceedings of the 2006 ACM Symposium on Information, computer and communications security - ASIACCS '06  
However, the use of erasure codes introduces pollution attack, an attack in which the adversary injects packets to disrupt the erasure decoding procedure and consequently denies the authentication service  ...  to the receiver.  ...  After verifying the signature, a receiver can consider this block of packets authentic. Signature amortization makes a tradeoff between security and computation overhead.  ... 
doi:10.1145/1128817.1128840 dblp:conf/ccs/LinSL06 fatcat:gh52u7jo6rellebqmbjpmbep6y
« Previous Showing results 1 — 15 out of 776 results