Filters








15,982 Hits in 3.7 sec

Designing programs that check their work

M. Blum, S. Kanna
1989 Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89  
It also applies methods of modem cryptography, especially the idea of a probabilistic interactive proof, to the design of program checkers for group theoretic computations.  ...  A program correctness checker is an algorithm for checking the output of a computation. This paper defines the concept of a program checker.  ...  Qed Checkers for Group Theoretic Problems Many group theoretic problems have checkers resembling that for graph isomorphism.  ... 
doi:10.1145/73007.73015 dblp:conf/stoc/BlumK89 fatcat:n65fa7w2c5haziyoow5jvyvvam

Designing programs that check their work

Manuel Blum, Sampath Kannan
1995 Journal of the ACM  
It also applies methods of modem cryptography, especially the idea of a probabilistic interactive proof, to the design of program checkers for group theoretic computations.  ...  A program correctness checker is an algorithm for checking the output of a computation. This paper defines the concept of a program checker.  ...  Qed Checkers for Group Theoretic Problems Many group theoretic problems have checkers resembling that for graph isomorphism.  ... 
doi:10.1145/200836.200880 fatcat:lzapsffuhzcphhowmfbn2acnle

IibDMC: a Library to Operate Efficient Distributed Model Checking

Alexandre Hamez, Fabrice Kordon, Yann Thierry-Mieg
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
Performance evaluations are reported and clearly show the advantages of multi-threading to occupy processors while waiting for the network, with linear speedup over the number of processors.  ...  This library is generic, and is designed to allow encapsulation of any model checker in order to make it distributed.  ...  If several days of computation may remain acceptable for the development of critical components, many projects could benefit from the linear speedup in the evaluation of a safety property.  ... 
doi:10.1109/ipdps.2007.370647 dblp:conf/ipps/HamezKT07 fatcat:cqycyjfqdrduppb2y45bjgplru

Dynamic Concerted Activities among Retinal Ganglion Cells

Lei Xiao, Ying-Ying Zhang, Pei-Ji Liang
2010 Bioinformatics and Biomedical Engineering (iCBBE), International Conference on  
Concerted firing is one of the important ways for neurons to encode sensory stimuli.  ...  On the contrary, the number of synchronized neurons and synchronous groups during pseudorandom checkerboard stimulation had a decreasing tendency.  ...  Spatial summation is more efficient as the threshold for postsynaptic will be lower [15] .  ... 
doi:10.1109/icbbe.2010.5515002 fatcat:7ef3fb75avfujavd6cllzwkloi

A game-theoretic intrusion detection model for mobile ad hoc networks

Hadi Otrok, Noman Mohammed, Lingyu Wang, Mourad Debbabi, Prabir Bhattacharya
2008 Computer Communications  
A cooperative game-theoretic model is proposed to analyze the interaction among checkers to reduce the false-positive rate.  ...  the most cost-efficient node known as leader-IDS.  ...  The authors are grateful to the anonymous reviewers for their valuable comments.  ... 
doi:10.1016/j.comcom.2007.10.024 fatcat:v5xgwzftenfvfbba4qjtjk7my4

AlPiNA: An Algebraic Petri Net Analyzer [chapter]

Didier Buchs, Steve Hostettler, Alexis Marechal, Matteo Risoldi
2010 Lecture Notes in Computer Science  
AlPiNA is a graphical editor and model checker for a class of highlevel Petri nets called Algebraic Petri Nets. Its main purpose is to perform reachability checks on complex models.  ...  It performs symbolic model checking based on ΣDD, an efficient evolution in the Decision Diagrams field, using novel techniques such as algebraic clustering and algebraic unfolding.  ...  Its computational complexity is O(n c ) where n is the size of the largest data domain and c the largest number of input arcs.  ... 
doi:10.1007/978-3-642-12002-2_29 fatcat:vun5ts5wwray5gnb6oncvnfzvu

Revisiting the Efficiency of Malicious Two-Party Computation [chapter]

David P. Woodruff
2007 Lecture Notes in Computer Science  
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior.  ...  Their aim is to make classical solutions to this problem, such as zero-knowledge compilation, more efficient. The authors provide several schemes which are the most efficient to date.  ...  Acknowledgments: We thank Payman Mohassel, Benny Pinkas, and the anonymous referees for many helpful comments.  ... 
doi:10.1007/978-3-540-72540-4_5 fatcat:idgsivi2izfolnwx4u5t6o32pa

Synchronized Activities among Retinal Ganglion Cells in Response to External Stimuli [chapter]

