6554 search results - page 456 / 1311 » Constraint Logic Programming |
228
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe...
245
click to vote
FROCOS
2011
Springer
14 years 6 months ago
2011
Springer
Temporal data models have been used to describe how data can evolve in the context of temporal databases. Both the Extended Entity-Relationship (EER) model and the Unified Modelli...
165
click to vote
VLSID
1997
IEEE
15 years 11 months ago
1997
IEEE
—Logical initializability is the property of a gate-level circuit whereby it can be driven to a unique start state when simulated by a three-valued (0, 1, ) simulator. In practic...
176
Voted
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
Recent research results have shown that the traditional structural testing for delay and crosstalk faults may result in over-testing due to the non-trivial number of such faults t...
209
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...