UT Austin PDS Laboratory Technical Reports
TR-PDS-2012-001
All-to-All Gradecast using Coding with Byzantine Failures
TR-PDS-2010-001
A report on Fusion-based Approach For Tolerating Mutilple Faults in Distributed Systems
TR-PDS-2008-003
A report on Fusion-Based Approach for Tolerating Faults in Deterministic Finite State Machines
TR-PDS-2008-002
Producing short counterexamples using "crucial events"
TR-PDS-2008-001
Meet- and join-closure of CTL operators
TR-PDS-2006-003
State space reduction using Predicate Filters
TR-PDS-2006-002
Multislicing a Computation
TR-PDS-2006-001
Predicate Detection on Infinite Computations
TR-PDS-2005-002
Coordinated Energy Conservation in Ad-hoc Networks
TR-PDS-2005-001
Efficient Online Optimal Chain Partition of Distributed Program Traces
TR-PDS-2004-006
An Online Algorithm to Partition Posets into Chains
TR-PDS-2004-005
Chain Clock: Efficient Dependency Tracking for Shared-Memory Systems
TR-PDS-2004-004
Fast forwarding Distributed Programs using Computation Slicing
TR-PDS-2004-003
Efficient Vector Clock for Predicate Detection in Multithreaded Programs
TR-PDS-2004-002
On Reducing the Global State Graph for Verification of Distributed Computations
TR-PDS-2004-001
Self-Stabilizing Spanning Tree Algorithm with a New Design Methodology
TR-PDS-2003-006
Finding Satisfying Global States: All for One and One for All
TR-PDS-2003-005
Predicate Control: Synchronization in Distributed Computations with Look-ahead
TR-PDS-2003-004
Partial Order Trace Analyzer (POTA) for Distributed Programs
TR-PDS-2003-003
On Checking Whether a Predicate Definitely Holds
TR-PDS-2003-001
Automatic Generation of Slices for Temporal Logic Predicate Detection
TR-PDS-2002-001
Automatic Generation of Slices for Temporal Logic Predicate Detection. A revised version with experiments appears in TR-PDS-2003-001.
TR-PDS-2001-005
A Rigorous Proof of $O(n^2)$ Bound on the Number of Moves
for Stabilization of Dijkstra's 3-State Algorithm
TR-PDS-2001-004
Computation Slicing: Techniques and Theory
TR-PDS-2001-003
Detecting Temporal Logic Predicates on the Happened-Before Model
TR-PDS-2001-002
Computation Slicing: Techniques and Theory
- Abstract and Reference
- Postscript document temporarily unavailable. If this
condition persists, send email to the above address.
TR-PDS-2000-002
Debugging Distributed Programs Using Controlled Re-execution
TR-PDS-1999-003
A Non-blocking Recovery Algorithm for Causal Message Logging
TR-PDS-1999-002
A Formal Proof for FLP Result
TR-PDS-1999-001
Optimistic Recovery in Multi-threaded Distributed Systems
TR-PDS-1998-015
Techniques for Low-Overhead and No-Overhead Communication Using
Commodity Superscalar Processors
TR-PDS-1998-014
A Simple Proof of an Algorithm for Synchronous Ordering of Message
TR-PDS-1998-013
On Zig-zag Theorem and Rollback Dependency
TR-PDS-1998-012
Dijkstra and Scholten's Algorithm - Simplified
TR-PDS-1998-011
A Lightweight Algorithm for Causal Message Ordering in Mobile Computing
Systems
TR-PDS-1998-010
Distributed Recovery with $K$-Optimistic Logging
TR-PDS-1998-009
Cooperative Caching for Financial Databases with Hot Spots
TR-PDS-1998-008
The Effects of Memory-Access Ordering on Multiple-Issue Uniprocessor Performance
TR-PDS-1998-007
Architectural Support for Relaxed Memory Consistency Models
TR-PDS-1998-006
Happened Before is the Wrong Model for Potential Causality
TR-PDS-1998-005
Consistency Conditions for Multi-Object Distributed Operations
TR-PDS-1998-004
Implementable Failure Detectors in Asynchronous Systems
TR-PDS-1998-003
On the Resilience of Multicasting Strategies in a Failure-Propagating
Environment
TR-PDS-1998-002
Predicate Control for Active Debugging of Distributed Programs
TR-PDS-1998-001
A (Max,+) Algebra for Periodic Timed Discrete Event Systems
TR-PDS-1997-014
Fault-Tolerant Distributed Simulation
TR-PDS-1997-013
A Knowledge-Theoretic Analysis of Partitionable Coordination
TR-PDS-1997-012
Experience with Distributed Replicated Objects: The Nile Project
TR-PDS-1997-011
Addressing False Causality while Detecting Predicates in Distributed Programs
TR-PDS-1997-010
A Quorum-based Distributed Channel Allocation Algorithm for
Mobile Computing Systems
TR-PDS-1997-009
The Challenges of Low-Overhead Message-Passing Communication
Using Commodity Superscalar Processors
TR-PDS-1997-008
Optimistic Distributed Simulation Based on Transitive Dependency Tracking
TR-PDS-1997-007
Distributed Recovery with K-Optimistic Logging
TR-PDS-1997-006
Predicate Control in Distributed Systems
TR-PDS-1997-005
Message Ordering based on Colorful Forbidden Predicates
TR-PDS-1997-004
Testing Distributed Programs with Re-execution
TR-PDS-1997-003
Group message logging without orphans for fast output commit
TR-PDS-1997-002
Optimistic agreement in asynchronous distributed systems
TR-PDS-1997-001
Distributed predicate detection in a faulty environment
TR-PDS-1996-011
Automatic Generation of Versatile Benchmarks for
Parallel Production System Architectures
TR-PDS-1996-010
Normality: A Consistency Condition for Concurrent Objects
TR-PDS-1996-009
Exploiting Data Locality For Multiprocessor Query Scheduling
TR-PDS-1996-008
Armadillo: A High-Performance Processor Simulator
TR-PDS-1996-007
The Sage Project: Software Engineering for Distributed Applications
TR-PDS-1996-006
Statistics on Distributed Concurrent Fault and Design Error Simulation
TR-PDS-1996-005
An Efficient Algorithm for Detecting Conjunctions of General Global Predicates
TR-PDS-1996-004
Characterization of Message Ordering Specifications and Protocols
TR-PDS-1996-003
Impossibility of (Repeated) Reliable Broadcast (Revision of
TR-PDS-1995-016)
TR-PDS-1996-001
A Lightweight Algorithm for Causal Message Ordering in Mobile
Computing Systems
TR-PDS-1995-018
Scheduling Queries With Large Out-of-Core Data Sets
TR-PDS-1995-016
Impossibility of (Repeated) Reliable Broe>Impossibility of (Repeated) Reliable Broadcast
TR-PDS-1995-015
Reaching Agreement Optimistically in a Faulty Asynchronous System
TR-PDS-1995-014
How to Recover Efficiently and Asynchronously when Optimism Fails
TR-PDS-1995-013
Sharing state information for fast recovery in a $k$ faulty system
TR-PDS-1995-012
Statistics on Concurrent Fault and Design Error Simulation
TR-PDS-1995-011
Probabilistic Self-Stabilization with Two-State Machines
TR-PDS-1995-010
Control and Analysis of Real-Time Discrete Event Systems
TR-PDS-1995-009
Observation and Verification of Software for Distributed Systems
TR-PDS-1995-008
Distributed Algorithms for Detecting Conjunctive Predicates
TR-PDS-1995-007
Time and Clocks in Distributed Systems
TR-PDS-1995-006
A Memory Distribution Mechanism for Object Oriented Applications
TR-PDS-1995-005
A Parallel Algorithm for Optimal Margin Classifiers
TR-PDS-1995-004
On Techniques and their Limitations for the Global Predicate Detection
Problem in Distributed Systems
TR-PDS-1995-003
Sequential Distributed Coordination
TR-PDS-1995-002
Dissecting Distributed Coordination in Asynchronous Systems
TR-PDS-1995-001
Deriving Distributed Algorithms from a General Predicate Detector
TR-PDS-1994-014
Online Detection of Distributed Predicates in Distributed Programs
TR-PDS-1994-013
On The Fly Testing of Regular Patterns in distributed computations
TR-PDS-1994-012
Detecting Relational Global Predicates in Distributed Systems
TR-PDS-1994-011
TR-PDS-1994-010
Maintaining Global Assertions on Distributed Systems
TR-PDS-1994-009
An Algorithm for Minimally Latent Global Virtual Time
TR-PDS-1994-008
Using Induction to Prove Properties of Distributed Programs
TR-PDS-1994-007
Causality for Time: How to Specify and Verify Distributed Algorithms
TR-PDS-1994-006
Monitoring Functions on Global States of Distributed Programs
TR-PDS-1994-004
An efficient decentralized algorithm for detecting
properties of distributed computations
TR-PDS-1994-003
Distributed Algorithms for Detecting Conjunctive Predicates
TR-PDS-1994-002
Detecting Conjunctive Channel Predicates in a Distributed
Programming Environment
TR-PDS-1994-001
Synchronous Message Passing
Please send email to:
garg@ece.utexas.edu if you find errors on this page.
Last modified Tue May 17 14:00:08 CDT 2003