Sciweavers

FSTTCS
1994
Springer
13 years 11 months ago
On the Interactive Complexity of Graph Reliability
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
Jean Marc Couveignes, Juan Francisco Diaz-Frias, M...
EWSPT
1994
Springer
13 years 11 months ago
A Comparison of Modelling Frameworks for Software Processes and Information Systems
Reidar Conradi, Geir Magne Høydalsvik, Gutt...
FSTTCS
1991
Springer
13 years 11 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
ESEC
1991
Springer
13 years 11 months ago
A Dynamic Failure Model for Predicting the Impact that a Program Location has on the Program
This paper presents a dynamic technique for predicting the e ect that a location" of a program will have on the program's computational behavior. The technique is based ...
Jeffrey M. Voas
ESEC
1991
Springer
13 years 11 months ago
Scaling Up Rule-Based Software Development Environments
Naser S. Barghouti, Gail E. Kaiser
APL
1991
ACM
13 years 11 months ago
Mastering J
Donald B. McIntyre
AMAST
1991
Springer
13 years 11 months ago
Event Spaces and their Linear Logic
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
Vaughan R. Pratt
AMAST
1991
Springer
13 years 11 months ago
A Formal Approach to Software Testing
Gilles Bernot, Marie-Claude Gaudel, Bruno Marre