678 search results - page 64 / 136 » Dependent Types for Program Understanding |
116
Voted
EMSOFT
2008
Springer
15 years 4 months ago
2008
Springer
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
216
Voted
POPL
2007
ACM
16 years 2 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
171
Voted
CPE
1994
Springer
15 years 6 months ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
94
Voted
JFP
2010
15 years 19 days ago
2010
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
103
Voted
PLDI
2012
ACM
13 years 4 months ago
2012
ACM
Self-stabilizing programs automatically recover from state corruption caused by software bugs and other sources to reach the correct state. A number of applications are inherently...