• Publications
  • Influence
Self-stabilizing extensions for message-passing systems
TLDR
A self-stabilizing program eventually resumes normal behavior even if excution begins in, an abnormal initial state. Expand
  • 219
  • 12
A superimposition control construct for distributed systems
  • S. Katz
  • Computer Science
  • TOPL
  • 1 April 1993
A control structure called a superimposition is proposed. The structure contains schematic abstractions of processes called roletypes in its declaration. Each roletype may be bound to processes fromExpand
  • 222
  • 11
Aspect Categories and Classes of Temporal Properties
  • S. Katz
  • Computer Science
  • LNCS Trans. Aspect Oriented Softw. Dev.
  • 2006
TLDR
Generic categories of aspects are described, and their potential value is explained. Expand
  • 117
  • 11
  • PDF
Architectural views of aspects
TLDR
An aspect architecture, a new software architecture viewtype, is proposed, and its general principles are explained. Expand
  • 120
  • 6
  • PDF
Appraising fairness in languages for distributed programming
TLDR
The relations among various languages and models for distributed computation and various possible definitions of fairness are considered. Expand
  • 76
  • 6
MAVEN: Modular Aspect Verification
TLDR
The MAVEN tool verifies the correctness of an aspect relative to its specification, independently of any underlying system to which it may be woven. Expand
  • 39
  • 6
  • PDF
Self-stabilizing extensions for meassage-passing systems
TLDR
A formal definition of the concept of one program being a self-stabilizing extension of another; (2) a characterization of what properties may hold in such extensions; (3) a demonstration of the possibility of mechanically creating such extensions. Expand
  • 63
  • 5
From aspectual requirements to proof obligations for aspect-oriented systems
  • S. Katz, A. Rashid
  • Computer Science
  • Proceedings. 12th IEEE International Requirements…
  • 6 September 2004
TLDR
This work presents PROBE, a framework for generation of proof obligations for aspect-oriented systems from the initial aspectual requirements. Expand
  • 52
  • 5
  • PDF
On the Feasibility of Distributed Constraint Satisfaction
TLDR
We show that even for relatively simple constraint networks, such as rings, there is no general solution using a completely uniform, asynchronous, model. Expand
  • 96
  • 4
  • PDF
Self-Stabilizing Distributed Constraint Satisfaction
TLDR
This paper characterizes connectionist-type architectures that allow a distributed solution for classes of constraint satisfaction problems, and presents such solutions. Expand
  • 55
  • 4
  • PDF