4513 search results - page 297 / 903 » Logic programming with satisfiability |
129
click to vote
APLAS
2010
ACM
15 years 4 months ago
2010
ACM
We extract techniques developed in the Concurrent C minor project to build a framework for constructing logics that contain approximation and/or separation. Approximation occurs wh...
150
click to vote
POPL
2012
ACM
13 years 12 months ago
2012
ACM
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
123
click to vote
TC
1998
15 years 4 months ago
1998
—Many modern Field Programmable Logic Arrays (FPGAs) use lookup table (LUT) logic blocks which can be programmed to realize any function of a fixed number of inputs. It is possib...
142
click to vote
JSAC
2007
15 years 4 months ago
2007
— We introduce a new version of the widely studied survivable mapping problem in IP-over-WDM networks. The new problem allows augmenting the given logical topology and is describ...
133
click to vote
SEFM
2005
IEEE
15 years 10 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...