798 search results - page 26 / 160 » Proving More Properties with Bounded Model Checking |
FUIN
2010
13 years 6 months ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
ENTCS
2006
13 years 8 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
QEST
2006
IEEE
14 years 2 months ago
2006
IEEE
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
DLOG
2006
13 years 10 months ago
2006
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...