- Active Disk Paxos with infinitely many processes
- Noname manuscript No. (will be inserted by the editor)
- Elimination Trees and the Construction of Pools and Stacks (PRELIMINARY VERSION)
- Efficient Replication of Large Data Objects Rui Fan and Nancy Lynch
- Fault-Tolerance Through k-Connectivity Alejandro Cornejo Nancy Lynch
- Formal Aspects of Computing (1995) 3: 1{000 Action Transducers and
- Computer-Assisted Simulation Proofs J rgen F. S gaard-Andersen1?, Stephen J. Garland, John V. Guttag,
- Correctness of Vehicle Control Systems: A Case Henri B. Weinberg
- Compiling IOA without Global Synchronization Joshua A. Tauber, Nancy A. Lynch, Michael J. Tsai
- Formal Verification of SafetyCritical Hybrid Systems ?
- Developing Strategies for Specialized Theorem Proving about Untimed, Timed, and Hybrid I/O
- Systematic Removal of Nondeterminism for Code Generation in I/O Automata
- Solvability Asynchronous
- Proving Performance Properties (even Probabilistic Ones)
- Proving Safety Properties of the Steam Boiler Controller G. Leeb, N. Lynch Page 1 of 20
- Multicast Group Communication as a Base for a Load-Balancing Replicated Data Service
- Energy Efficient Connected Clusters for Mobile Ad Hoc Networks
- Performing tasks on restartable messagepassing processors ?
- Formal Aspects of Computing (1997) 3: 1{000 A Comparison of Simulation Techniques
- GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks
- Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
- Implementation and Evaluation of an Eventually-Serializable Data Service
- RAMBONODES for the Metropolitan Ad Hoc Network Jacob Beal Seth Gilbert
- Compositionality for Probabilistic Automata Nancy Lynch y
- Cooperative Computing with Fragmentable and Mergeable Groups
- Modeling and Veri cation of Randomized Distributed Real-Time Systems
- Weak Graph Colorings: Distributed Algorithms and Applications
- Formally Modeling, Analyzing, and Designing Network Protocols | A Case Study on Retransmission-Based
- Implementing and Evaluating an EventuallySerializable Data Service
- Forward and Backward Simulations Part I: Untimed Systems
- Computation-Centric Memory Models Matteo Frigo
- Easy Impossibility Proofs for Distributed Consensus Problems Michael J. Fischer
- Brief Announcement: Efficient Replication of Large Data MIT Laboratory for Computer Science
- On the Borowsky-Gafni Simulation Algorithm (Extended Abstract)
- Implementing Atomic Data through Indirect Learning in Dynamic Networks Kishori M. Konwar
- Clock Synchronization for Wireless Networks Indraneel Chakraborty
- Socratic Game Theory: Playing Games in Many Possible Worlds Seth Gilbert
- Group Communication as a Base for a
- Formal Aspects of Computing (1995) 3: 1{000 Action Transducers and
- Stage 1 Stage 2 Stage 1 Stage 2 Stage 3
- Self-Stabilizing Mobile Node Location Management and Message Routing
- The Abstract MAC Layer Fabian Kuhn, Nancy Lynch, and Calvin Newport
- A Theory of Clock Synchronization Submitted to the Department of Electrical Engineering and Computer Science
- Event Order Abstraction for Parametric Timed Verification Shinya Umeno,
- Reactive Diffracting Trees (Extended Abstract)
- C. Livadas and I. Keidar, "The Case for Exploiting Packet Loss Locality in Multicast Loss Recovery," Technical Report MIT/LCS/TR-867, Lab. for
- Using I/O Automata for Developing Distributed Systems Stephen J. Garland
- Brief Announcement: Minimum Spanning Trees and Cone-Based Topology Control
- Reliably Detecting Connectivity using Local Graph Traits
- Decomposing Broadcast Algorithms Using Abstract MAC Layers
- Computer Science and Artificial Intelligence Laboratory Technical Report
- Broadcasting in Unreliable Radio Networks Fabian Kuhn
- Self-Stabilizing Robot Formations over Unreliable Seth Gilbert, Ecole Polytechnique Federale, Lausanne
- On the Weakest Failure Detector Ever Rachid Guerraoui
- Brief Announcement: Hardness of Broadcasting in Wireless Networks with Unreliable Communication
- Computer Science and Artificial Intelligence Laboratory Technical Report
- Connectivity Service for Mobile Ad-Hoc Networks Alejandro Cornejo and Nancy Lynch
- Tempo: A Toolkit for The Timed Input/Output Automata Formalism
- On the Weakest Failure Detector Ever Rachid Guerraoui
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics
- Self-stabilization and Virtual Node Layer Tina Nolte and Nancy Lynch
- A Virtual Node-Based Tracking Algorithm for Mobile Networks Tina Nolte and Nancy Lynch
- Specifying and Proving Properties of Timed I/O Automata in the TIOA Toolkit
- Computer Science and Artificial Intelligence Laboratory Technical Report
- Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
- Task-Structured Probabilistic I/O Automata Ran Canetti1,2
- Switched PIOA: Parallel Composition via Distributed Scheduling
- Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
- An (n log n) Lower Bound on the Cost of Mutual MIT Computer Science and AI Laboratory
- Verifying Average Dwell Time by Solving Optimization Problems
- The Impossibility of Boosting Distributed Service Resilience Paul Attie
- Timed Virtual Stationary Automata for Mobile Networks
- Virtual Stationary Automata for Mobile Networks Shlomi Dolev,
- Timed Virtual Stationary Automata for Mobile Networks Shlomi Dolev,
- TIOA Tutorial Stephen J. Garland, Dilsun Kaynar, Nancy A. Lynch,
- Using Virtual Nodes to Coordinate the Motion of Mobile Nodes
- Motion Coordination using Virtual Nodes Nancy Lynch, Sayan Mitra, and Tina Nolte
- Specifying and Proving Timing Properties with TIOA Tools Dilsun Kaynar, Nancy Lynch, Sayan Mitra
- Dynamic Input/Output Automata: a Formal and Compositional Model for Dynamic Systems1
- STALK: A Self-Stabilizing Hierarchical Tracking Service for Sensor Networks
- RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks Seth Gilbert
- An Algorithm for an Intermittently Atomic Data Service Based on Group Communication
- Livadas, C. and Lynch, N. A. A Reliable Broadcast Scheme for Sensor Networks. Technical Report MIT/CSAIL/TR-
- Compositionality for Probabilistic Automata Nancy Lynch1,
- Working With Mike on Distributed Computing Theory, Nancy Lynch
- Atomic Data Access in Distributed Hash Tables Nancy Lynch1
- 12. Communication and Data Sharing for Dynamic Distributed Systems
- High-Level Modeling and Analysis of an Air-Traffic Management System
- I/O Automaton Model of Operating System Primitives Daniel Yates Nancy Lynch
- Liveness in Timed and Untimed Systems Roberto Segalay Rainer Gawlickz J rgen S gaard-Andersenx Nancy Lynch{
- Specifying and Using a Partitionable Group Communication Service
- Eventually-Serializable Data Services Alan Fekete* David Guptat Victor Luchangcot Nancy Lyncht Alex Shvartsmant
- Reliable Communication Over Unreliable Channels YEHUDA AFEK
- Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty
- Are Wait-Free Algorithms HAGIT ATTIYA
- Simulation Techniques for Proving Properties of Real-Time Systems
- Forward and Backward Simulations Part I: Untimed Systems
- The Impossibility of Implementing Reliable Communication in the Face of Crashes
- Forward and Backward Simulations Part II: Timing-Based Systems
- A Tradeoff Between Safety and Liveness for Randomized Attack Protocols
- Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty*
- Distributed FIFO Allocation of Identical Resources Using Small Shared Space
- A Hundred Impossibility Proofs for Distributed Computing Nancy A. Lynch *
- Consensusin the Presenceof Partial Synchrony CYNTHIA DWORK AND NANCY LYNCH
- The Data Link Layer: Two Impossibility Results Nancy Lynch, Yishay Mansour and Alan Fekete
- Hierarchical Correctness Proofs Distributed Algorithms
- Reaching Approximate Agreement in the Presenceof Faults
- Correctness Conditions/'or ttighly Available Replicated Databases
- THE IMPACT OF SYNCHRONOUS COMMUNICATION ON THE PROBLEM
- Multilevel Atomicity-A New Correctness Criterion for Database Concurrency Control
- FASTALLOCATIONOF NEARBYRESOURCESIN A DISTRIBUTEDSYSTEM Nancy A. Lynch
- STRAIGHT-LINE PROGRAM LENGTH AS A PARAMETER FOR COMPLEXITY MEASU~S*
- Log Space Recognition and Translation of Parenthesis NANCY LYNCH
- Size Complexity in Context-Free Grammar Forms SEYMOUR GINSBURG AND NANCY LYNCH
- On Reducibility to Complex or Sparse Sets NANCY LYNCH
- SETS THAT DON'T HELP* Nancy Lynch
- A Three-Level Analysis of a Simple Acceleration Maneuver, with Uncertainties
- A Three-Level Analysis of a Simple Acceleration Maneuver, with Uncertainties
- Designing a Caching-Based Reliable Multicast Protocol Carolos Livadas Idit Keidar Nancy A. Lynch
- I/O Automaton Models and Proofs for Shared-Key Communication Systems Nancy Lynch
- High-Level Modeling and Analysis of TCAS Carolos Livadas, John Lygeros, and Nancy A. Lynch
- A Dynamic View-Oriented Group Communication Service*
- The IOA Language and Toolset: Support for Designing, Analyzing, and Building Distributed Systems
- A Toolbox for Proving and Maintaining Hybrid Speci cations
- Safety Veri cation for Automated Platoon A Case Study
- On the Formal Veri cation of the TCAS Con ict Resolution Algorithms 1
- Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts
- Veri cation of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study?
- Proving Safety Properties of the Steam Boiler Controller G. Leeb, N. Lynch Page 1 of 37
- Corrections to "Proving Safety Properties of the Steam Boiler Controller" Correction Sheet
- Modelling and Veri cation of Automated Transit Systems, using Timed Automata, Invariants and
- Hybrid I/O Automata (extended abstract)
- Liveness in Timed and Untimed Systems ? Rainer Gawlick1
- The Generalized Railroad Crossing: A Case Study in Formal Veri cation of Real-Time Systems
- Proving Time Bounds for Randomized Distributed Algorithms Nancy Lynch Isaac Saias Roberto Segala
- Probabilistic Simulations for Probabilistic Processes ? Roberto Segala and Nancy Lynch
- Formal Verification of Safety-Critical Hybrid Systems
- Noname manuscript No. (will be inserted by the editor)
- Gradient Clock Synchronization in Dynamic Networks Fabian Kuhn
- Deploying Wireless Networks with Beeps Alejandro Cornejo1
- Prioritized Gossip in Vehicular Networks Alejandro Cornejo
- Reliable Neighbor Discovery for Mobile Ad Hoc Networks Alejandro Cornejo
- Gradient Clock Synchronization Using Reference Fabian Kuhn1
- On the Treeness of Internet Latency and Bandwidth Venugopalan
- Simulation and Evaluation of the Reactive Virtual Node Layer Mike Spindel
- Event Order Abstraction for Parametric Real-Time System Verification
- Computer Science and Artificial Intelligence Laboratory Technical Report
- Air Traffic Control Using Virtual Stationary Automata Matthew D. Brown
- Verifying Statistical Zero Knowledge with Approximate Implementations
- A Verification Framework for Hybrid Systems
- Proving safety properties of an aircraft landing protocol using timed and untimed I/O automata: a case study
- Brief Announcement: Virtual Stationary Automata for Mobile Networks
- Autonomous Virtual Mobile Nodes (Extended Abstract)
- Proof Step TAME Strategy Use Get base and induction cases AUTO_INDUCT Start an induction proof
- Byzantine Disk Paxos Optimal Resilience with Byzantine Shared Memory
- Synthesis of Fault-Tolerant Concurrent Programs PAUL C. ATTIE
- Brief Announcement: Virtual Mobile Nodes for Mobile Ad Hoc Networks
- Long-Lived Rambo: Trading Knowledge for Communication
- Implementing Asynchronous Distributed Systems Using the IOA Chryssis Georgiou 1
- The Quorum Deployment Problem (Extended Abstract)
- Implementing a Reconfigurable Atomic Memory Service for Dynamic Networks Peter M. Musial1
- On the Implementation Complexity of Specifications of Concurrent Programs
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
- Availability Study of Dynamic Voting Algorithms Kyle W. Ingols
- Dynamic Load Balancing with Group Communication
- Multicast Group Communication as a Base for a Load-Balancing Replicated Data Service
- Reliable Message Delivery and Conditionally-Fast Transactions are not Possible without Accurate Clocks
- Performing Tasks on Restartable Message-Passing Processors*
- Formal Veri cation of TCP and T/TCP Mark Anthony Shawn Smith
- A Steady State Analysis of Di racting Nir Shavit Eli Upfal y Asaph Zemach z
- Proving Correctness of a Controller Algorithm for the RAID Level 5 System
- Admission Control and Routing: Theory and Practice Rainer Gawlick
- Using Simulation Techniques to Prove Timing Properties Victor Luchangco
- Verification of the Timing Properties of MMT Automata
- Quiescence, Fairness, Testing, and Implementation
- A Process Algebraic View of I O Automata Roberto Segala
- Fault Tolerant Video on Demand Services Tal Anker Danny Dolev Idit Keidar
- Communication Constrained Task Allocation For Robotic Networks
- Seth Gilbert Simple Communication-Optimal
- Simulating Routing over Virtual Nodes
- Aerospace Robotics and Embedded Systems Laboratory Distributed robotics
- Time Bounds in Task-PIOA Polynomial Composition
- Introduction Proposed Algorithm
- Programming Spatial Computers Jonathan Bachrach & Jacob Beal
- Code Generation for the IOA Language Michael J. Tsai
- A Compositional Trace-Based Semantics for Probabilistic Automata ?
- Time Optimal Self-Stabilizing Spanning Tree Algorithms Sudhanshu Madan Aggarwal
- A General Characterization of Indulgence R. GUERRAOUI
- Computer Science and Artificial Intelligence Laboratory Technical Report
- Gradient Clock Synchronization in Dynamic Networks Fabian Kuhn
- A VIRTUALLY SYNCHRONOUS GROUP MULTICAST ALGORITHM FOR WANS: FORMAL APPROACH
- IOA: A Language for Specifying, Programming, and Validating Distributed Systems 1
- Rambo: A Recon gurable Atomic Memory Service for Dynamic Networks
- Trade-o s between Message Delivery and Quiesce Times in Connection Management Protocols
- RAMBO: A Robust, Reconfigurable Atomic Memory Service for Dynamic Networks
- Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
- Translating Timed I/O Automata Specifications for Theorem Proving in PVS
- Discrete Event Dyn Syst DOI 10.1007/s10626-007-0032-1
- Di racting Trees Nir Shavityz
- Virtual Mobile Nodes for Mobile Ad Hoc Networks (Extended Abstract)
- Switched Probabilistic I/O Automata Ling Cheung1
- Formal Veri cation of Communication Protocols M. A. S. Smith
- ISSN 1397{8640 AALBORG UNIVERSITY
- Speci cations and Proofs for Ensemble Layers Jason Hickey1, Nancy Lynch2, Robbert van Renesse1
- A Correctness Condition for Memory Shared by Byzantine Processes
- Safety Veri cation for Automated Vehicle Ekaterina Dolginova
- Brief Announcement: Autonomous Virtual Mobile Nodes # Shlomi Dolev + Seth Gilbert # Elad Schiller +# Alex Shvartsman # Jennifer Welch
- Structuring Unreliable Radio Networks Keren Censor-Hillel
- Task-Structured Probabilistic I/O Automata Ran Canetti
- information and computation 128, 57 71 (1996) A Tradeoff between Safety and Liveness for
- Formal Verification of Timed Properties of Randomized Distributed Algorithms* Anna Pogosyants and Roberto Segala
- Verifying Timing Properties of Concurrent Algorithms Victor Luchangco, Ekrem Soylemez, Stephen Garland, and Nancy Lyncha
- Forward and Backward Simulations for Timing-Based Nancy Lynch and Frits Vaandrager
- Distributed Subgradient Methods for Multi-agent Optimization
- Tight Bounds for kSet Agreement Soma Chaudhuri Maurice Herlihy Nancy A. Lynch Mark R. Tuttle
- Proving Correctness of a Controller Algorithm for the RAID Level 5 System \Lambda
- Distrib. Comput. (2000) 13: 155186 c Springer-Verlag 2000
- Brief Announcement: STALK ---A SelfStabilizing Hierarchical Tracking Service for Sensor Networks
- Availability Study of Dynamic Voting Algorithms Kyle Ingols Idit Keidar
- A Serialization Graph Construction for Nested Transactions Alan Fekete'
- Iterated Models and Failure Detectors (Brief notes for discussion)
- Reliable Distributed Computing on Unreliable Radio Channels
- Virtual Infrastructure for Collision-Prone Wireless Networks
- Optimal Gradient Clock Synchronization in Dynamic Fabian Kuhn
- Automatic Generation of Invariants in Spin Mandana Vaziri and Gerard Holzmanny
- THE DISTRIBUTED FIRING SQUAD PROBLEM (Preliminary Version)
- A Tight Lower Bound for Processor Coordination Soma Chaudhuriy Maurice Herlihyz Nancy A. Lynchy Mark R. Tuttlez
- Reactive Di racting Trees Giovanni Della-Libera
- Distributed ErrorCorrecting
- Multimedia Multicast Transport Service for Groupware
- Counting Networks are Practically Linearizable" Nancy Lynch t Nir Shavit $ Alex Shvartsman~ Dan Touitou f
- A Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANs
- Theoretical Computer Science 269 (2001) 163201 www.elsevier.com/locate/tcs
- Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable
- An Introduction to Input/Output Automata Nancy A. Lynch and Mark R. Tuttle
- COORDINATION &COLLABORATION
- Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and
- MAC Design for Analog Network Coding Majid Khabbazian1
- Securing Every Bit: Authenticated Broadcast in Radio Networks
- Maurice Herlihy Digital Equipment Corporation
- Safety Verification of an Aircraft Landing Protocol: A Refinement Approach
- May 12, 1999 15:20 WorldScienti c/ws-b8-5x6-0 main to World Scienti c Publishing Company
- Randomness versus Non-Determinism in Distributed Computing t
- Quorum Consensus in Nested Transaction Systems Kenneth J. Goldman and Nancy A. Lynch
- Interference-Resilient Information Exchange Seth Gilbert
- HighLevel Modeling and Analysis of the Traffic Alert and Collision Avoidance System (TCAS) \Lambda
- Distributed Computation Meets Design Theory: Local Scheduling for Disconnected Cooperation
- Livadas, C., and Lynch, N. A. A Formal Venture into Reliable Multicast Territory. Technical Report MIT/LCS/TR-868, Lab.
- Multicast Group Communication as a Base for a LoadBalancing Replicated Data Service
- Memory Consistency Models for High Performance Distributed Victor Luchangco
- Hybrid I/O Automata Revisited Nancy Lynch 1? , Roberto Segala 2?? , and Frits Vaandrager 3? ? ?
- The Theory of Timed I/O Automata Dilsun K. Kaynar and Nancy Lynch
- Electing a Leader in a SynchronousRing GREG N. FREDERICKSON
- A Simulator for the IOA Language Anna E. Chefter
- The TIOA Language Version 0.21
- W. R. Cleaveland (Ed.) Third International Conference
- Trace-based Semantics for Probabilistic Timed I/O Automata
- Towards a Topological Characterization of Asynchronous Gunnar Waaler Hoest
- Broadcasting in Unreliable Radio Networks Fabian Kuhn Nancy Lynch Calvin Newport
- A Comparison of Simulation Techniques and Algebraic Techniques for Verifying Concurrent Systems
- A One-Round Algorithm for Virtually Synchronous Group Communication in Wide Area Networks
- Forward and Backward Simulations Part II: Timing-Based Systems
- Definition and Expansion of Composite Automata in IOA MIT-LCS-TR-959
- A New Fault-Tolerant Algorithm for Clock Synchronization
- Self-Stabilization by Local Checking and Correction George Varghese
- Elimination Trees and the Construction of Pools and Tel-Aviv University
- The Virtual Node Layer: A Programming Abstraction for Wireless Sensor Networks
- Group Communication as a Base for a
- Strings of Vehicles: Modeling & Safety Conditions ?
- TIOA User Guide and Reference Manual Stephen J. Garland Computer Science and Artificial Intelligence Laboratory
- Formal Verification of Safety-Critical Hybrid Systems
- Cooperative Computing with Fragmentable and Mergeable Groups
- LOWER BOUNDS FOR RANDOMIZED CONSENSUS UNDER A WEAK ADVERSARY
- On Formal Modeling of Agent Computations Tadashi Araragi1
- Computer Science and Artificial Intelligence Laboratory Technical Report
- Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
- Fast Information Spreading in Graphs with Large Weak Conductance
- Integrating distributed multimedia systems and interactive television networks
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Lower Bounds in Distributed Computing Submitted to the Department of Electrical Engineering and Computer Science
- Nested Transactions and Read/Write Locking (Prehmmary Report)
- Crypt ographic Protocols Richard A. DeMillo
- I/O Automaton Models and Proofs for Shared-Key Communication Systems
- Co~nparison of Polynomial-Time Reducibilities Richard Ladner
- Implementing Sequentially Consistent Shared Objects using Broadcast and PointToPoint Communication
- MultiChord: A Resilient Namespace Management Protocol Nancy Lynch Ion Stoica
- Dynamic Load Balancing with Group Communication #
- ROBUST DISTRIBUTED COOPERATION IN THE PRESENCE OF QUANTIFIED ADVERSITY
- DISTRIBUTED SCHEDULING FOR DISCONNECTED COOPERATION
- Neighbor Discovery in Mobile Ad Hoc Networks Using an Abstract MAC Layer
- A Proof of Burns N-Process Mutual Exclusion Algorithm using Abstraction
- Simulating Fixed Virtual Nodes for Adapting Wireline Protocols to MANET
- Distributed Computation on Unreliable Radio Channels
- Around the Tempo Toolset Userguide Xavier Koegler, under the supervision of Nancy Lynch
- Machine-Assisted Parameter Synthesis of the Biphase Mark Protocol Using Event Order Abstraction
- COMPARATIVE COMPLEXITY OF GRAMMAR FORMS Seymour Ginsburg and Nancy Lynch
- Correctness of Communication Protocols A Case Study
- Efficient Asynchronous Distributed Baruch Awerbuch * Lenore Cowen
- Multi-Selectors Interference-Resilient Information Exchange
- A Formal Venture into Reliable Multicast Carolos Livadas and Nancy A. Lynch
- Digital Object Identifier (DOI) 10.1007/s00446-002-0072-6 Distrib. Comput. (2003) 16: 7174
- Modeling Radio Networks Calvin Newport and Nancy Lynch
- Automated Formal Verification of the DHCP Failover Protocol Using Timeout Order Abstraction
- Caching-Enhanced Scalable Reliable Multicast Carolos Livadas
- Approximate Simulations for Probabilistic I/O Automata
- Veri cation of Automated Vehicle Protection Systems
- A ClientServer Oriented Algorithm for Virtually Synchronous Group Membership in WANs
- The Theory of Timed I/O Automata Dilsun K. Kaynar, Nancy Lynch, Roberto Segala, Frits Vaandrager
- Distributed Cooperation During the Absence of Communication ?
- Group Communication Speci cations: A Comprehensive Study Roman Vitenberg
- In Search of Interesting VANET Theory Problems
- Modeling and Veri cation of Randomized Distributed Real-Time Systems
- Distributed Computation in Dynamic Networks Fabian Kuhn
- Testing Self-Similar Networks Constantinos Djouvas1
- Algorithms and Lower Bounds forAlgorithms and Lower Bounds for Distributed Coloring ProblemsDistributed Coloring Problems
- On Building Blocks for Distributed Systems Roberto De Prisco
- Veri cation of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study
- ConditionBased Synchronous
- TIOA and UPPAAL Christine Margaret Robson
- Chapter on Distributed Computing Leslie Lamport and Nancy Lynch
- Power Optimization in FaultTolerant Topology Control Algorithms for Wireless Multihop Networks
- Precedence-Based Memory Models Victor Luchangco?
- RAMBO: A Robust, Reconfigurable Atomic Memory Service for Dynamic Networks
- Computer Science and Artificial Intelligence Laboratory Technical Report
- Virtual Stationary Timed Automata for Mobile Networks Tina Ann Nolte
- Synthesis of Concurrent Programs for an Atomic Read/Write Model of Computation
- GeoQuorums: Implementing Atomic Memory in Ad Hoc Networks (Extended Abstract)
- QOS PRESERVING TOTALLY ORDERED MULTICAST ZIV BAR-JOSEPH, IDIT KEIDAR, TAL ANKER, NANCY LYNCH
- Group Communication Idit Keidar
- A Fault-Tolerant Dynamic Atomic Broadcast Algorithm with QoS Guarantees
- Errata, first printing Nancy Lynch
- A Client-Server Approach to Virtually Synchronous Group Multicast: Speci cations, Algorithms, and Proofs
- Using Mappings to Prove Timing Properties* (EXTENDED ABSTRACT)
- Efficient Reducibility Between Programming Systems: Preliminary Report*
- Timed Virtual Stationary Automata for Mobile Networks Shlomi Dolev, Limor Lahiani
- Combining Funnels A new twist on an old tale.. .
- Liveness in Timed and Untimed Systems Rainer Gawlicky
- Implementing Sequentially Consistent Shared Objects using Broadcast and Point-To-Point Communication
- Concurrent Timestamping Made Simple Rainer Gawlick
- Forward and Backward Simulations Part II: Timing-Based Systems
- Errata, second printing Nancy Lynch
- Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing RealTime Systems
- Specifying and Using a Partitionable Group Communication Service
- Optimistic Virtual Synchrony Jeremy Sussman Idit Keidary
- Consensus and Collision Detectors in Wireless Ad Hoc Networks Calvin Newport
- Evaluating the Running Time of a Communication Round over the Internet
- Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacs-conf.org
- Des Autom Embed Syst DOI 10.1007/s10617-008-9022-2
- Corrections to "Proving Safety Properties of the Steam Boiler Controller" Correction Sheet
- Mechanical Translation of I/O Automaton Specifications into First-Order Logic
- Revisiting the Paxos algorithm Roberto De Prisco?, Butler Lampson, Nancy Lynch
- Specifying and Using a Partitionable Group Communication Service
- Overview of Spatial Computing and SASO Alex Cornejo
- Correctness of Vehicle Control Systems A Case Study H. B. Weinberg and Nancy Lynch
- Implementing an Eventually-Serializable Data Service as a Distributed System Building Block
- Simulation of Composite I/O Automata Edward Solovey
- Verifiable Compilation of I/O Automata without Global Synchronization
- mrTo appear in Proc., IEEE Real-Time Systems Symposium, San Juan, Puerto Rico, Dec. 7-9, 1994 1 The Generalized Railroad Crossing: A Case Study in Formal
- The DHCP Failover Protocol: A Formal Perspective
- Path Vector Face Routing: Geographic Routing with Local Face Information
- Quorum Consensus in Nested Transaction KENNETH J. GOLDMAN
- GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Shlomi Dolev1
- Improved Simulation of Input/Output Automata by
- Designing Algorithms for Distributed Systems with Partially Synchronized Clocks* Soma Chaudhuri Rainer Gawlick Nancy Lynch
- Proving Correctness of a Controller Algorithm for the RAID Level 5 Mandana Vaziriy
- Priority Arguments in Complexity Theory Nancy Lynch and Albert Meyer and Michael Fischer
- Implementing Sequentially Consistent Shared Objects using Broadcast and Point-To-Point Communication
- Efficiency of Synchronous Versus Asynchronous Distributed Systems
- The BG Distributed Simulation Algorithm Elizabeth Borowsky
- High-Level Modeling and Analysis of the Traffic Alert and Collision Avoidance System (TCAS)
- Video Distribution Under Multiple Constraints Boaz Patt-Shamir Dror Rawitz
- Online Scheduling with Interval Conflicts Magns M. Halldrsson1
- The Round Complexity of Distributed Sorting [Extended Abstract]
- Noname manuscript No. (will be inserted by the editor)
- Time-efficient randomized multiple-message broadcast in radio networks
- Theory of Computing Systems manuscript No. (will be inserted by the editor)
- Coordinated Consensus in Dynamic Networks Fabian Kuhn
- Engineering the Virtual Node Layer for Reactive MANET Abstract--The VNLayer approach [1] simplifies software
- MAC Design for Analog Network Coding Majid Khabbazian
- Overflow Management with Multipart Packets Yishay Mansour
- Resilience of Mutual Exclusion Algorithms to Transient Memory Faults
- Brief Announcement: Partial Reversal Acyclicity Tsvetomira Radeva
- Recommender Systems With Non-Binary Grades School of Computer Science
- Computer Science and Artificial Intelligence Laboratory Technical Report
- arXiv:submit/0184379[cs.IT]23Jan2011 Order Optimal Information Spreading Using Algebraic Gossip
- Computer Science and Artificial Intelligence Laboratory Technical Report
- Computer Science and Artificial Intelligence Laboratory Technical Report
- The Tempo Language User Guide and Reference Manual Nancy A. Lynch, Stephen J. Garland, Dilsun Kaynar, Laurent Michel, Alex Shvartsman
- Environment Characterization for Non-Recontaminating Frontier-Based
- Failure Detectors Encapsulate Fairness Scott M. Pike1
- RAMBO: A Robust, Reconfigurable Atomic Memory Service for Dynamic Networks
- The Abstract MAC Layer Fabian Kuhn
- Errata for: RAMBO: A Robust, Reconfigurable
- Decomposing Broadcast Algorithms Using Abstract MAC Layers Majid Khabbazian
