1536 search results - page 178 / 308 » The Underlying Logic of Hoare Logic |
156
click to vote
LICS
2000
IEEE
15 years 11 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
136
click to vote
ACSAC
1999
IEEE
15 years 10 months ago
1999
IEEE
Secure enterprise programming is a difficult and tedious task. Programmers need tools that support t levels of abstraction and that track all the components that participate in di...
158
click to vote
DBPL
1999
Springer
15 years 10 months ago
1999
Springer
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
176
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
A modeling approach is presented that captures the dependence of the power dissipation of a combinational logic circuit on its input output signal switching activity. The resulting...
170
click to vote
CADE
1994
Springer
15 years 10 months ago
1994
Springer
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...