691 search results - page 37 / 139 » Automatically Proving Linearizability |
CLIN
2003
13 years 11 months ago
2003
This paper presents two methods for automatic detection of plagiarism in student essays, using Dutch text corpora to show their effectiveness. The first method is based on measur...
AAAI
1990
13 years 11 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
IANDC
2007
13 years 9 months ago
2007
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
PADL
2011
Springer
13 years 22 days ago
2011
Springer
Abstract. Modern web forms interact with the user in real-time by detecting errors and filling-in implied values, which in terms of automated reasoning amounts to SAT solving and ...
CADE
2007
Springer
14 years 10 months ago
2007
Springer
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...