Sciweavers

811 search results - page 17 / 163
» Refactoring Using Type Constraints
Sort
View
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
14 years 1 months ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh
ECOOP
2003
Springer
14 years 1 months ago
A Nominal Theory of Objects with Dependent Types
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...
Martin Odersky, Vincent Cremet, Christine Röc...
ICSE
2007
IEEE-ACM
14 years 8 months ago
Testing and Analysis of Access Control Policies
Policy testing and analysis are important techniques for high assurance of correct specification of access control policies. We propose a set of testing and analysis techniques fo...
Evan Martin
CORR
2002
Springer
101views Education» more  CORR 2002»
13 years 8 months ago
Semantic Component Composition
Building complex software systems necessitates the use of component-based architectures. In theory, of the set of components needed for a design, only some small portion of them ar...
Joseph Kiniry
AMAST
1998
Springer
14 years 25 days ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak