3566 search results - page 219 / 714 » Signed Logic Programs |
132
click to vote
MKM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
AHS
2007
IEEE
15 years 6 months ago
2007
IEEE
Since their invention in the 1980s, the logic density of FPGAs has increased exponentially with time. This increase of logic density first led to the development of synthesisable ...
CHI
2005
ACM
16 years 3 hour ago
2005
ACM
Recent years have seen the evolution of networks of tiny low power computing blocks, known as sensor networks. In one class of sensor networks, a non-expert user, who has little o...
103
click to vote
ESOP
2010
Springer
15 years 9 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
119
click to vote
ESOP
2010
Springer
15 years 9 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...