Sciweavers

1715 search results - page 148 / 343
» Domain-Specific Program Checking
Sort
View
AOSD
2011
ACM
13 years 5 months ago
Reducing combinatorics in testing product lines
A Software Product Line (SPL) is a family of programs where each program is defined by a unique combination of features. Testing or checking properties of an SPL is hard as it ma...
Chang Hwan Peter Kim, Don S. Batory, Sarfraz Khurs...
POPL
2012
ACM
12 years 6 months ago
Run your research: on the effectiveness of lightweight mechanization
Formal models serve in many roles in the programming language community. In its primary role, a model communicates the idea of a language design; the architecture of a language to...
Casey Klein, John Clements, Christos Dimoulas, Car...
LPNMR
2005
Springer
14 years 3 months ago
Guarded Open Answer Set Programming
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
POPL
2004
ACM
14 years 10 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
PPDP
2009
Springer
14 years 5 months ago
Future contracts
Many recent research projects focus on language support for behavioral software contracts, that is, assertions that govern the boundaries between software building blocks such as ...
Christos Dimoulas, Riccardo Pucella, Matthias Fell...