101 search results - page 8 / 21 » Some Progress in Satisfiability Checking for Difference Logi... |
CCR
2005
13 years 7 months ago
2005
-- A protocol that supports the sharing of resources that exist in different packet switching networks is presented. The protocol provides for variation in individual network packe...
ENTCS
2008
13 years 7 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
PARLE
1987
1987
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
13 years 11 months ago
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
JSC
2010
13 years 2 months ago
2010
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...