797 search results - page 44 / 160 » Eliminating Proofs from Programs |
107
Voted
ECOOPW
1999
Springer
15 years 5 months ago
1999
Springer
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...
126
Voted
CCS
2009
ACM
15 years 7 months ago
2009
ACM
The abuse of online games by automated programs, known as game bots, for gaining unfair advantages has plagued millions of participating players with escalating severity in recent...
118
click to vote
FLOPS
2010
Springer
15 years 7 months ago
2010
Springer
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
121
Voted
CSL
2001
Springer
15 years 5 months ago
2001
Springer
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper table...
212
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...