265 search results - page 21 / 53 » entcs 2007 |
119
click to vote
ENTCS
2007
15 years 3 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
109
click to vote
ENTCS
2007
15 years 3 months ago
2007
We present a method for pipeline verification using SMT solvers. It is based on a non-deterministic “mother pipeline” machine (MOP) that abstracts the instruction set archite...
132
click to vote
ENTCS
2007
15 years 3 months ago
2007
We propose a compositional technique for efficient verification of networks of parallel processes. It is based on an automatic analysis of LTSs of individual processes (using a f...
ENTCS
2007
15 years 3 months ago
2007
Abstract. Increasing attention is being paid to the development of socalled behavioural types as a means to formally address the problem of ensuring the correct interoperation of s...
119
click to vote
ENTCS
2007
15 years 3 months ago
2007
Modern software is increasingly concurrent, timed, distributed, and therefore, non-deterministic. While it is well known that tests can be generated as LTL or CTL model checker co...