Sciweavers

217 search results - page 35 / 44
» A New Approach to Abstract Syntax with Variable Binding
Sort
View
PODC
1999
ACM
13 years 11 months ago
Liveness-Preserving Simulation Relations
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reas...
Paul C. Attie
CP
2007
Springer
13 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
CP
2000
Springer
13 years 12 months ago
Extending Forward Checking
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
Fahiem Bacchus
DAC
2006
ACM
14 years 8 months ago
Predicate learning and selective theory deduction for a difference logic solver
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
Chao Wang, Aarti Gupta, Malay K. Ganai
SUTC
2006
IEEE
14 years 1 months ago
Detection and Repair of Software Errors in Hierarchical Sensor Networks
Abstract— Sensor networks are being increasingly deployed for collecting critical data in various applications. Once deployed, a sensor network may experience faults at the indiv...
Douglas Herbert, Yung-Hsiang Lu, Saurabh Bagchi, Z...