Sciweavers

111 search results - page 10 / 23
» A Proof of Strong Normalisation using Domain Theory
Sort
View
DEXAW
2002
IEEE
151views Database» more  DEXAW 2002»
14 years 3 months ago
Domain-Independent eNegotiation Design: Prospects, Methods, and Challenges
Designing electronic markets is still a rather intricate process. eNegotiation - and thereby trading rules - embody the core of the institution ”electronic market”. Although s...
Dirk Neumann, Christof Weinhardt
KBSE
1998
IEEE
14 years 3 months ago
Explaining Synthesized Software
Motivated by NASA's need for high-assurance software, NASA Ames' Amphion project has developed a generic program generation system based on deductive synthesis. Amphion ...
Jeffrey Van Baalen, Peter Robinson, Michael R. Low...
TAPSOFT
1997
Springer
14 years 3 months ago
Traces of I/O-Automata in Isabelle/HOLCF
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
Olaf Müller, Tobias Nipkow
FOCS
2003
IEEE
14 years 4 months ago
List-Decoding Using The XOR Lemma
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
Luca Trevisan
AISC
1998
Springer
14 years 3 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson