| 
|
QuoteRef: hoarCA9_1987
topics >
all references >
ThesaHelp:
references g-h
Topic:
problems with logic programming
Topic:
requirement specification by assertion
Topic:
functional programming
Topic:
statement language
Topic:
efficiency
Group:
program control
Group:
program proving
Topic:
transformation of programs
Topic:
software components
Reference
Hoare, C.A.R., "An overview of some formal methods for program design", Computer, September 1987, pp. 85-91. Google
86 ;;Quote: in logic programming it is difficult to negate a specification; implemented by programmer case by case
87+ ;;Quote: improve efficiency of logic programming by avoiding disjunction as well as negation; e.g., algebraic specification
87 ;;Quote: algebraic specifications are conjunctions of predicates without negation or disjunction
88 ;;Quote: functional programming further restricts logical statements by preventing the pursuit of irrelevant deductions
89 ;;Quote: a procedural language is efficient because it restricts conjunction to sequential composition and prevents disjunction and negation
89 ;;Quote: sequential composition is key to efficient programs because all computational resources immediately available at each step
89 ;;Quote: need to prove correspondence between sequential composition structure of a program and its conjunctively structured specification
89 ;;Quote: program design by transforming the specification's structure into a program structure; code the component parts; and combine into a system
89 ;;Quote: reliable assembly of prespecified parts is a mark of maturity of an engineering discipline
ThesaHelp: references g-h (299 items)
Topic: problems with logic programming (10 items)
Topic: requirement specification by assertion (28 items)
Topic: functional programming (43 items)
Topic: statement language (10 items)
Topic: efficiency (96 items)
Group: program control (27 topics, 547 quotes)
Group: program proving (10 topics, 310 quotes)
Topic: transformation of programs (27 items)
Topic: software components (11 items)