The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
Wireless sensor networks (WSNs) are hard to program due to unconventional programming models used to satisfy stringent resource constraints. The common event-driven concurrent pro...
Vinaitheerthan Sundaram, Patrick Th. Eugster, Xian...
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...