6274 search results - page 135 / 1255 » Proofs, Programs, Processes |
144
click to vote
TPHOL
2007
IEEE
16 years 18 days ago
2007
IEEE
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...
170
click to vote
ESOP
2007
Springer
15 years 10 months ago
2007
Springer
Non-interference is a semantical condition on programs that guarantees the absence of illicit information flow throughout their execution, and that can be enforced by appropriate i...
165
click to vote
CACM
2010
15 years 3 months ago
2010
Certified software consists of a machine-executable program plus a formal machine-checkable proof that the software is free of bugs with respect to a claim of dependability. The c...
208
click to vote
XPU
2010
Springer
15 years 4 months ago
2010
Springer
Experimentation is one way to gain insight into how processes perform for a team, but industry teams rarely do experiments, fearing that such educational excursions will incur extr...
180
click to vote
PARLE
1987
15 years 9 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...