New Bibliography Items July 31 2003

• Carlos Ivan Chesnevar & Ana Gabriella Maguitman & Ronald Prescot Loui
• Logical Models of Arguments
• ACM Computing Surveys V32n4(Dec 2000) pp337-383
• =HISTORY 1950-99 FORMAL DIALECTIC DEFEASIBLE CONSISTENCY REASON ARGUMENT PLAUSIBLE AGENTS AI LAW
• Formal logic is reasoning that can not be defeated. Normal reasoning is not like this.
• Detailed, difficult and hard to read.

Votta02

• Lawrence G Votta
• Does the Modern Code Inspection have Value?
• SQRL Seminar (12 Apr 2003)
• =SEMINAR SQA INSPECTION QUALITY MAINTENANCE
• Modern software technology has made inspections less valuable as bug detection than for improving other qualities in the software and the inspectors.

Weihe01

• Karsten Weihe
• A Software Engineering Perspective on Algorithmics
• ACM Computing Surveys V33n1(Mar 2001) pp89-134 [ 37530.375367 ]
• =SURVEY QUALITY ADAPTABLE ALGORITHMS DEMO

HalpernZuck92

• Joseph Y Halpern & Lenore D Zuck
• A Little Knowledge Goes a Long Way: Knowledge-Based Derivations and Correctness Proofs for a Family of Protocols
• J. ACM V39n3(Jul 1992)pp449-478 CR (Oct 1993)
• =THEORY PROVING REFINEMENT PROTOCOLS KNOWLEDGE MODAL LOGIC
• Argues for the high level design of inefficient solutions that can be shown to be 100% correct and then their refinement into efficient solutions that implement th high level ones.
• Derives the Alternating Bit Protocol and Stenning's protocol for the Sequence Transmission problem.
• Defines data flow and how to implement it using unreliable communication. Safety: output sequence is prefix of input sequence. Liveness: all inputs are ultimately output (given fairness).

CerroGasquet02

• Luis Farnias Del Cerro & Olivier Gasquet
• A General Framework for Pattern-Driven Modal Tableaux
• L J of the IGPL V10n1(2002)pp51-83
• =THEORY PROVING MODAL LOGIC SEMANTIC TABLEAUX RELATIONS
• Proves completeness and soundness for a set of rules for proving formula in many different modal logics by combining Kripke semantics, semantic Tableaux, and relational calculus.
• p58 rule <>: If <>A,S @ p then add node q: <>A,S@p ---A@q.
• rule K: if []A,S@p----S1@q then []A,S@p----A,S1@q.
• Lotrec::tool= See http://www.itit.fr/ACTIVITIES/LILaC/Lotrec/, written in Java

JarviPowellLumsdaine03

• Jaakko Jarvi & Gary Powell & Andrew Lumsdaine
• The Lambda Library: unnamed functions in C++
• Software - Practice & Experience V33n3(Mar 2003)pp259-291
• =ADVERT C++ STL LIBRARY LAMBDA FUNCTIONAL LL

BrandtUden03

• D Scot Brandt & Lorna Uden
• Insight into Mental Models of Novice Internet Searchers Commun ACM V46n7(Jul 2003)pp133-136
• =ADVERT TKS KAT ACTA HCI USER PEOPLE WEB/NET
• Distinguishes mental models of tasks from conceptual models of systems.
• TKS::theory="Task Knowledge Structure", can express what people know about a task in a structured way.
• ACTA::technique="Applied Cognitive Task Analysis", interview ->outline; audit knowledge(cues+difficulties); simulate scenario giving cognitive processes, tabulate cognitive demands.
• KAT::technique="Knowledge Analysis of Tasks", break down ( objects, actions, goals, subgoals); identify central and generic properties; pseudocode procedures and taxonomy of terms use, add task knowledge needed to pseudocode.
• Novices may need more cues and structure to use search engines effectively.

KarpAH03

• Alan H Karp
• E-speak E-xplained Commun ACM V46n7(Jul 2003)pp113-118 [ HPL-2000-101.html ]
• =ADVERT e-speak WEB/NET e-service HP web service SOAP WSDL XML HTTP TCP/IP vs Jini Biztalk
• 40 year old idea: a networked environment where services are created, specified, advertised, discovered, accesses and executed -- from idea to market in 2 hours!
• Get things done -- without having to say how. Just say what: "get me a printout of this here in color by 10am".
• Billing, authentication, authorization, discovery, etc etc.
• Protocol stacks etc.
• espeak::=ftp://ftp.hp.com/linux/espeak/

. . . . . . . . . ( end of section New Bibliography Items July 31 2003) <<Contents | Index>>