1799 search results - page 263 / 360 » The Logic of Correctness in Software Engineering |
243
click to vote
PSSE
2004
Springer
15 years 11 months ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
191
click to vote
CASES
2005
ACM
15 years 8 months ago
2005
ACM
Instruction set customization accelerates the performance of applications by compressing the length of critical dependence paths and reducing the demands on processor resources. W...
174
click to vote
CGO
2008
IEEE
16 years 28 days ago
2008
IEEE
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
181
click to vote
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
214
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...