Sciweavers

3713 search results - page 65 / 743
» Constructing a Calculus of Programs
Sort
View
ICFP
2006
ACM
15 years 9 months ago
Static typing for a faulty lambda calculus
A transient hardware fault occurs when an energetic particle strikes a transistor, causing it to change state. These faults do not cause permanent damage, but may result in incorr...
David Walker, Lester W. Mackey, Jay Ligatti, Georg...
ICFP
2007
ACM
15 years 9 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
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
15 years 6 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
JCT
2008
84views more  JCT 2008»
14 years 9 months ago
Fix-Mahonian Calculus, II: Further statistics
Using classical transformations on the symmetric group and two transformations constructed in Fix-Mahonian Calculus I, we show that several multivariable statistics are equidistrib...
Dominique Foata, Guo-Niu Han
CONCUR
1990
Springer
15 years 1 months ago
A Temporal Calculus of Communicating Systems
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...
Faron Moller, Chris M. N. Tofts