<--- Back to Details
First PageDocument Content
Mathematics / Metalogic / Logic in computer science / Electronic design automation / NP-complete problems / Automated theorem proving / Satisfiability Modulo Theories / John Rushby / Model checking / Theoretical computer science / Formal methods / Logic
Date: 2006-08-26 05:21:04
Mathematics
Metalogic
Logic in computer science
Electronic design automation
NP-complete problems
Automated theorem proving
Satisfiability Modulo Theories
John Rushby
Model checking
Theoretical computer science
Formal methods
Logic

Add to Reading List

Source URL: fm.csl.sri.com

Download Document from Source Website

File Size: 58,63 KB

Share Document on Facebook

Similar Documents

Science of Security Meeting, Berkeley CA, 17, 18 Nov 2008 Security and Composition John Rushby Computer Science Laboratory

DocID: 1tVT6 - View Document

Multilevel security / John Rushby / Lynx Software Technologies / Milliradian / Mill / Assurance services / Computing / Software / Technology

MILS Research and Development: Accomplishments and Ongoing Work Rance DeLong∗ November 15, 2011 Abstract

DocID: 1pV0t - View Document

Integrating Verification Components? Leonardo de Moura, Sam Owre, Harald Rueß, John Rushby, Natarajan Shankar Computer Science Laboratory SRI International Menlo Park CAUSA

DocID: 1l1I4 - View Document

Automated Test Generation And Verified Software ? John Rushby Computer Science Laboratory SRI International 333 Ravenswood Avenue

DocID: 1kUdZ - View Document

Information / Database theory / Database management systems / Data model / Entity-relationship model / Database schema / EXPRESS / Integrity constraints / Database design / Data management / Data modeling / Data

AFM’07: Second Workshop on Automated Formal Methods November 6, 2007 Atlanta, Georgia John Rushby and Natarajan Shankar (Editors) SRI International

DocID: 19flL - View Document