Sciweavers

619 search results - page 86 / 124
» Formal Methods Meet Domain Specific Languages
Sort
View
IPL
2008
102views more  IPL 2008»
13 years 7 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones
FMCAD
2000
Springer
13 years 11 months ago
Automated Refinement Checking for Asynchronous Processes
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
Rajeev Alur, Radu Grosu, Bow-Yaw Wang
ESOP
2010
Springer
14 years 5 months ago
Testing Polymorphic Properties
Abstract. This paper is concerned with testing properties of polymorphic functions. The problem is that testing can only be performed on specific monomorphic instances, whereas par...
Jean-Philippe Bernardy, Patrik Jansson and Koen Cl...
JUCS
2000
100views more  JUCS 2000»
13 years 7 months ago
Requirements Capture and Evaluation in Nimbus: The Light-Control Case Study
: Evaluations of methods and tools applied to a reference problem are useful when comparing various techniques. In this paper, we present a solution to the challenge of capturing t...
Jeffrey M. Thompson, Michael W. Whalen, Mats Per E...
ISESE
2006
IEEE
14 years 1 months ago
Identifying domain-specific defect classes using inspections and change history
We present an iterative, reading-based methodology for analyzing defects in source code when change history is available. Our bottom-up approach can be applied to build knowledge ...
Taiga Nakamura, Lorin Hochstein, Victor R. Basili