
	Where results make sense

Topic: ACL2

In the News (Sun 27 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	ACL2 2006
		ACL2 2006 is the sixth in a series of workshops that occur every 18 months.
		The ACL2 workshops provide the major technical forum for researchers to present and discuss improvements and extensions to the theorem prover, comparisons of ACL2 with other systems, and applications of ACL2 in industry, government, and academia.
		ACL2 is an industrial-strength automated reasoning system that is part of the Boyer-Moore family of theorem provers, for which its authors have received the 2005 ACM Software System Award.
	www-static.cc.gatech.edu /~manolios/acl206 (208 words)

	Linking HOL and ACL2
		ACL2 has a number of features that make it highly suitable for system modelling.
		A specific case study we have in mind is to experiment with ACL2 for executing the verified ARM model due to Anthony Fox.
		Then translation from ACL2 formulas represented inside HOL to ACL2 is still a step that needs to be implemented in ML and trusted, but it is now a just a very straightforward printing step.
	www.cl.cam.ac.uk /~mjcg/hol2acl2 (405 words)

	ACL2 theorem prover - Wikipedia, the free encyclopedia
		ACL2 is a software system consisting of a programming language, an extensible theory in a first-order logic, and a mechanical theorem prover.
		ACL2 is designed to support automated reasoning in inductive logical theories, mostly for the purpose of software and hardware verification.
		ACL2 also derives efficiency from being built on Common LISP; for example, the same specification that is the basis for inductive verification can be compiled and run natively.
	en.wikipedia.org /wiki/ACL2 (277 words)

	ACL2s Home page/Documentation
		ACL2 will fail to run in the plugin if these are not either in your PATH or in your home directory.
		ACL2 is back in the state it was in before you submitted the form that caused the error.
		ACL2 need not be running, but if it is, this will cause anything currently executing to be interrupted, and all completed forms to be undone in LIFO (last-in, first-out) order.
	naxos.cc.gt.atl.ga.us /acl2s/doc (7344 words)

	ACL2 - Wikipedia, la enciclopedia libre
		ACL2 es un demostrador automatizado de teoremas con una lógica basada en un subconjunto aplicativo del lenguaje Common Lisp.
		ACL2 es un lenguaje sin tipos debido a que todas las funciones de ACL2 son totales –es decir, toda función asocia a cada valor de espacio de valores de ACL2 otro valor de ese espacio.
		ACL2 obtiene eficiencia gracias a que está escrito en Common LISP; Por ejemplo, la misma especificación que es la base para una verificación inductiva puede ser compilada y ejecutada en código nativo.
	es.wikipedia.org /wiki/ACL2 (331 words)

	Formal Executable Models
		ACL2 [13] stands for ``A Computational Logic for Applicative Common Lisp.'' It is a functional programming language, a first-order mathematical logic, and a mechanical theorem prover.
		ACL2 was written by Matt Kaufmann and J Strother Moore (an author of this paper) and is the successor of the Boyer-Moore theorem prover Nqthm [3,5].
		The issues involved in the efficient execution of ACL2 models are discussed in the article by Greve, Wilding, and Hardin (Chapter 8) of [12].
	www.usenix.org /event/jvm01/full_papers/moore/moore_html/node2.html (990 words)

	[No title] (Site not responding. Last check: 2007-11-02)
		Pragmatics: Strengths: ACL2 is an ``industrial strength'' version of Boyer and Moore's Nqthm, supporting as a logic (and programmed in) a large applicative subset of Common Lisp.
		While ACL2's language is untyped Common Lisp, ACL2 provides a powerful type- like mechanism called ``guards'' which can be used to assure that functions are ``well-typed.'' Guards are arbitrary ACL2 formulas and guard checking is undecidable (i.e., requires general purpose theorem proving in the hard cases) but optional.
		The most significant work with ACL2 to date (Summer, 1998) has been David Russinoff's proofs of the correctness of the floating-point hardware for the add, subtract, multiply, divide, and square root functions of the AMD K7.
	www-formal.stanford.edu /clt/ARS/Entries/acl2 (756 words)

	ACL2 Version 3.2
		ACL2 is both a programming language in which you can model computer systems and a tool to help you prove properties of those models.
		ACL2 is part of the Boyer-Moore family of provers, for which its authors have received the 2005 ACM Software System Award.
		Many ACL2 users set a browser bookmark to this file and use their browser to access the documentation during everyday use of ACL2.
	www.cs.utexas.edu /users/moore/acl2 (588 words)

	An ACL2 Demo (Site not responding. Last check: 2007-11-02)
		ACL2 is an industrial-strength version of the Boyer-Moore theorem prover.
		It has been used to establish the correctness of the RTL for all the elementary floating point arithmetic on AMD's Athlon microprocessor, to analyze a security model for the IBM 4758 cryptoprocessor, to establish equivalence between two microarchitectures at Rockwell Collins Avionics, and to model the Java Virtual Machine.
		In this talk, I will simply demonstrate ACL2 live on simple examples and we can explore issues as they come up.
	www.cs.cornell.edu /NuPrl/PRLSeminar/PRLSeminar02_03/Moore/Oct7.html (80 words)

	Chapter 6 OpenLDAP slapd.conf
		ACL2 access to * Because access directives are addititive this directive means this policy applies to all attributes except userpassword because it was previously defined to have its own rules.
		ACL2 by self write grants the owner of the entry (they authenticated with the userpassword of this entry) write permission to these attributes.
		ACL2 by dn.exact,expand="cn=$1,ou=people,dc=example,dc=com" read grants the owner of the entry (they authenticated with the userpassword of this entry) read permission to addressbook.
	www.zytrax.com /books/ldap/ch6 (6851 words)

	ACL2 Workshop 2000 (Reminder)
		Regards, Matt Kaufmann and J Moore ACL2 Workshop 2000 University of Texas at Austin Austin, Texas Oct 30-31, 2000; brief tutorial afternoon of Oct 29.
		The next workshop on the ACL2 theorem prover and its applications will be held at the University of Texas on Monday and Tuesday, October 30-31, 2000.
		Papers that describe successful uses of ACL2 should be accompanied by ordinary text files containing the appropriate ACL2 input and instructions for how to process them with ACL2, although the papers themselves should be self-contained.
	lists.cs.uiuc.edu /pipermail/colt/2000-June/000081.html (869 words)

	Carlos Pacheco: Verifying TLA+ Invariants with ACL2 (Site not responding. Last check: 2007-11-02)
		ACL2 is a general-purpose theorem prover, and one can use it to verify every step of a proof in almost any mathematical domain, from real analysis to circuit design.
		The main drawback in using ACL2 is the different levels of abstraction at which TLA+ and ACL2 users commonly operate.
		Our second approach was to use ACL2 only where it might be suitable--closer to the leaves of a proof, where quantification has been eliminated and all that remains are large but low-level formulas.
	people.csail.mit.edu /cpacheco/www/src-report.html (931 words)

	mbox: ACL2
		Lisp.'' ACL2 is similar to the Boyer-Moore theorem prover, Nqthm, and
		To obtain ACL2 by ftp, first connect to ftp.cli.com by anonymous login.
		The syntax of ACL2 is that of Common Lisp.
	www-unix.mcs.anl.gov /qed/mail-archive/volume-3/0064.html (669 words)

	Index of /~cs274/sources
		ACL2 is licensed under the terms of the GNU General Public License.
		You may specify any ACL2 image, as long as it is either a command on your Unix path or an absolute file name, for example as follows.
		ACL2 may be exported to any countries except those subject to embargoes under various laws administered by the Office of Foreign Assets Control ("OFAC") of the U. Department of the Treasury.
	wwwcsif.cs.ucdavis.edu /~cs274/sources (3878 words)

	Project-Team-Mosel:Translation from BHDL to ACL2
		This theorem prover was chosen because ACL2 has better performance for such low-level descriptions compared to the theorem prover of AtelierB; moreover there already existed a translator from VHDL to a model accepted as input of the ACL2 theorem prover.
		In collaboration with with Diana Toma-Moisic at the TIMA-IMAG Laboratory, we defined the translation from BHDL to ACL2 and the proof obligations that have to be discharged using ACL2 to ensure the correctness of the refinement.
		Compared to the usual development process of the B method (top-down process), this defines a ``meet in the middle'' process, where the system is refined and some sub-modules are not refined to the implementation level with B but proved to be correctly implemented by an existing VHDL model.
	www.inria.fr /rapportsactivite/RA2005/mosel/uid24.html (231 words)

	Carlos Pacheco: Verifying TLA+ Invariants with ACL2 (Site not responding. Last check: 2007-11-02)
		The idea is that, short of mechanically verifying every step of a proof, a user might first want to explore pieces of a proof that are not entirely clear or where he lacks confidence.
		ACL2 is a general-purpose theorem prover, and one can use it to verify every step of a proof in almost any mathematical domain, from real analysis to circuit design.
		Our second approach was to use ACL2 only where it might be suitable--closer to the leaves of a proof, where quantification has been eliminated and all that remains are large but low-level formulas.
	pag.csail.mit.edu /~cpacheco/www/src-report.html (931 words)

	LtU Classic Archives
		One of the notable results of ACL2 was a proof that the floating-point unit (FPU) of AMD Athlon processor executes elementary FP operations (additions, subtraction, multiplication, division and the square root) strictly according to the IEEE specification.
		To convince the management that the ACL2 FPU specification is a sound representation of the original RTL specification, one needs to show that the two FPU emulators are equivalent.
		The ACL2 is used quite frequently for real projects (proofs of correctness for the AMD Athlon FPU, for a Motorola DSP processor, for a JVM chip and for a strcpy()/strcat()/...
	lambda-the-ultimate.org /classic/message2629.html (1549 words)

	[No title]
		IMAP clients implementing ACL2 that are able to modify ACLs SHOULD warn a user that wants to give full access (or even just "a" right) to the special identifier "anyone".
		ACL2 interaction with QUOTA extension Server that implement both ACL2 and QUOTA extensions MUST use the following table to determine if a quota operation should be allowed for the user: GETQUOTAROOT - any of the following rights is required to perform the operation: "r", "i", "a".
		If the ACL2 server implements some flags as shared for a mailbox (i.e., the ACL for the mailbox may be set up so that changes to those flags are visible to another user), let's call the set of rights associated with these flags (as described in 3.3) for that mailbox collectively as "shared flag rights".
	www.ietf.org /proceedings/03mar/I-D/draft-ietf-imapext-acl-07.txt (5380 words)

	Amazon.com: Computer-Aided Reasoning: ACL2 Case Studies (Advances in Formal Methods): Books: Matt Kaufmann,Panagiotis ... (Site not responding. Last check: 2007-11-02)
		Computer-Aided Reasoning: ACL2 Case Studies is meant for two audiences: those looking for innovative ways to design, build, and maintain hardware and software systems faster and more reliably, and those wishing to learn how to do this.
		It also contains a brief introduction to the ACL2 logic and its mechanization, which is intended to give the reader sufficient background to read the case studies.
		ACL2 may be obtained from its home page, http://www.cs.utexas.edu/users/moore/acl2.
	www.amazon.com /Computer-Aided-Reasoning-Studies-Advances-Methods/dp/0792378490 (989 words)

	Computer-Aided Reasoning Course
		The tool we will use is ACL2, which is a descendant of Boyer and Moore's theorem prover Nqthm.
		Chapters 6 and 18 of the ACL2 Case Studies book use a modification of ACL2 called ACL2(r), which can be used for reasoning about the real numbers using non-standard analysis.
		The installation of ACL2(r) is a little different from that of ACL2, although it uses the same sources.
	www.faculty.idc.ac.il /yishai/reasoning (283 words)

	ACL2 Tutorial
		ACL2 (``A Computational Logic for Applicative Common Lisp'') is both a programming language in which you can model computer systems and a tool to help you prove properties of those models.
		ACL2 architecture and applications: Overview of ACL2 and how it is used.
		Computer-Aided Reasoning: ACL2 Case Studies, Matt Kaufmann, Panagiotis Manolios, and J Strother Moore (eds.), Kluwer Academic Publishers, June, 2000.
	www.cc.gatech.edu /fac/Pete.Manolios/acl2-cade-tutorial.html (356 words)

	bit of acl2.html
		Submitting this form to ACL2 would fail because that function name is already in use, and ACL2 normally only allows a function name to be defined once.
		Type-prescription rules are one of the classes of rules in the ACL2 theorem prover, and provide additional information about the field value that can be used by the theorem prover.
		This assertion is typically the weak structure recognizer corresponding to the assertion given for the field.
	www.computationallogic.com /software/djvm/html-0.5/bit-of-acl2.html (1241 words)

	Untitled Document
		The admission of APP is trivial, using the relation 0< (which is known to be well-founded on the domain recognized by 0-P) and the measure (ACL2-COUNT X).
		ACL2 !> (app (app ‘(1 2) ‘(3 4) ‘(5 6)))
		Special thanks to Krysia Broda for her lecture slides on Automated Reasoning which formed the basis of this website.
	www.doc.ic.ac.uk /project/2005/163/g0516331/ACL2Ov.htm (273 words)

	ACL2 2006 Second Call for Papers from event@in.tu-clausthal.de on 2006-03-21 (www-rdf-logic@w3.org from March 2006)
		ACL2 is an industrial-strength automated reasoning system that is part of the Boyer-Moore family of theorem provers, winner of the 2005 ACM Software System Award.
		ACL2 2006 is hosted by the CAV and IJCAR conferences, which are part of FLoC 2006, the Federated Logic Conference.
		Papers should be self-contained, but, as has been the case traditionally (and where applicable), we strongly encourage authors to provide ACL2 "books" or script files that provide full details, along with instructions for how to process these books with ACL2.
	lists.w3.org /Archives/Public/www-rdf-logic/2006Mar/0041.html (441 words)

	[Coq-Club] ACL2 Workshop, Nov. 18-19 (Site not responding. Last check: 2007-11-02)
		We invite users of ACL2, users of other theorem provers, and persons interested in the applications of theorem proving technology to attend.
		ACL2 is a state-of-the-art automated reasoning system, which grew out of the Boyer-Moore theorem prover and has been used successfully on a number of industrial and academic projects.
		The ACL2 workshops provide a forum for the presentation and discussion of projects using ACL2 as well as the evolution of the tool.
	pauillac.inria.fr /pipermail/coq-club/2004/001437.html (190 words)

	THEORIES.html -- ACL2 Version 2.7
		ACL2 provides various functions for the convenient construction and manipulation of theories.
		Of course, in ACL2 one can include explicitly the runes naming the rules in question and so can avoid entirely the use of non-runic elements in theories.
		Because a rune is a runic designator denoting the set containing that rune, a list of runes is a theory and denotes itself.
	www.mathcs.duq.edu /simon/acl2/THEORIES.html (846 words)

	DrACuLa (Site not responding. Last check: 2007-11-02)
		The objective of the "Dracula" project is to provide a programming environment for the ACL2 language and theorem prover.
		ACL2, short for A Computational Logic for Applicative Common Lisp, is a programming language and theorem prover.
		You then have a chance to save a transcript of your ACL2 (theorem prover) interactions in a file.
	www.ccs.neu.edu /home/dalev/acl2-drscheme (389 words)

	Windows Installation
		The following instructions are adapted from those in ACL2 installation page.
		ACL2 is built on top of Common Lisp, so you will first need to obtain and install Common Lisp.
		If when you try to compile ACL2 you get a message saying that the string "ab\ncd" has 6 characters instead of 5, you got it wrong in this step.
	www.faculty.idc.ac.il /yishai/reasoning/win-install.htm (730 words)

	Melton Foundation Wiki: Hanbing Liu/ACL2 (Site not responding. Last check: 2007-11-02)
		Here are some of work I did and I am doing with ACL2, a computational logic, a programming language and a mechanic proof checker.
		Fall 2002 ACL2 Festival: The Challenge Problem from Matt and Dave in Rockwell Collins.
		My proofs in ACL2 that the iterative version of the bytecode verification algorithm (for M3) always terminates.
	zu.meltonfoundation.org /cgi-bin/wiki.pl?Hanbing_Liu/ACL2 (281 words)

	A Verifying Core for a Cryptographic Language Compiler (Site not responding. Last check: 2007-11-02)
		We report the use of ACL2 in building a verifying compiler for μCryptol, a stream-based language for encryption algorithm specification that targets Rockwell Collins' AAMP7 microprocessor (and is designed to compile efficiently to hardware, too).
		We have written an ACL2 macro that automatically generates both the correspondence theorems and their proofs.
		Finally, we describe an ACL2 book of primitive operations for the general specification and verification of encryption algorithms.
	www.cs.indiana.edu /~lepike/pub_pages/acl2.html (303 words)

Try your search on: Qwika (all wikis)