10 search results - page 2 / 2 » Customised Induction Rules for Proving Correctness of Impera... |
POPL
2012
ACM
12 years 25 days ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
PLPV
2009
ACM
14 years 2 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
FSTTCS
1999
Springer
13 years 9 months ago
1999
Springer
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
VMCAI
2004
Springer
13 years 10 months ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
KBSE
2000
IEEE
13 years 8 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...