1805 search results - page 149 / 361 » A Theory of Closure Operators |
172
click to vote
DATE
2006
IEEE
16 years 21 days ago
2006
IEEE
As devices are scaled to the nanoscale regime, it is clear that future nanodevices will be plagued by higher soft error rates and reduced noise margins. Traditional implementation...
154
click to vote
BIRTHDAY
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
167
Voted
TPHOL
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
180
click to vote
BIRTHDAY
1997
Springer
15 years 10 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
176
click to vote
ALP
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. We introduce a compositional characterization of the operational semantics of equational Horn programs. Then we show that this semantics and the standard operational sema...