Sciweavers

224 search results - page 18 / 45
» The Complexity of Finding Replicas Using Equality Tests
Sort
View
CADE
2008
Springer
15 years 10 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
NSDI
2004
14 years 11 months ago
Model Checking Large Network Protocol Implementations
Network protocols must work. The effects of protocol specification or implementation errors range from reduced performance, to security breaches, to bringing down entire networks....
Madanlal Musuvathi, Dawson R. Engler
LICS
2012
IEEE
13 years 2 days ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan
107
Voted
CDC
2010
IEEE
181views Control Systems» more  CDC 2010»
14 years 4 months ago
Relationship between power loss and network topology in power systems
This paper is concerned with studying how the minimum power loss in a power system is related to its network topology. The existing algorithms in the literature all exploit nonline...
Javad Lavaei, Steven H. Low
PRICAI
1998
Springer
15 years 1 months ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar