210 search results - page 30 / 42 » A Formal Theory of Key Conjuring |
126
Voted
ICFP
2008
ACM
16 years 1 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
140
Voted
KBSE
1995
IEEE
15 years 5 months ago
1995
IEEE
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
121
click to vote
CORR
2002
Springer
15 years 1 months ago
2002
Springer
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
120
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
111
Voted
FOSSACS
2008
Springer
15 years 3 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...