111 search results - page 8 / 23 » A Proof of Strong Normalisation using Domain Theory |
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
IJCAI
1989
13 years 8 months ago
1989
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
IEEEARES
2010
IEEE
13 years 5 months ago
2010
IEEE
Online auctions of governmental bonds and CO2 certificates are challenged by high availability requirements in face of high peak loads around the auction deadline. Traditionally, t...
CADE
2011
Springer
12 years 7 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...