Sciweavers

219 search results - page 24 / 44
» Bond-Free Languages: Formalizations, Maximality and Construc...
Sort
View
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 4 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
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich
DIAGRAMS
2008
Springer
13 years 9 months ago
Graphical Revelations: Comparing Students' Translation Errors in Graphics and Logic
We are interested in developing a better understanding of what it is that students find difficult in learning logic. We use both natural language and diagram-based methods for teac...
Richard Cox, Robert Dale, John Etchemendy, Dave Ba...
AOSD
2007
ACM
13 years 11 months ago
Open bisimulation for aspects
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
Radha Jagadeesan, Corin Pitcher, James Riely
FM
2009
Springer
190views Formal Methods» more  FM 2009»
14 years 2 months ago
Dynamic Classes: Modular Asynchronous Evolution of Distributed Concurrent Objects
Abstract. Many long-lived and distributed systems must remain available yet evolve over time, due to, e.g., bugfixes, feature extensions, or changing user requirements. To facilit...
Einar Broch Johnsen, Marcel Kyas, Ingrid Chieh Yu