939 search results - page 25 / 188 » Semantic Abstraction and Quantum Computation |
LFP
1992
14 years 10 months ago
1992
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
ICTAC
2004
Springer
15 years 3 months ago
2004
Springer
onnectivity and Full Abstraction for a Concurrent Calculus of Classes⋆ nded Abstract — Erika ´Abrah´am2 , Marcello M. Bonsangue3 , Frank S. de Boer4 , and Martin Steffen1 1 ...
MEMOCODE
2005
IEEE
15 years 3 months ago
2005
IEEE
We describe race-free properties of a hardware description language called GEZEL. The language describes networks of cycle-true finite-state-machines with datapaths (FSMDs). We de...
ENTCS
2010
14 years 7 months ago
2010
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
TPHOL
1998
IEEE
15 years 1 months ago
1998
IEEE
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...