The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase dining philosophers (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1980-1988 (15) 1990-1994 (17) 1995-1999 (16) 2000-2002 (15) 2003-2005 (16) 2006-2009 (17) 2010-2018 (15) 2019-2020 (2)
Publication types (Num. hits)
article(36) inproceedings(76) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 176 occurrences of 123 keywords

Results
Found 113 publication records. Showing 113 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
124Srikanth Sastry, Scott M. Pike, Jennifer L. Welch The weakest failure detector for wait-free dining under eventual weak exclusion. Search on Bibsonomy SPAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF mutual exclusion, failure detectors, wait-freedom, partial synchrony, dining philosophers
124Scott M. Pike, Yantao Song, Srikanth Sastry Wait-Free Dining Under Eventual Weak Exclusion. Search on Bibsonomy ICDCN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Failure Detectors, Wait-Freedom, Dining Philosophers
112Scott M. Pike, Paolo A. G. Sivilotti Dining Philosophers with Crash Locality 1. Search on Bibsonomy ICDCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
96Daniel Lehmann 0001, Michael O. Rabin On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem. Search on Bibsonomy POPL The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
89Baruch Awerbuch, Michael E. Saks A Dining Philosophers Algorithm with Polynomial Response Time Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF dynamic job creation, job arrival density, conflicting jobs, asynchronous model, concurrent jobs, maximum execution time, dining philosophers algorithm, polynomial response time, distributed online algorithm, message transmission time, resource allocation, upper bound, job scheduling, resource constraints, resource requirements, arbitrary networks, distribution queue
84Marie Duflot, Laurent Fribourg, Claudine Picaronny Randomized dining philosophers without fairness assumption. Search on Bibsonomy Distributed Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
84Oltea Mihaela Herescu, Catuscia Palamidessi On the generalized dining philosophers problem. Search on Bibsonomy PODC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
83Praveen Danturi, Mikhail Nesterenko, Sébastien Tixeuil Self-stabilizing philosophers with generic conflicts. Search on Bibsonomy ACM Trans. Auton. Adapt. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Self-stabilization, dining philosophers
71Jayasri Banerjee, Anup Kumar Bandyopadhyay, Ajit Kumar Mandal Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem. Search on Bibsonomy ACM SIGSOFT Softw. Eng. Notes The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
71Jürg Gutknecht The Dining Philosophers Problem Revisited. Search on Bibsonomy JMLC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
71Mikhail Nesterenko, Anish Arora Dining Philosophers that Tolerate Malicious Crashes. Search on Bibsonomy ICDCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
71Benjamin M. Brosgol The Dining Philosophers in Ada 95. Search on Bibsonomy Ada-Europe The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
71Yih-Kuen Tsay, Rajive L. Bagrodia An Algorithm with Optimal Failure Locality for the Dining Philosophers Problem. Search on Bibsonomy WDAG The full citation details ... 1994 DBLP  DOI  BibTeX  RDF Strong, Fault-Tolerance, Synchronization, Resource Allocation, Lower Bounds, Fairness
70Lee Naish Resource-Oriented Deadlock Analysis. Search on Bibsonomy ICLP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF deadlock analysis, committed choice nondeterminism, floundering, Concurrency, partial order, dining philosophers, coroutining
70Diego Moreira de Araujo Carvalho, Fábio Protti, Massimo De Gregorio, Felipe M. G. França A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load. Search on Bibsonomy OPODIS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF dining philosophers problem, distributed traffic light control, graph dynamics, distributed algorithms, mutual exclusion, resource-sharing
70Kamel Barkaoui, Claude Kaiser, Jean-François Pradat-Peyre Petri nets based proofs of Ada 95 solution for preference control. Search on Bibsonomy APSEC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Petri nets based proofs, preference control, dining philosophers paradigm, entry families, requeue statements, Petri nets, deadlock, colored Petri nets, Ada 95, correctness proofs, starvation, protected objects
70José A. Troyano, Jesús Torres 0001, Miguel Toro A technique for distributed systems specification. Search on Bibsonomy PDP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF distributed systems specification, object-oriented specification language, dining philosophers problem, formal specification, distributed algorithms, distributed processing, concurrency control, specification languages, distributed programming, object-oriented languages, transition system, algebraic model, algebraic data types, object attributes, transition rules
70Yih-Kuen Tsay, Rajive L. Bagrodia Fault-Tolerant Algorithms for Fair Interprocess Synchronization. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF fair interprocess synchronization, binary interaction problem, strong fairness property, binary interactions, message cost, dining philosophers problem, distributed algorithms, fault tolerant computing, concurrency control, embedding, synchronisation, response time, fault-tolerant algorithms, asynchronous processes
70Gerald M. Karam, Raymond J. A. Buhr Temporal Logic-Based Deadlock Analysis For Ada. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF temporal logic-based specification language, deadlock analyzer, Timebench, concurrent system-design environment, COL, linear-time temporal logic, formal basis, axiomatic reasoning, deadlock analysis tool, reasoning power, Ada designs, systemwide deadlock-free, deadlock algorithm, finite systems, worst-case computational complexity, gas station, layered communications system, computational complexity, Ada, logic programming, temporal logic, Prolog, specification language, specification languages, inference mechanisms, system recovery, theorem prover, readers, dining philosophers, writers
70Sudhir Aggarwal, Daniel Barbará, Kalman Z. Meth A Software Environment for the Specification and Analysis of Problems of Coordination and Concurrency. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF SPANNER software environment, selection/resolution model, cluster variables, simulation, parallel programming, concurrency, distributed computing, specification, coordination, distributed processing, programming environments, concurrent programming, reachability analysis, software environment, dining philosophers, finite-state machine model
70Haim Gaifman Modeling concurrency by partial orders and nonlinear transition systems. Search on Bibsonomy REX Workshop The full citation details ... 1988 DBLP  DOI  BibTeX  RDF pomset, causal precedence, concurrent, computation, process, event, deadlock, partial order, action, state, transition system, automaton, shared resource, dining philosophers, simultaneous
51Kathrin Hoffmann, Hartmut Ehrig, Till Mossakowski High-Level Nets with Nets and Rules as Tokens. Search on Bibsonomy ICATPN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF High-level net models, algebraic high-level nets, nets and rules as tokens, integration of net theory and graph transformations, case study: House of Philosophers, graph grammars and Petri net transformations, algebraic specifications
51Elizabeth B. Weidman, Ivor P. Page, William J. Pervin Explicit dynamic exclusion algorithm. Search on Bibsonomy SPDP The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
45Venkatesh Choppella, Arjun Sanjeev, Viswanath Kasturi, Bharat Jayaraman Generalised Dining Philosophers as Feedback Control. Search on Bibsonomy ICDCIT The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Joel C. Adams, Elizabeth R. Koning, Christiaan D. Hazlett Visualizing Classic Synchronization Problems: Dining Philosophers, Producers-Consumers, and Readers-Writers. Search on Bibsonomy SIGCSE The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
45Giorgio Delzanno Logic-based Verification of the Distributed Dining Philosophers Protocol. Search on Bibsonomy Fundam. Informaticae The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
45Joshua Grove A Comparative Solution to ARGESIM Benchmark C4 'Dining Philosophers' with AnyLogic and MVSTUDIUM. Search on Bibsonomy Simul. Notes Eur. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
45Venkatesh Choppella, Viswanath Kasturi, Arjun Sanjeev Generalised Dining Philosophers as Feedback Control. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
45Riccardo De Masellis, Valentin Goranko, Stefan Gruner, Nils Timm Generalising the Dining Philosophers Problem: Competitive Dynamic Resource Allocation in Multi-agent Systems. Search on Bibsonomy EUMAS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
45Jordan Adamek, Giovanni Farina, Mikhail Nesterenko, Sébastien Tixeuil Evaluating and optimizing stabilizing dining philosophers. Search on Bibsonomy J. Parallel Distributed Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
45Dorit Aharonov, Maor Ganz, Loïck Magnin Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
45Justin DeBenedetto, Stephen Hutt, Louis Faust, Anqing Liu, Nathaniel Kremer-Herman Placating plato with plates of pasta: An interactive tool for teaching the dining philosophers problem. Search on Bibsonomy FIE The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
45Jordan Adamek, Mikhail Nesterenko, Sébastien Tixeuil Evaluating and Optimizing Stabilizing Dining Philosophers. Search on Bibsonomy EDCC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
45Ruth Leskovar, Johannes Tanzler, Martin Bicher Petri Net Modelling and Simulation in AnyLogic and MATLAB for ARGESIM Benchmark C4 'Dining Philosophers'. Search on Bibsonomy Simul. Notes Eur. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
45Anup Kumar Bandyopadhyay, Nibedita Lenka Application of TLRO to dining philosophers problem. Search on Bibsonomy ACM SIGSOFT Softw. Eng. Notes The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
45Zhen You, Jinyun Xue, Shi Ying Categorial Semantics of a Solution to Distributed Dining Philosophers Problem. Search on Bibsonomy FAW The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
45Suzana Andova, Luuk Groenewegen, Erik P. de Vink Distributed Adaption of Dining Philosophers. Search on Bibsonomy FACS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
45Yantao Song The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers. Search on Bibsonomy 2010   RDF
45David J. Powers Dining Philosophers: Strategies for Success. Search on Bibsonomy PDPTA The full citation details ... 2005 DBLP  BibTeX  RDF
45Marie Duflot, Laurent Fribourg, Claudine Picaronny Randomized Dining Philosophers without Fairness Assumption. Search on Bibsonomy IFIP TCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
45Oltea Mihaela Herescu, Catuscia Palamidessi On the generalized dining philosophers problem Search on Bibsonomy CoRR The full citation details ... 2001 DBLP  BibTeX  RDF
45Sara M. Carlstead Down the Road: University of Pennsylvania: the dining philosophers. Search on Bibsonomy XRDS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
45Hans Fuss True Simulation of Real Parallel Processes is Impossible. A Proof by the Five Dining Philosophers. Search on Bibsonomy EUROSIM The full citation details ... 1995 DBLP  BibTeX  RDF
45A. W. Roscoe 0001, Paul H. B. Gardiner, Michael Goldsmith, J. R. Hulance, D. M. Jackson, J. Bryan Scattergood Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock. Search on Bibsonomy TACAS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
45Injong Rhee, Jennifer L. Welch On the Time Complexity of the Dining Philosophers Problem. Search on Bibsonomy PDPTA The full citation details ... 1995 DBLP  BibTeX  RDF
45Giuseppe Persiano An Optimal Algorithm for the Dining Philosophers Problem. Search on Bibsonomy Parallel Process. Lett. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
45Debra Hoover, Joseph Poole A Distributet Self-Stabilizing Solution to the Dining Philosophers Problem. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
45John G. Vaughan The dining philosophers problem and its decentralisation. Search on Bibsonomy Microprocess. Microprogramming The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
45Michael B. Feldman The portable dining philosophers: a movable feast of concurrency and software engineering. Search on Bibsonomy SIGCSE The full citation details ... 1992 DBLP  DOI  BibTeX  RDF Ada
45Kwok-bun Yue Dining philosophers revisited, again. Search on Bibsonomy ACM SIGCSE Bull. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
45Armando R. Gingras Dining philosophers revisited. Search on Bibsonomy ACM SIGCSE Bull. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
45Peter Kokol Dining philosophers in JSD. Search on Bibsonomy ACM SIGSOFT Softw. Eng. Notes The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
45S. P. Rana, Dilip K. Banerji An optimal distributed solution to the dining philosophers problem. Search on Bibsonomy Int. J. Parallel Program. The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
45Deepinder P. Sidhu, Robert H. Pollack A Robust Distributed Solution to the Generalized Dining Philosophers' Problem. Search on Bibsonomy ICDE The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
45S. P. Rana Triple-Handed Dining Philosophers. Search on Bibsonomy ACM SIGOPS Oper. Syst. Rev. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
45Thomas A. Cargill A Robust Distributed Solution to the Dining Philosophers Problem. Search on Bibsonomy Softw. Pract. Exp. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
44Hagit Attiya, Alex Kogan, Jennifer L. Welch Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks. Search on Bibsonomy IEEE Trans. Mob. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF failure locality, Mobile ad hoc networks, dining philosophers
44Cosimo Laneve, Antonio Vitale The Expressive Power of Synchronizations. Search on Bibsonomy LICS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF dining philosophers problem, synchronizations, hypercube, Expressive power, process calculi
44Phuong Hoai Ha, Philippas Tsigas, Mirjam Wattenhofer, Roger Wattenhofer Efficient multi-word locking using randomization. Search on Bibsonomy PODC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF multi-word locking, shared memory, randomization, dining philosophers
44Injong Rhee A Modular Algorithm for Resource Allocation. Search on Bibsonomy Distributed Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Modular construction, Message passing distributed systems, Concurrency, Resource allocation, Dining philosophers
44Manhoi Choy, Ambuj K. Singh Efficient Fault-Tolerant Algorithms for Distributed Resource Allocation. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF committee coordination, failure locality, dining philosophers, distributed resource allocation
39Praveen Danturi, Mikhail Nesterenko, Sébastien Tixeuil Self-stabilizing Philosophers with Generic Conflicts. Search on Bibsonomy SSS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Kun Wei, James Heather Embedding the Stable Failures Model of CSP in PVS. Search on Bibsonomy IFM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF CSP, deadlock, determinism, liveness, theorem prover
39Tom Holvoet, Pierre Verbaeten Using Petri Nets for Specifying Active Objects and Generative Communication. Search on Bibsonomy Concurrent Object-Oriented Programming and Petri Nets The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
39Mikhail Nesterenko, Anish Arora Stabilization-Preserving Atomicity Refinement. Search on Bibsonomy DISC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
39Patrick M. Lenders Distributed microprogramming. Search on Bibsonomy MICRO The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
26Liang Xu, Wei Chen 0018, Yanyan Xu 0001, Wenhui Zhang Improved Bounded Model Checking for the Universal Fragment of CTL. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF model checking algorithm, ACTL, SAT, software verification, bounded model checking
26Anup Kumar Bandyopadhyay Fairness and conspiracy concepts in concurrent systems. Search on Bibsonomy ACM SIGSOFT Softw. Eng. Notes The full citation details ... 2009 DBLP  DOI  BibTeX  RDF conspiracy, fairness, concurrent systems, starvation
26Byung-Chul Kim, Sang-Woo Jun, Dae-Joon Hwang, Yong-Kee Jun Visualizing Potential Deadlocks in Multithreaded Programs. Search on Bibsonomy PaCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF potential deadlocks, lock-causality graph, visualization, debugging, multithreaded programs
26Claude Kaiser, Jean-François Pradat-Peyre Weak Fairness Semantic Drawbacks in Java Multithreading. Search on Bibsonomy Ada-Europe The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Doina Bein, Ajoy Kumar Datta, Chitwan K. Gupta, Lawrence L. Larmore Local Synchronization on Oriented Rings. Search on Bibsonomy SSS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Local mutual exclusion, oriented ring, synchronization, transformer, self-stabilization
26Armando Solar-Lezama, Christopher Grant Jones, Rastislav Bodík Sketching concurrent data structures. Search on Bibsonomy PLDI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF concurrency, synthesis, sketching, sat, spin
26Hagit Attiya, Alex Kogan, Jennifer L. Welch Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks. Search on Bibsonomy ICDCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Yantao Song, Scott M. Pike Eventually k-Bounded Wait-Free Distributed Daemons. Search on Bibsonomy DSN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF self-stabilization, wait-freedom, daemons
26Pablo F. Castro, T. S. E. Maibaum An ought-to-do deontic logic for reasoning about fault-tolerance: the diarrheic philosophers. Search on Bibsonomy SEFM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Scott M. Pike, Yantao Song, Kaustav Ghoshal Brief Announcement: Wait-Free Dining for Eventual Weak Exclusion. Search on Bibsonomy SSS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Sujatha Kashyap, Vijay K. Garg Exploiting predicate structure for efficient reachability detection. Search on Bibsonomy ASE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF model checking, reachability, Mazurkiewicz traces
26Shahid Jabbar, Stefan Edelkamp I/O Efficient Directed Model Checking. Search on Bibsonomy VMCAI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Dániel Varró Automated formal verification of visual modeling languages by model checking. Search on Bibsonomy Softw. Syst. Model. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Model checking, Formal verification, Model transformation, Metamodeling, Graph transformation
26Yifeng Chen, Jeff W. Sanders Logic of global synchrony. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF PRAM, reactive programming, Bulk-Synchronous Parallelism
26Dina Q. Goldin, David Keil Toward Domain-Independent Formalization of Indirect Interaction. Search on Bibsonomy WETICE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Marco Gavanelli, Evelina Lamma, Paola Mello, Paolo Torroni An Abductive Framework for Information Exchange in Multi-agent Systems. Search on Bibsonomy CLIMA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26David Jackson A Practical Approach to Evolving Concurrent Programs. Search on Bibsonomy EuroGP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Zhengwei Qi, Ruonan Rao, Guangtao Xue, Jinyuan You A New Formal Model Based on P-System for Mobile Transactions. Search on Bibsonomy IEEE SCC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Stefan Edelkamp Promela Planning. Search on Bibsonomy SPIN The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
26E. Allen Emerson, Vineet Kahlon Model Checking Large-Scale and Parameterized Resource Allocation Systems. Search on Bibsonomy TACAS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
26Yonit Kesten, Amir Pnueli, Elad Shahar, Lenore D. Zuck Network Invariants in Action. Search on Bibsonomy CONCUR The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
26Mikhail Nesterenko, Anish Arora Tolerance to Unbounded Byzantine Faults. Search on Bibsonomy SRDS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
26Christophe Sibertin-Blanc CoOperative Objects: Principles, Use and Implementation. Search on Bibsonomy Concurrent Object-Oriented Programming and Petri Nets The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Paola Inverardi, Massimo Tivoli Automatic synthesis of deadlock free connectors for COM/DCOM applications. Search on Bibsonomy ESEC / SIGSOFT FSE The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Patrick Keane, Mark Moir A General Resource Allocation Synchronization Problem. Search on Bibsonomy ICDCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Yifeng Chen, Jeff W. Sanders Logic of Global Synchrony. Search on Bibsonomy CONCUR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Paolo Baldan, Andrea Corradini 0001, Barbara König 0001 A Static Analysis Technique for Graph Transformation Systems. Search on Bibsonomy CONCUR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26George Varghese, Mahesh Jayaram The fault span of crash failures. Search on Bibsonomy J. ACM The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
26Bengi Karaçali, Kuo-Chung Tai, Mladen A. Vouk Deadlock Detection of EFSMs Using Simultaneous Reachability Analysis. Search on Bibsonomy DSN The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Simultaneous Reachability Analysis, Extended Finite State Machine Model, Race Conditions, Deadlock Detection
26Tsuyoshi Ohta, Tadanori Mizuno Towards an Algorithmic Debugging for Distributed Programs. Search on Bibsonomy APSEC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF debug, programming environment, distributed programs
26Jun Zhou, Kuo-Chung Tai Deadlock Analysis of Synchronous Message-Passing Programs. Search on Bibsonomy PDSE The full citation details ... 1999 DBLP  DOI  BibTeX  RDF LTS, Deadlock, CCS, Observational Equivalence
26Annabelle McIver Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms. Search on Bibsonomy ARTS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
26Deepinder P. Sidhu, Alexander L. Wijesinha Performance analysis of a constrained resource sharing system. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF performance analysis, operating systems, performance measures, resource sharing, queueing models
26Manhoi Choy, Ambuj K. Singh Localizing Failures in Distributed Synchronization. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF fault-tolerance, distributed algorithms, Concurrency, synchronization, lower bounds
Displaying result #1 - #100 of 113 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license