Sciweavers

198 search results - page 11 / 40
» Recovering Software Specifications with Inductive Logic Prog...
Sort
View
KCAP
2003
ACM
15 years 2 months ago
Learning programs from traces using version space algebra
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
OOPSLA
2010
Springer
14 years 7 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...
POPL
2010
ACM
14 years 10 months ago
Nested interpolants
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...
TSE
1998
129views more  TSE 1998»
14 years 9 months ago
Inferring Declarative Requirements Specifications from Operational Scenarios
—Scenarios are increasingly recognized as an effective means for eliciting, validating, and documenting software requirements. This paper concentrates on the use of scenarios for...
Axel van Lamsweerde, Laurent Willemet
AMAI
2004
Springer
14 years 9 months ago
Rapid Prototyping of Large Multi-Agent Systems Through Logic Programming
Prototyping is a valuable technique to help software engineers explore the design space while gaining insight on the dynamics of the system. In this paper, we describe a method for...
Wamberto Weber Vasconcelos, David Stuart Robertson...