888 search results - page 132 / 178 » The Power of Temporal Proofs |
161
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
Maximizing system lifetime in battery-powered wireless sensor networks with power aware topology control protocols and routing protocols has received intensive research. In the pa...
185
click to vote
RTA
2005
Springer
15 years 11 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
198
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
183
click to vote
ISSAC
2004
Springer
15 years 11 months ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
128
Voted
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Transactions are commonly described as being ACID: Allor-nothing, Consistent, Isolated and Durable. However, although these words convey a powerful intuition, the ACID pr...