Lei Xiao, Ying-Ying Zhang, Pei-Ji Liang
2010 Lecture Notes in Computer Science  
Synchronized firing is an efficient way for retinal ganglion cells (RGCs) to encode visual stimuli.  ...  In the present study, we studied synchronized activities among RGCs in response to natural movie and pseudo-random checker-board flickering.  ...  PP Δ = + − ≈ (3) The identification of concerted neuron groups starts with computing H Δ for all the cell pairs.  ... 
doi:10.1007/978-3-642-13278-0_6 fatcat:nqka6a2vcffdxkuutvucdhdvfy

Communication Efficient Checking of Big Data Operations [article]

Lorenz Hübschle-Schneider, Peter Sanders
2018 arXiv   pre-print
., 2016) confirms the low overhead and high failure detection rate predicted by theoretical analysis.  ...  Our checkers cover many of the commonly used operations, including sum, average, median, and minimum aggregation, as well as sorting, union, merge, and zip.  ...  We would like to thank Timo Bingmann for support with Thrill.  ... 
arXiv:1710.08255v2 fatcat:dvhhgw625fa75i6ujnsnvwjvrq

Page 2106 of Mathematical Reviews Vol. , Issue 2002C [page]

2002 Mathematical Reviews  
Y.) 2002c:68103 68W10 68Q25 Arvind, V. (6-MATSCI-C; Chennai); Toran, Jacobo (D-ULM-TI; Ulm A nonadaptive NC checker for permutation group intersection. (English summary) Theoret. Comput.  ...  An im- portant problem in computer-aided design and manufacturing is the automated generation of efficient milling planes for computer- 68 COMPUTER SCIENCE 2106 ized numerically controlled (CNC) milling  ... 

Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461)

Nikolaj Bjorner, Krishnendu Chatterjee, Laura Kovacs, Rupak M. Majumdar, Marc Herbstritt
2013 Dagstuhl Reports  
This report documents the program and the outcomes of the Dagstuhl Seminar 12461 "Games and Decisions for Rigorous Systems Engineering".  ...  The distributed algorithms we consider are parameterized by both the number of processes and the assumed maximum number of Byzantine faulty processes.  ...  We introduce a method for automated parameterized verification of fault-tolerant distributed algorithms.  ... 
doi:10.4230/dagrep.2.11.45 dblp:journals/dagstuhl-reports/BjornerCKM12 fatcat:gs36midqlvfhzky6v7ebawumtq

Uppaal in 1995 [chapter]

Johan Bengtsson, Kim G. Larsen, Fredrik Larsson, Paul Pettersson, Wang Yi
1996 Lecture Notes in Computer Science  
UPPAAL 1 is a tool suite for automatic verification of safety and bounded liveness properties of real-time systems modeled as networks of timed automata [12, 9, 4] , developed during the past two years  ...  In this paper, we summarize the main features of UPPAAL in particular its various extensions developed in 1995 as well as applications to various case-studies, review and provide pointers to the theoretical  ...  In developing an automatic verification tool, there are two main issues to be considered: a user interface which should be easy to use and a model-checker which should be efficient.  ... 
doi:10.1007/3-540-61042-1_66 fatcat:55oipbfjnve4fcncves6mhl52i

Communication Efficient Checking of Big Data Operations

Lorenz Hubschle-Schneider, Peter Sanders
2018 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)  
., 2016) confirms the low overhead and high failure detection rate predicted by theoretical analysis.  ...  Our checkers cover many of the commonly used operations, including sum, average, median, and minimum aggregation, as well as sorting, union, merge, and zip.  ...  We would like to thank Timo Bingmann for support with Thrill.  ... 
doi:10.1109/ipdps.2018.00074 dblp:conf/ipps/Hubschle-Schneider18 fatcat:47whg4moencalll7tbgsz7w7ja

A Computational Group Theoretic Symmetry Reduction Package for the Spin Model Checker [chapter]

Alastair F. Donaldson, Alice Miller
2006 Lecture Notes in Computer Science  
We present TopSPIN, a fully automatic symmetry reduction package for the SPIN model checker.  ...  TopSPIN uses the GAP computational algebra system to effectively detect state space symmetry from the associated Promela specification, and to choose an efficient symmetry reduction strategy by classifying  ...  The tool draws on theory and technology from computational group theory to efficiently compute equivalence class representatives.  ... 
doi:10.1007/11784180_29 fatcat:v6bpcc4rfve5tia2uv7o3vxhea

Page 5881 of Mathematical Reviews Vol. , Issue 99h [page]

1999 Mathematical Reviews  
We find surprisingly fast batch verifiers for this relation. We also find efficient batch verifiers for the degrees of polynomials.  ...  R. (1-NE-CS; Lincoln, NE) Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution. (English summary) Theoret. Comput. Sci. 200 (1998), no. 1-2, 313-334.  ... 
« Previous Showing results 1 — 15 out of 15,982 results