25 search results - page 2 / 5 » Automatic modular abstractions for linear constraints |
CONCUR
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. In a trace-based world, the modular speci cation, veri cation, and control of live systems require each module to be receptive that is, each module must be able to meet i...
PRDC
2007
IEEE
13 years 11 months ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
SAS
2004
Springer
13 years 10 months ago
2004
Springer
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....
ENTCS
2006
13 years 5 months ago
2006
Abstract. Nelson and Oppen provided a methodology for modularly combining decision procedures for individual theories to construct a decision procedure for a combination of theorie...
CP
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...