632 search results - page 74 / 127 » Proving Invariants of Functional Programs |
118
click to vote
ICFP
2007
ACM
16 years 15 days ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
133
Voted
ICFP
2002
ACM
16 years 15 days ago
2002
ACM
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
103
Voted
TOPLAS
2002
15 years 5 days ago
2002
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
109
Voted
ICFP
2010
ACM
15 years 23 days ago
2010
ACM
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
86
Voted
APLAS
2005
ACM
15 years 6 months ago
2005
ACM
Dependences for Alarm Diagnosis Xavier Rival ´Ecole Normale Sup´erieure 45, rue d’Ulm, 75230, Paris cedex 5, France We propose a framework for dependence analyses, adapted –a...