36 search results - page 2 / 8 » Reasoning About Coding Theory: The Benefits We Get from Comp... |
TPHOL
2005
IEEE
13 years 11 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
DALT
2005
Springer
13 years 11 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
NSPW
2004
ACM
13 years 11 months ago
2004
ACM
Current models of Internet Computing are highly asymmetric – a host protects itself from malicious mobile Java programs, but there is no way to get assurances about the behavior...
HASKELL
2009
ACM
14 years 22 days ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
POPL
2010
ACM
14 years 3 months ago
2010
ACM
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...