Search results for "deadlock-freedom"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
92	Paul C. Attie, Hana Chockler	Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs.	VMCAI	2005	DBLP DOI BibTeX RDF
76	Naoki Kobayashi 0001	Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness.	IFIP TCS	2000	DBLP DOI BibTeX RDF
76	Mila E. Majster-Cederbaum, Moritz Martens	Compositional analysis of deadlock-freedom for tree-like component architectures.	EMSOFT	2008	DBLP DOI BibTeX RDF	architecture, design patterns, interaction systems, compositionality, component-based systems, deadlock-freedom
66	Loren Schwiebert	Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	channel dependency graph, unreachable configuration, Wormhole routing, oblivious routing, deadlock freedom
63	Jayasri Banerjee, Anup Kumar Bandyopadhyay, Ajit Kumar Mandal	Some investigations on deadlock freedom issues of a cyclically connected system using Dijkstra's weakest precondition calculus.	ACM SIGPLAN Notices	2007	DBLP DOI BibTeX RDF	weakest precondition, program specification, deadlock freedom, program correctness
61	Olav Lysne, Timothy Mark Pinkston, José Duato	Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	deadlock-freedom methodology, system reliability and availability, Interconnection network, dynamic reconfiguration
52	Peter K. K. Loh, Wen-Jing Hsu	Design of a Vialbe Fault-Tolerant Routing Strategy for Optical-Based Grids.	ISPA	2003	DBLP DOI BibTeX RDF	livelock-freedom, wavelength-division multiplexing, Fault-tolerant routing, deadlock-freedom, grid networks
48	Alessandro Aldini, Marco Bernardo 0001	A General Approach to Deadlock Freedom Verification for Software Architectures.	FME	2003	DBLP DOI BibTeX RDF	software architecture, process algebra, deadlock
48	Henry F. Korth	Deadlock Freedom Using Edge Locks.	ACM Trans. Database Syst.	1982	DBLP DOI BibTeX RDF	concurrency control, locking, serializability
47	Dhabaleswar K. Panda 0001, Sanjay Singal, Ram Kesavan	Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	deadlock-freedom and interprocessor communication, multicast, interconnection networks, broadcast, meshes, Wormhole routing, collective communication, k-ary n-cubes
46	Naoki Kobayashi 0001, Davide Sangiorgi	A Hybrid Type System for Lock-Freedom of Mobile Processes.	CAV	2008	DBLP DOI BibTeX RDF
46	Gregor Gößler, Joseph Sifakis	Component-Based Construction of Deadlock-Free Systems: Extended Abstract.	FSTTCS	2003	DBLP DOI BibTeX RDF
46	Jörg Liebeherr, Ian F. Akyildiz	Deadlock properties of queueing networks with finite capacities and multiple routing chains.	Queueing Syst. Theory Appl.	1995	DBLP DOI BibTeX RDF	blocking networks, deadlocks, Queueing networks, deadlock prevention
45	Young-Joo Suh, Binh Vien Dao, José Duato, Sudhakar Yalamanchili	Software-Based Rerouting for Fault-Tolerant Pipelined Communication.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	E-cube routing, livelock freedom, fault tolerance, interconnection networks, multiprocessors, adaptive routing, wormhole switching, oblivious routing, deadlock freedom, virtual cut-through switching
45	Xicheng Liu, Sijing Zhang, Timothy J. Li	A Cost-Effective Load Balanced Adaptive Routing Scheme for Mesh-Connected Networks.	MASCOTS	2000	DBLP DOI BibTeX RDF	VBMAR, Crossed turn model, Load balance, Adaptive routing, Virtual channel, Network performance, Deadlock freedom
44	Naoki Kobayashi 0001	A New Type System for Deadlock-Free Processes.	CONCUR	2006	DBLP DOI BibTeX RDF
43	Li Jiao	A method for verifying deadlock freedom and liveness of petri nets.	ISCAS	2008	DBLP DOI BibTeX RDF
43	Mila E. Majster-Cederbaum, Moritz Martens, Christoph Minnameier	A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems.	SOFSEM (1)	2007	DBLP DOI BibTeX RDF
40	Jan A. Bergstra, Cornelis A. Middelburg	Thread algebra for strategic interleaving.	Formal Aspects Comput.	2007	DBLP DOI BibTeX RDF	Interleaving strategies, Services, Threads, Multi-threading, Deadlock freedom, Thread algebra
40	Alexandre Yakovlev, Victor Varshavsky, Vyacheslav Marakhovsky, Alexei L. Semenov	Designing an asynchronous pipeline token ring interface.	ASYNC	1995	DBLP DOI BibTeX RDF	asynchronous pipeline token ring interface, speed-independent interface, reliable communication medium, on-board multicomputer, asynchronous buses, point-to-point interconnections, syntax-driven implementation, channel protocol controller, protocols, fairness, multiprocessor interconnection networks, local area networks, pipeline processing, deadlock-freedom, token networks
39	Pangfeng Liu, Yi-Fang Lin, Jan-Jan Wu	An Incremental Network Topology for Contention-free and Deadlock-free Routing.	ICPADS	2002	DBLP DOI BibTeX RDF
37	Kohei Suenaga, Naoki Kobayashi 0001	Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts.	ESOP	2007	DBLP DOI BibTeX RDF
37	Jan A. Bergstra, Cornelis A. Middelburg	Model Theory for Process Algebra.	Processes, Terms and Cycles	2005	DBLP DOI BibTeX RDF
36	Kohei Suenaga	Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References.	APLAS	2008	DBLP DOI BibTeX RDF
36	Paola Inverardi, Sebastián Uchitel	Proving Deadlock Freedom in Component-Based Programming.	FASE	2001	DBLP DOI BibTeX RDF
36	Francis Chi-Moon Lau, S. W. Lau	Propagating buffer: a new approach to deadlock freedom in store-and-forward networks.	SPDP	1991	DBLP DOI BibTeX RDF
33	Michel A. Kinsy, Myong Hyon Cho, Tina Wen, G. Edward Suh, Marten van Dijk, Srinivas Devadas	Application-aware deadlock-free oblivious routing.	ISCA	2009	DBLP DOI BibTeX RDF	systems-on-chip, oblivious routing, on-chip interconnection networks
33	Joy N. Reed, Jane E. Sinclair, A. W. Roscoe 0001	Responsiveness of interoperating components.	Formal Aspects Comput.	2004	DBLP DOI BibTeX RDF	Refinement, CSP, Deadlock, Responsiveness, Component-based systems
33	Naoki Kobayashi 0001	A Partially Deadlock-Free Typed Process Calculus.	LICS	1997	DBLP DOI BibTeX RDF
33	J. M. R. Martin, S. A. Jassim	An Efficient Technique for Deadlock Analysis of Large Scale Process Networks.	FME	1997	DBLP DOI BibTeX RDF
32	Akiya Jouraku, Michihiro Koibuchi, Hideharu Amano	An Effective Design of Deadlock-Free Routing Algorithms Based on 2D Turn Model for Irregular Networks.	IEEE Trans. Parallel Distributed Syst.	2007	DBLP DOI BibTeX RDF	interconnection networks, Adaptive routing, PC clusters, deadlock avoidance, irregular topologies, system area networks, turn model
32	Shivali Agarwal, Rajkishore Barik, Dan Bonachea, Vivek Sarkar, R. K. Shyamasundar, Katherine A. Yelick	Deadlock-free scheduling of X10 computations with bounded resources.	SPAA	2007	DBLP DOI BibTeX RDF	deadlock-free scheduling, X10, active messages
28	Ingebjørg Theiss, Olav Lysne	FRoots: A Fault Tolerant and Topology-Flexible Routing Technique.	IEEE Trans. Parallel Distributed Syst.	2006	DBLP DOI BibTeX RDF	path redundancy, interconnection networks, Fault-tolerant routing, deadlock freedom
28	Jipeng Zhou	Fault-Tolerant Wormhole Routing with 2 Virtual Channels in Meshes.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	disjoint fault-connected region, fault-tolerant wormhole routing, virtual channel, deadlock freedom
28	José Duato, Olav Lysne, Ruoming Pang, Timothy Mark Pinkston	Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	deadlock-freedom theory, system reliability and availability, Interconnection network, dynamic reconfiguration
28	Jipeng Zhou, Francis C. M. Lau 0001	Adaptive Fault-Tolerant Wormhole Routing with Two Virtual Channels in 2D Meshes.	ISPAN	2004	DBLP DOI BibTeX RDF	adaptive fault-tolerant rout-ing, disjoint fault-connected regions, wormhole routing, Virtual channel, deadlock freedom
28	Rajeev Alur, Kousha Etessami, Mihalis Yannakakis	Inference of Message Sequence Charts.	IEEE Trans. Software Eng.	2003	DBLP DOI BibTeX RDF	concurrent state machines, formal verification, synthesis, scenarios, requirements analysis, Message sequence charts, realizability, deadlock freedom
28	Tor Skeie, Olav Lysne, Ingebjørg Theiss	Layered Shortest Path (LASH) Routing in Irregular System Area Networks.	IPDPS	2002	DBLP DOI BibTeX RDF	shortest path, Network routing, virtual channels, irregular topologies, deadlock freedom
28	Rajeev Alur, Kousha Etessami, Mihalis Yannakakis	Inference of message sequence charts.	ICSE	2000	DBLP DOI BibTeX RDF	concurrent state machines, synthesis, scenarios, message sequence charts, realizability, deadlock freedom
28	W. Stephen Lacy, José Cruz-Rivera, D. Scott Wills	The Offset Cube: A Three-Dimensional Multicomputer Network Topology Using Through-Wafer Optics.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	MPP networks, ultra-compact systems, offset cube, 3D packaging, through-wafer signaling, adaptive routing, optical interconnect, deadlock freedom, 3D mesh
28	Naoki Kobayashi 0001	A Partially Deadlock-Free Typed Process Calculus.	ACM Trans. Program. Lang. Syst.	1998	DBLP DOI BibTeX RDF	concurrency, type theory, deadlock-freedom
28	K. Vidyasankar	A Non-Two Phase Locking Protocol for Global Concurrency Control in Distributed Heterogeneous Database Systems.	IEEE Trans. Knowl. Data Eng.	1991	DBLP DOI BibTeX RDF	non-two-phase locking protocol, global concurrency control, distributed heterogeneous database systems, global transactions, database sites, rooted tree fashion, global transaction manager, GTM, g-local transactions, concurrency control mechanism, local transactions, g-local transactions, protocols, distributed databases, concurrency control, transaction processing, system recovery, serializability, deadlock freedom, general architecture
26	Saddek Bensalem, Marius Bozga, Joseph Sifakis, Thanh-Hung Nguyen	Compositional Verification for Component-Based Systems and Application.	ATVA	2008	DBLP DOI BibTeX RDF
26	Doddaballapur Narasimha-Murthy Jayasimha, Loren Schwiebert, D. Manivannan 0001, Jeff A. May	A foundation for designing deadlock-free routing algorithms in wormhole networks.	J. ACM	2003	DBLP DOI BibTeX RDF	Knowledge complexity, statistical difference, zero knowledge, proof systems
26	Dah-Ming Chiu, Miriam Kadansky, Radia J. Perlman, John Reynders, Guy L. Steele Jr., Murat Yuksel	Deadlock-Free Routing Based on Ordered Links.	LCN	2002	DBLP DOI BibTeX RDF
26	Mihaela Sighireanu, Radu Mateescu 0001	Verification of the Link Layer Protocol of the IEEE-1394 Serial Bus (FireWire): An Experiment with E-LOTOS.	Int. J. Softw. Tools Technol. Transf.	1998	DBLP DOI BibTeX RDF
26	Alexandre Mota 0001, Augusto Sampaio	Model-Checking CSP-Z.	FASE	1998	DBLP DOI BibTeX RDF
25	Amir Pnueli	Using Abstraction to Verify Arbitrary Temporal Properties.	APSEC	2008	DBLP DOI BibTeX RDF
25	Frank Olaf Sem-Jacobsen, Olav Lysne	Fault tolerance with shortest paths in regular and irregular networks.	IPDPS	2008	DBLP DOI BibTeX RDF
25	Samik Basu 0001, Scott A. Smolka	Model checking the Java metalocking algorithm.	ACM Trans. Softw. Eng. Methodol.	2007	DBLP DOI BibTeX RDF	XMC, metalocking, monitor queues, Java, mutual exclusion, synchronized methods
25	Yanjun Wen, Ji Wang 0001, Zhi-Chang Qi	2/3 Alternating Simulation Between Interface Automata.	ICFEM	2005	DBLP DOI BibTeX RDF
25	Sriram K. Rajamani, Jakob Rehof	A Behavioral Module System for the Pi-Calculus.	SAS	2001	DBLP DOI BibTeX RDF
23	Jules Jacobs, Stephanie Balzer, Robbert Krebbers	Multiparty GV: functional multiparty session types with certified deadlock freedom.	Proc. ACM Program. Lang.	2022	DBLP DOI BibTeX RDF
23	Jules Jacobs, Stephanie Balzer, Robbert Krebbers	Connectivity graphs: a method for proving deadlock freedom based on separation logic.	Proc. ACM Program. Lang.	2022	DBLP DOI BibTeX RDF
23	Yiming Ouyang, Muzi Zhang, Ruifeng Li, Qi Wang	Pitstop++: Enabling stable and fair deadlock freedom on fault-tolerant NoC.	Microprocess. Microsystems	2022	DBLP DOI BibTeX RDF
23	Pedro Antonino, Augusto Sampaio, Jim Woodcock 0001	A Pattern-based deadlock-freedom analysis strategy for concurrent systems.	CoRR	2022	DBLP DOI BibTeX RDF
23	Vida Sobhani, Kevin Kauth, Tim Stadtmann, Tobias Gemmeke	Deadlock-Freedom in Computational Neuroscience Simulators.	IEEE Des. Test	2022	DBLP DOI BibTeX RDF
23	Ornela Dardha, Jorge A. Pérez 0001	Comparing type systems for deadlock freedom.	J. Log. Algebraic Methods Program.	2022	DBLP DOI BibTeX RDF
23	Yibo Wu, Liang Wang 0020, Xiaohang Wang 0001, Jie Han 0001, Jianfeng Zhu 0001, Honglan Jiang, Shouyi Yin, Shaojun Wei, Leibo Liu	Upward Packet Popup for Deadlock Freedom in Modular Chiplet-Based Systems.	HPCA	2022	DBLP DOI BibTeX RDF
23	Bas van den Heuvel 0001, Jorge A. Pérez 0001	Deadlock Freedom for Asynchronous and Cyclic Process Networks.	ICE	2021	DBLP DOI BibTeX RDF
23	Bas van den Heuvel 0001, Jorge A. Pérez 0001	Deadlock Freedom for Asynchronous and Cyclic Process Networks (Extended Version).	CoRR	2021	DBLP BibTeX RDF
23	Marius Bozga, Radu Iosif, Joseph Sifakis	Checking deadlock-freedom of parametric component-based systems.	J. Log. Algebraic Methods Program.	2021	DBLP DOI BibTeX RDF
23	Amir Charif, Alexandre Coelho, Nacer-Eddine Zergainoh, Michael Nicolaidis	A Dynamic Sufficient Condition of Deadlock-Freedom for High-Performance Fault-Tolerant Routing in Networks-on-Chips.	IEEE Trans. Emerg. Top. Comput.	2020	DBLP DOI BibTeX RDF
23	Mayank Parasar	Subactive techniques for guaranteeing routing and protocol deadlock freedom in interconnection networks.		2020	RDF
23	Aniruddh Ramrakhyani, Paul V. Gratz, Tushar Krishna	Synchronized Progress in Interconnection Networks (SPIN): A New Theory for Deadlock Freedom.	IEEE Micro	2019	DBLP DOI BibTeX RDF
23	Mayank Parasar, Tushar Krishna	BINDU: deadlock-freedom with one bubble in the network.	NOCS	2019	DBLP DOI BibTeX RDF
23	Stephanie Balzer, Bernardo Toninho, Frank Pfenning	Manifest Deadlock-Freedom for Shared Session Types.	ESOP	2019	DBLP DOI BibTeX RDF
23	Marius Bozga, Radu Iosif, Joseph Sifakis	Checking Deadlock-Freedom of Parametric Component-Based Systems.	TACAS (2)	2019	DBLP DOI BibTeX RDF
23	Ornela Dardha, Jorge A. Pérez 0001	Comparing Type Systems for Deadlock-Freedom.	CoRR	2018	DBLP BibTeX RDF
23	Marius Bozga, Radu Iosif, Joseph Sifakis	Checking Deadlock-Freedom of Parametric Component-Based Systems.	CoRR	2018	DBLP BibTeX RDF
23	Paul C. Attie, Saddek Bensalem, Marius Bozga, Mohamad Jaber 0001, Joseph Sifakis, Fadi A. Zaraket	Global and Local Deadlock Freedom in BIP.	ACM Trans. Softw. Eng. Methodol.	2018	DBLP DOI BibTeX RDF
23	Mayank Parasar, Ankit Sinha, Tushar Krishna	Brownian Bubble Router: Enabling Deadlock Freedom via Guaranteed Forward Progress.	NOCS	2018	DBLP DOI BibTeX RDF
23	Aniruddh Ramrakhyani, Paul V. Gratz, Tushar Krishna	Synchronized Progress in Interconnection Networks (SPIN): A New Theory for Deadlock Freedom.	ISCA	2018	DBLP DOI BibTeX RDF
23	Pedro Yébenes, Jesús Escudero-Sahuquillo, Pedro Javier García, Francisco J. Alfaro-Cortes, Francisco José Quiles Flor	Providing differentiated services, congestion management, and deadlock freedom in dragonfly networks with adaptive routing.	Concurr. Comput. Pract. Exp.	2017	DBLP DOI BibTeX RDF
23	Pedro Yébenes, Jesús Escudero-Sahuquillo, Pedro Javier García, Francisco J. Alfaro-Cortes, Francisco J. Quiles 0001	Providing differentiated services, congestion management, and deadlock freedom in dragonfly networks with adaptive routing.	Concurr. Comput. Pract. Exp.	2017	DBLP DOI BibTeX RDF
23	Ryuta Kawano, Hiroshi Nakahara, Seiichi Tade, Ikki Fujiwara, Hiroki Matsutani, Michihiro Koibuchi, Hideharu Amano	A Novel Channel Assignment Method to Ensure Deadlock-Freedom for Deterministic Routing.	IEICE Trans. Inf. Syst.	2017	DBLP DOI BibTeX RDF
23	Pedro Yébenes, Jesús Escudero-Sahuquillo, Pedro Javier García, Francisco J. Quiles 0001, Torsten Hoefler	An Effective Queuing Scheme to Provide Slim Fly Topologies with HoL Blocking Reduction and Deadlock Freedom for Minimal-Path Routing.	HiPINEB@HPCA	2017	DBLP DOI BibTeX RDF
23	Abderrahim Ait Wakrime	Deadlock-freedom of scientific applications using strict colored FIFO nets.	CoDIT	2017	DBLP DOI BibTeX RDF
23	Xiaolu Wang, Huaxi Gu, Yintang Yang, Kun Wang 0001, Qinfen Hao	A Highly Scalable Optical Network-on-Chip With Small Network Diameter and Deadlock Freedom.	IEEE Trans. Very Large Scale Integr. Syst.	2016	DBLP DOI BibTeX RDF
23	Dan Zhang 0002, Dragan Bosnacki, Mark van den Brand, Cornelis Huizing, Bart Jacobs 0002, Ruurd Kuiper 0001, Anton Wijs	Verifying Atomicity Preservation and Deadlock Freedom of a Generic Shared Variable Mechanism Used in Model-To-Code Transformations.	MODELSWARD (Revised Selected Papers)	2016	DBLP DOI BibTeX RDF
23	Pedro Yébenes, Jesús Escudero-Sahuquillo, Pedro Javier García, Francisco J. Alfaro, Francisco J. Quiles 0001	Providing Differentiated Services, Congestion Management, and Deadlock Freedom in Dragonfly Networks.	HiPINEB@HPCA	2016	DBLP DOI BibTeX RDF
23	Pedro R. G. Antonino, Thomas Gibson-Robinson, A. W. Roscoe 0001	Tighter Reachability Criteria for Deadlock-Freedom Analysis.	FM	2016	DBLP DOI BibTeX RDF
23	Pedro Antonino, Thomas Gibson-Robinson, A. W. Roscoe 0001	Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving.	IFM	2016	DBLP DOI BibTeX RDF
23	Alessandro Bianchi, Sebastiano Pizzutilo, Gennaro Vessio	Towards an ASM-based Characterization of the Deadlock-freedom Property.	ICSOFT-PT	2016	DBLP DOI BibTeX RDF
23	Timo Schneider, Otto Bibartiu, Torsten Hoefler	Ensuring Deadlock-Freedom in Low-Diameter InfiniBand Networks.	Hot Interconnects	2016	DBLP DOI BibTeX RDF
23	Ehsan Khamespanah, Marjan Sirjani, Zeynab Sabahi-Kaviani, Ramtin Khosravi, Mohammad-Javad Izadi	Timed Rebeca schedulability and deadlock freedom analysis using bounded floating time transition system.	Sci. Comput. Program.	2015	DBLP DOI BibTeX RDF
23	Divjyot Sethi, Muralidhar Talupur, Sharad Malik	Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom.	CoRR	2014	DBLP BibTeX RDF
23	Mila Dalla Preda, Maurizio Gabbrielli, Saverio Giallorenzo, Ivan Lanese, Jacopo Mauro	Deadlock Freedom by Construction for Distributed Adaptive Applications.	CoRR	2014	DBLP BibTeX RDF
23	Prakash Chandrasekaran, Kavum Muriyil Balachandran Shibu Kumar, Remish L. Minz, Deepak D'Souza, Lomesh Meshram	A multi-core version of FreeRTOS verified for datarace and deadlock freedom.	MEMOCODE	2014	DBLP DOI BibTeX RDF
23	Divjyot Sethi, Muralidhar Talupur, Sharad Malik	Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom.	ATVA	2014	DBLP DOI BibTeX RDF
23	Brad D. Bingham, Jesse D. Bingham, John Erickson, Mark R. Greenstreet	Distributed Explicit State Model Checking of Deadlock Freedom.	CAV	2013	DBLP DOI BibTeX RDF
23	Richard Müller 0001, Christian Stahl, Wil M. P. van der Aalst, Michael Westergaard	Service Discovery from Observed Behavior while Guaranteeing Deadlock Freedom in Collaborations.	ICSOC	2013	DBLP DOI BibTeX RDF
23	Marco Carbone, Fabrizio Montesi	Deadlock-freedom-by-design: multiparty asynchronous global programming.	POPL	2013	DBLP DOI BibTeX RDF
23	Duy-Khanh Le, Wei-Ngan Chin, Yong Meng Teo	An Expressive Framework for Verifying Deadlock Freedom.	ATVA	2013	DBLP DOI BibTeX RDF
23	Christian Stahl, Walter Vogler	A trace-based service semantics guaranteeing deadlock freedom.	Acta Informatica	2012	DBLP DOI BibTeX RDF
23	Moritz Martens, Mila E. Majster-Cederbaum	Deadlock-freedom in component systems with architectural constraints.	Formal Methods Syst. Des.	2012	DBLP DOI BibTeX RDF
23	Ehsan Khamespanah, Zeynab Sabahi-Kaviani, Ramtin Khosravi, Marjan Sirjani, Mohammad-Javad Izadi	Timed-rebeca schedulability and deadlock-freedom analysis using floating-time transition system.	AGERE!@SPLASH	2012	DBLP DOI BibTeX RDF
23	Colin S. Gordon, Michael D. Ernst, Dan Grossman	Static lock capabilities for deadlock freedom.	TLDI	2012	DBLP DOI BibTeX RDF
23	Brad D. Bingham, Mark R. Greenstreet, Jesse D. Bingham	Parameterized verification of deadlock freedom in symmetric cache coherence protocols.	FMCAD	2011	DBLP BibTeX RDF
23	Alexander Gotmanov, Satrajit Chatterjee, Michael Kishinevsky	Verifying Deadlock-Freedom of Communication Fabrics.	VMCAI	2011	DBLP DOI BibTeX RDF