Sciweavers

1419 search results - page 64 / 284
» Notes on Formalizing Context
Sort
View
AFP
1995
Springer
126views Formal Methods» more  AFP 1995»
15 years 4 months ago
Functional Programming with Overloading and Higher-Order Polymorphism
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
Mark P. Jones
JLP
2008
108views more  JLP 2008»
15 years 17 days ago
Composition mechanisms for retrenchment
Abstract. Retrenchment is a flexible model evolution formalism that arose as a reaction to the limitations imposed by refinement, and for which the proof obligations feature additi...
Richard Banach, Czeslaw Jeske, Michael Poppleton
91
Voted
ISOLA
2010
Springer
14 years 11 months ago
Seamless Model-Driven Development Put into Practice
SMT—building flexible yet efficient abstraction/refinement solvers. International Journal on Software Tools for Technology Transfer, 12(1):23–37, February 2010. Wolfgang Hab...
Wolfgang Haberl, Markus Herrmannsdoerfer, Stefan K...
CLEIEJ
2010
14 years 10 months ago
Implementation of an Improvement Cycle using the Competisoft Methodological Framework and the Tutelkan Platform
Formalizing and institutionalizing software processes has become a necessity in recent years requiring the management and enhancement of software production and, at the same time,...
Rodolfo Villarroel, Yessica Gómez, Roman Ga...
96
Voted
LATIN
2010
Springer
15 years 7 months ago
The Language Theory of Bounded Context-Switching
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...