797 search results - page 59 / 160 » Eliminating Proofs from Programs |
143
Voted
PEPM
2009
ACM
16 years 7 days ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
244
Voted
POPL
2007
ACM
16 years 3 months ago
2007
ACM
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
123
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The Windows Vista operating system implements an interesting model of multi-level integrity. We observe that in this model, trusted code must participate in any information-flow a...
109
Voted
STOC
2010
ACM
16 years 23 days ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
120
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...