Sciweavers

4009 search results - page 788 / 802
» Clustering on Complex Graphs
Sort
View
RTCSA
1999
IEEE
13 years 11 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer
ZUM
1997
Springer
125views Formal Methods» more  ZUM 1997»
13 years 11 months ago
A Formal OO Method Inspired by Fusion and Object-Z
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
Klaus Achatz, Wolfram Schulte
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
13 years 11 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
DAC
1994
ACM
13 years 11 months ago
A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
Gjalt G. de Jong, Bill Lin