130 search results - page 1 / 26 » Finding and Certifying Loops |
SOFSEM
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
TACAS
2010
Springer
13 years 2 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
PKC
1998
Springer
13 years 9 months ago
1998
Springer
A basic function of all signatures, digital or not, is to express trust and authority, explicit or implied. This is especially the case with digital signatures used in certificates...
FASE
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present a new method for automatic generation of loop invariants for programs containing arrays. Unlike all previously known methods, our method allows one to generate...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...