1410 search results - page 241 / 282 » Proving theorems by reuse |
ENTCS
2006
13 years 10 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
FMSD
2006
13 years 10 months ago
2006
This paper describes the application of the Real-Time Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast...
FUIN
2006
13 years 10 months ago
2006
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
IANDC
2006
13 years 10 months ago
2006
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
COMBINATORICS
2007
13 years 10 months ago
2007
We consider the finite binary words Z(n), n ∈ N, defined by the following selfsimilar process: Z(0) := 0, Z(1) := 01, and Z(n + 1) := Z(n) · Z(n − 1), where the dot · deno...