1302 search results - page 173 / 261 » Free-Style Theorem Proving |
133
click to vote
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
181
click to vote
FROCOS
2009
Springer
15 years 10 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
129
click to vote
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper studies a network under TCP congestion control, in which the number of flows per user is explicitly taken into account. We present a control law for this variable th...
135
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
113
click to vote
IEEEPACT
2007
IEEE
15 years 10 months ago
2007
IEEE
The process of verifying a new microprocessor is a major problem for the computer industry. Currently, architects design processors to be fast, power-efficient, and reliable. Howe...