899 search results - page 106 / 180 » Cost Analysis of Games, Using Program Logic |
116
click to vote
ICFP
2000
ACM
15 years 5 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
205
click to vote
POPL
2005
ACM
16 years 1 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
110
click to vote
ICFP
2004
ACM
16 years 1 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
PLDI
2004
ACM
15 years 7 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
142
click to vote
CADE
2009
Springer
16 years 2 months ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...