Sciweavers

632 search results - page 74 / 127
» Proving Invariants of Functional Programs
Sort
View
ICFP
2007
ACM
16 years 2 months ago
Relating complexity and precision in control flow analysis
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 ...
David Van Horn, Harry G. Mairson
ICFP
2002
ACM
16 years 2 months ago
A demand-driven adaptive type analysis
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 ...
Danny Dubé, Marc Feeley
TOPLAS
2002
98views more  TOPLAS 2002»
15 years 2 months ago
Data abstraction and information hiding
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...
K. Rustan M. Leino, Greg Nelson
ICFP
2010
ACM
15 years 3 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
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...
Karl Mazurak, Steve Zdancewic
APLAS
2005
ACM
15 years 8 months ago
Abstract Dependences for Alarm Diagnosis
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...
Xavier Rival