195 results on '"Shmuel Katz"'
Search Results
52. Specifying and Proving Serializability in Temporal Logic
53. On the Feasibility of Distributed Constraint Satisfaction.
54. Self-Stabilizing Extensions for Message-Passing Systems.
55. Language Constructs for Distributed Systems.
56. Saving Space by Fully Exploiting Invisible Transitions.
57. Impossibility Results in the Presence of Multiple Faulty Processes
58. A Superimposition Control Construct for Distributed Systems.
59. Self-Stabilizing Extensions for Message-Passing Systems.
60. Verification of Distributed Programs Using Representative Interleaving Sequences.
61. Defining Conditional Independence Using Collapses.
62. Solitary waves in a bistable lattice
63. High-Level Language Debugging for Concurrent Programs.
64. Interleaving Set Temporal Logic.
65. Aspects and Superimpositions.
66. Editorial for Special Section on Dependencies and Interactions with Aspects.
67. Solitary waves in a nonintegrable chain with double-well potentials
68. Self-Stabilizing Distributed Constraint Satisfaction.
69. Boomerons in a 1-D lattice with only nearest-neighbor interactions
70. The post-buckling behavior of a beam constrained by springy walls
71. The Postbuckling Behavior of Planar Elastica Constrained by a Deformable Wall
72. Preserving Liveness: Comments on 'Safety and Liveness from a Methodological Point of View'.
73. PARIS: A System for Reusing Partially Interpreted Schemas.
74. Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version).
75. What Processes Know: Definitions and Proof Methods (Preliminary Version).
76. Interleaving Set Temporal Logic (Preliminary Version).
77. Fail Termination of Communicating Processe.
78. An Advisory System for Developing Data Representations.
79. Proving Termination of Prolog Programs.
80. A Compete Proof Rule for Strong Equifair Termination.
81. Towards automatic debugging of programs.
82. Interleaving Set Temporal Logic.
83. Interactive Blackbox Debugging for Concurrent Languages.
84. An efficient verification method for parallel and distributed programs.
85. Appraising Fairness in Languages for Distributed Programming.
86. Program Optimization Using Invariants.
87. A Heuristic Approach to Program Verification.
88. Letters to the Editor
89. [Untitled]
90. Selection of representations for data structures.
91. Fairness and the axioms of control predicates.
92. Initial failures in distributed computations.
93. Appraising Fairness in Languages for Distributed Programming.
94. A Complete Rule for Equifair Termination.
95. A System for Constructing Linear Programming Models.
96. Logical Analysis of Programs.
97. A Closer Look at Termination.
98. Program Optimization Using Invariants.
99. Cooperative Distributed Algorithms for Dynamic Cycle Prevention.
100. Multiparty Interactions for Interprocess Communication and Synchronization.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.