close this section of the libraryftp://ftp.cs.uidaho.edu (28)
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-93-02.ps.Z, 19930830
Dysfunctional Programming: Teaching Programming using Formal Methods to Non-Computer Science Majors Michael Barnett Laboratory for Applied Logic Department of Computer Science University of Idaho Moscow, Idaho 83844-1010 mbarnett@cs.uidaho.edu Phillip Windley Department of Computer Science Brigham Young
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-93-03.ps.Z, 19930830
A Derivation of the Straight Radix Sort Michael Barnett Laboratory for Applied Logic Department of Computer Science University of Idaho Moscow, Idaho 83844-1010 U.S.A. mbarnett@cs.uidaho.edu Research Report LAL-93-03 May 1993
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-93-01.ps.Z, 19930922
Towards a Better Understanding of Dylan Tamme D. Bowen Kelly M. Hall Laboratory for Applied Logic University of Idaho Research Report LAL-93-01 May 1993
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/CS-92-04.ps.Z, 19940810
The Generic Oracle Hypothesis is False James A. Foster email: foster@cs.uidaho.edu Technical Report No. 92-04
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/CS-92-06.ps.Z, 19940810
Using Self Delimiting Strings To Represent Trees Authors James A. Foster Paul W. Oman Karen Van Houten Weiguo Zhu email: oman@cs.uidaho.edu, foster@cs.uidaho.edu Technical Report No. 92-06
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/CS-91-09.ps.Z, 19940810
Dense Properties and Generic Witnesses for PH James A. Foster email: foster@cs.uidaho.edu Technical Report No. 91-09
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/CS-91-10.ps.Z, 19940810
Observations on Relativizing Counting Versions of PH James A. Foster email: foster@cs.uidaho.edu Technical Report No. 91-10
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-94-01.ps.Z, 19940928
(In)Formal Methods: Teaching Program Derivation via the Moore Method James A. Fostera Michael Barnetta Karen Van Houten Luke Shenemana Department of Computer Science University of Idaho Moscow, Idaho 83844-1010 September 20, 1994 Technical Report LAL 94-01 aMember, Laboratory for Applied Logic
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-92-09.ps.Z, 19950208
Modelling Non{Deterministic Systems in HOL Jim Alves{Foss Department of Computer Science, University of Idaho, Moscow, Idaho 83843, USA. (jimaf@cs.uidaho.edu)
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-91-05.ps.Z, 19950208
Mechanical Verification of Secure Distributed Systems in Higher Order Logic Jim Alves-Foss Karl Levitt Idaho Center For Applied Logic Division of Computer Science Department of Computer Science University of California, Davis University of Idaho Davis, CA 95616 Moscow, ID 83843
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-93-04.ps.Z, 19950208
A C Type Checker: A First Step Towards Code-Level Verification (Work in progress) Jim Alves-Foss, Chris Toshok, Luke Sheneman Laboratory for Applied Logic Department of Computer Science University of Idaho, Moscow, Idaho USA jimaf@cs.uidaho.edu
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-95-03.ps.Z, 19950208
1 The 2-Pebbling Property and a Conjecture of Graham's Hunter S. Snevilya James A. Fosterb email: fsnevily, fosterg@uidaho.edu Technical Report No. LAL 95-03 aDept. of Mathematics bDept. of Computer Science, Laboratory for Applied Logic
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-92-05.ps.Z, 19950208
A Verifiable Secure Distributed System Jim Alves-Foss Idaho Center for Applied Logic Department of Computer Science University of Idaho Moscow, ID 83843 A Verifiable Secure Distributed System
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-95-01.ps.Z, 19950208
NPkVt c NPSVt If Disjoint Pairs of Co-NP Sets are P seperable James A. Fostera Steven Fennerb email: foster@cs.uidaho.edu, fenner@sleepy.usmcs.maine.edu Technical Report No. LAL 95-01 aLaboratory for Applied Logic, Dept. of Computer Science, U. Idaho bUniversity of Southern Maine
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-92-08.ps.Z, 19950208
Using Generic Components to Ensure System Reliability Jim Alves-Foss Department of Computer Science University of Idaho Moscow, ID 83843 jimaf@leopard.cs.uidaho.edu (208) 885-7232
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-92-04.ps.Z, 19950208
Verifying System Components with Memory Jim Alves-Foss Idaho Center for Applied Logic Department of Computer Science University of Idaho Moscow, ID 83843 November 7, 1991 Verifying System Components with Memory
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-93-05.ps.Z, 19950208
A parser for the C language written in SML Chris Toshok Luke Sheneman Dr. James Alves-Foss Laboratory for Applied Logic Department of Computer Science University of Idaho Moscow, Idaho 83843-1010 USA ftoshok,sheneman,jimafg@cs.uidaho.edu Research Report LAL-93-05 October 1993
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-95-04.ps.Z, 19950503
1 Genetic Algorithm Hardness and Approximation Complexity: A Research Agenda James A. Fostera email: ffosterg@uidaho.edu Technical Report No. LAL 95-04 aDept. of Computer Science, Laboratory for Applied Logic
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-95-05.ps.Z, 19950816
Using Generic Specifications in Software Specification and Verification Jim Alves-Foss Laboratory for Applied Logic Department of Computer Science University of Idaho Moscow, ID 83844-1010 jimaf@cs.uidaho.edu
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-95-02.ps.Z, 19950816
An Overview of SNIF: A Tool for Surveying Network Information Flow J. Alves-Foss Laboratory for Applied Logic Department of Computer Science University of Idaho Moscow, ID, 83844-1010
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-95-07.ps.Z, 19950816
Lessons Learned Designing and Implementing a Network Layer Security Protocol (Technical Paper Submission to SNDSS96) Jim Alves-Foss and Darwin Anderson Laboratory for Applied Logic Department of Computer Science University of Idaho Moscow, ID 83844-1010 (208) 885-7232 FAX: (208) 885-9052
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-95-10.ps.Z, 19950816
Mechanizing a Theory of Authentication in Higher Order Logic Munna & Jim Alves-Foss Laboratory for Applied Logic Department of Computer Science University of Idaho, Moscow ID USA
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-95-08.ps.Z, 19950816
Assessing Computer Security Vulnerability Jim Alves-Foss & Salvador Barbosa Laboratory for Applied Logic Department of Computer Science University of Idaho
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-95-13.ps.Z, 19950906
Formal Aspects of Computing (1995) 3: 1{000 c 1995 BCS The Use of Generic Specifications in Formal Specification and Verification Jim Alves-Foss Laboratory for Applied Logic, Department of Computer Science, University of Idaho, Moscow, Idaho 83844-1010, USA Keywords: Formal Methods, Generic Components,
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-95-11.ps.Z, 19950906
Transposable Element Simulator: Technical Documentation James Clougha, R. Wesley Irelandb, Michael Barnettc, and James A. Foster2 Technical Report No. LAL 95-11 aHewlitt Packard bDept. of Computer Science, Laboratory for Applied Logic cMicrosoft Corp.
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-95-12.ps.Z, 19950906
Using Genetic Algorithms to Find Maximum Cliques a James A. Foster and Terry Soule Department of Computer Science, U. Idaho email: ffoster,tsouleg@uidaho.edu Technical Report No. LAL 95-12 aThis work supported by funding from the URO FY94 Seed Grant program, and through funding received from the
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-94-02.ps.Z, 19950906
REASONABLE AUTHENTICATION IN DISTRIBUTED SYSTEMS Jim Alves-Foss Department of Computer Science University of Idaho Munna Department of Computer Science University of Idaho
open this document and view contentsftp://ftp.cs.uidaho.edu/pub/techreports/LAL-95-09.ps.Z, 19961104
Understanding the Orange Book Guidelines in a Real-Time Embedded System Environment Jim Alves-Foss & Deborah Frincke Laboratory for Applied Logic Department of Computer Science University of Idaho Moscow, ID 83844-1010 September 6, 1995 1 Introduction Informally, a system is secure if the information it