3228 search results - page 277 / 646 » Computationally Sound Proofs |
126
Voted
CONCUR
1998
Springer
15 years 8 months ago
1998
Springer
This paper presents a complete axiomatization of two decidable propositional realtime linear temporal logics: Event Clock Logic (EventClockTL) and Metric Interval Temporal Logic w...
105
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
149
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
162
click to vote
BIRTHDAY
2003
Springer
15 years 8 months ago
2003
Springer
Aspects are intended to add needed functionality to a system or to treat concerns of the system by augmenting or changing the existing code in a manner that cross-cuts the usual c...
131
click to vote
ISTCS
1995
Springer
15 years 8 months ago
1995
Springer
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...