691 search results - page 40 / 139 » Automatically Proving Linearizability |
CADE
2003
Springer
14 years 10 months ago
2003
Springer
IsaPlanner is a generic framework for proof planning in the interactive theorem prover Isabelle. It facilitates the encoding of reasoning techniques, which can be used to conjectur...
RTA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
ICPR
2000
IEEE
14 years 2 months ago
2000
IEEE
Automatically building high-level segments to structure information in video documents is a challenging task. This paper presents a method based on the cophenetic criterion, a dis...
ALP
1994
Springer
14 years 2 months ago
1994
Springer
This paper introduces a logic for a class of properties - in particular variable aliasing - used in static analysis of logic programs. The logic is shown to be sound, complete and ...
RTA
2010
Springer
14 years 1 months ago
2010
Springer
We present an automated approach to prove termination of Java Bytecode (JBC) programs by automatically transforming them to term rewrite systems (TRSs). In this way, the numerous t...