504 search results - page 14 / 101 » Explaining Verification Conditions |
WRLA
2010
13 years 6 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
HCI
2009
13 years 5 months ago
2009
In this paper we take a closer and in-depth look at initial results obtained from a previous novel experiment conducted with a 3D subliminal teaching Intelligent Tutoring System. S...
VISUAL
1999
Springer
14 years 19 hour ago
1999
Springer
How should we design visual presentations to explain how a complex system works? One promising approach involves multimedia presentation of explanations in visual and verbal format...
ASIAN
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
FOSAD
2009
Springer
13 years 11 months ago
2009
Springer
A program verifier is a tool that allows developers to prove that their code satisfies its specification for every possible input and every thread schedule. These lecture notes des...