HomeSCS Home
School of Computer Science School of Computer Science  
News
EducationResearch People About
 
 
CSD
RI
ISRI
HCII
LTI
CALD
CALD
 
 
 
 

 

CALENDAR OF EVENTS
 

 

 SCS Calendar Events

 Search for Events by Date

 Submit an Event to the SCS Calendar



May 2008

 
  1   2   3   4   5  
6   7   8   9  10
11 12 13 14 15
16 17 18 19 20
21 22 23 24 25
26 27 28 29 30
31

 



June 2008

 
  1   2   3   4   5  
6   7   8   9  10
11 12 13 14 15
16 17 18 19 20
21 22 23 24 25
26 27 28 29 30


 

 

When: Friday, October 04, 10:00 a.m.- 11:30 a.m.

Where: 4623Wean Hall

J. Strother Moore, Professor and Chair, Department of Computer Sciences, University of Texas at Austin

Special Presentation

Abstract:
I will explain how the latest version of the Boyer-Moore theorem prover, ACL2, is used to prove theorems about Java methods. ACL2 may be thought of as a theorem prover for functional Common Lisp. We model the Java Virtual Machine (JVM) operationally, e.g., as a Lisp function. We prove theorems about Java methods by compiling the methods with javac and proving theorems about the execution of the resulting bytecode by the JVM model. I will discuss the general approach and show some examples, including theorems about sorting and simple multi-threaded applications.

<< Back

Email

 
HomeSCS Home   ARCHIVES
Contact Info