Sciweavers

4940 search results - page 728 / 988
» On the Complexity of Universal Programs
Sort
View
AMOST
2005
ACM
16 years 25 days ago
Using information about functions in selecting test cases
We consider the problem of generating a set of test cases from a black box specification. We focus on stress testing, i.e. picking test cases that seem most likely to reveal prog...
Markus Clermont, David Lorge Parnas
AIED
2005
Springer
16 years 24 days ago
Authoring plug-in tutor agents by demonstration: Rapid, rapid tutor development
We combined two existing methods for rapid tutor development: “plug-in tutor agents” [6] and an authoring tool suite (CTAT) that supports the creation of tutors “by demonstra...
Vincent Aleven, Carolyn Penstein Rosé
APWEB
2005
Springer
16 years 24 days ago
DSL Weaving for Distributed Information Flow Systems
Aspect-oriented programming (AOP) is a promising field for reducing application complexity. However, it has proven difficult to implement weavers for general purpose languages. Nev...
Calton Pu, Galen S. Swint
ATAL
2005
Springer
16 years 24 days ago
IOM/T: an interaction description language for multi-agent systems
A multi-agent system is a useful approach for the complex systems. One of the important concepts of multi-agent systems is cooperativeness, or interactions. However, existing lang...
Takuo Doi, Yasuyuki Tahara, Shinichi Honiden
BIRTHDAY
2005
Springer
16 years 24 days ago
Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...
David Harel, Hillel Kugler, Amir Pnueli