139 search results - page 18 / 28 » Internode: Internal Node Logic Computational Model |
124
click to vote
WOLLIC
2009
Springer
15 years 11 months ago
2009
Springer
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
140
click to vote
FMSD
2010
15 years 2 months ago
2010
In this paper, we consider verifying properties of mixed-signal circuits, i.e., circuits for which there is an interaction between analog (continuous) and digital (discrete) values...
168
click to vote
MICCAI
1998
Springer
15 years 8 months ago
1998
Springer
This paper describes a method for creating object surfaces from binary-segmented data that are free from aliasing and terracing artifacts. In this method, a net of linked surface n...
164
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
Widespread adoption of reconfigurable devices requires system level synthesis techniques to take an application written in a high level language and map it to the reconfigurable d...
148
click to vote
EUROCAST
2007
Springer
15 years 8 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...