JSP and JSD: The Jackson Approach to Software Development
JSP and JSD: The Jackson Approach to Software Development
Phoan: An intelligent system for distributed control synthesis
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Justified Generalization: Acquiring Procedures from Examples
Justified Generalization: Acquiring Procedures from Examples
Semantic acquisition in TELI: a transportable, user-customized natural language processor
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Constructing Programs from Example Computations
IEEE Transactions on Software Engineering
Informality in program specifications
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
The WATSON automatic programming system computes formal behavior specifications for process-control software from informal "scenarios": traces of typical system operation. It first generalizes scenarios into stimulus-response rules, then modifies and augments these rules to repair inconsistency and incompleteness. It finally produces a formal specification for the class of computations which implement that scenario and which are also compatible with a set of "domain axioms". A particular automaton from that class is constructed as an executable prototype for the specification. WATSON's inference engine combines theorem proving in a very weak temporal logic with faster and stronger, but approximate, model-based reasoning. The use of models and of closed-world reasoning over "snapshots" of an evolving knowledge base leads to an interesting special case of non-monotonic reasoning.