209 search results - page 2 / 42 » Reachability and the Power of Local Ordering |
CHARME
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We propose a new saturation-based symbolic state-space generation algorithm for finite discrete-state systems. Based on the structure of the high-level model specificat...
EDBT
2006
ACM
14 years 4 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
FM
1999
Springer
13 years 9 months ago
1999
Springer
ÐIn this paper, we describe the incremental specification of a power transformer station controller using a controller synthesis methodology. We specify the main requirements as s...