534 search results - page 68 / 107 » Proving Termination of Rewrite Systems Using Bounds |
ICDCS
2000
IEEE
14 years 13 days ago
2000
IEEE
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
IJAIT
2006
13 years 8 months ago
2006
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligatio...
AAAI
1997
13 years 10 months ago
1997
Traditionally, qualitative simulation uses a global, state-based representation to describe the behavior of the modeled system. For larger, more complex systems this representatio...
EUROCAST
2005
Springer
14 years 2 months ago
2005
Springer
Convergence is a central problem in both computer science and in population biology. Will a program terminate? Will a population go to an equilibrium? In general these questions ar...
DCC
1998
IEEE
13 years 8 months ago
1998
IEEE
Hill [6] showed that the largest cap in PG(5, 3) has cardinality 56. Using this cap it is easy to construct a cap of cardinality 45 in AG(5, 3). Here we show that the size of a cap...