1116 search results - page 61 / 224 » Applying Predicate Abstraction to Abstract State Machines |
104
click to vote
FSTTCS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which...
103
click to vote
FM
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctne...
CSL
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...
SIGMOD
2002
ACM
16 years 1 months ago
2002
ACM
We present a continuously adaptive, continuous query (CACQ) implementation based on the eddy query processing framework. We show that our design provides significant performance b...
103
click to vote
HYBRID
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. An invariant of a system is a predicate that holds for every reachable state. In this paper, we present techniques to generate invariants for hybrid systems. This is achi...