114 search results - page 1 / 23 » Reasoning over Networks by Symbolic Methods |
AAECC
1999
Springer
13 years 5 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
FM
2001
Springer
13 years 10 months ago
2001
Springer
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
ATAL
2009
Springer
14 years 18 hour ago
2009
Springer
Stigmergy is usually associated with semantically simple problems such as routing. It can be applied to more complex problems by encoding them in the environment through which sti...
EDBT
2010
ACM
13 years 7 months ago
2010
ACM
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
AICOM
2010
13 years 5 months ago
2010
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...