Sciweavers

13 search results - page 3 / 3
» A Modal Lambda Calculus with Iteration and Case Constructs
Sort
View
CONCUR
2010
Springer
15 years 22 days ago
Termination in Impure Concurrent Languages
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
101
Voted
FM
2006
Springer
121views Formal Methods» more  FM 2006»
15 years 3 months ago
Properties of Behavioural Model Merging
Constructing comprehensive operational models of intended system behaviour is a complex and costly task. Consequently, practitioners adopt techniques that support partial behaviour...
Greg Brunet, Marsha Chechik, Sebastián Uchi...
ICFP
2007
ACM
15 years 11 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