313 search results - page 23 / 63 » Formalizing the Halting Problem in a Constructive Type Theor... |
MPC
1995
Springer
13 years 11 months ago
1995
Springer
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
COMPSAC
2002
IEEE
14 years 21 days ago
2002
IEEE
With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that...
MKM
2009
Springer
14 years 2 months ago
2009
Springer
Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many realworld systems and in formalised mathematics. Wh...
ISLPED
1999
ACM
14 years 1 days ago
1999
ACM
-- The goal of a dynamic power management policy is to reduce the power consumption of an electronic system by putting system components into different states, each representing ce...
NDJFL
2000
13 years 7 months ago
2000
We present an approach to combining three areas of research which we claim are all based on information theory: knowledge representation in Artificial Intelligence and Cognitive Sc...