Sciweavers

677 search results - page 35 / 136
» Dependent Types from Counterexamples
Sort
View
154
Voted
POPL
2012
ACM
13 years 11 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
152
Voted
TYPES
2004
Springer
15 years 9 months ago
Extracting a Normalization Algorithm in Isabelle/HOL
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
Stefan Berghofer
148
Voted
FM
2009
Springer
190views Formal Methods» more  FM 2009»
15 years 10 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
152
Voted
INFORSID
1996
15 years 5 months ago
Propagation de versions dans les objets complexes
: This paper presents a propagation model for complex object versions. Complex objects are object linked to other objects by means of dependence relations such as composition, inhe...
Christelle Urtado, Chabane Oussalah
130
Voted
COMPSAC
2009
IEEE
15 years 10 months ago
Software Input Space Modeling with Constraints among Parameters
—This paper considers the task of software test case generation from a large space of values of input parameters. The purpose of the paper is to create a model of software input ...
Sergiy A. Vilkomir, W. Thomas Swain, Jesse H. Poor...