<--- Back to Details
First PageDocument Content
Sandia National Laboratories / Academia / United States / Research / Institute for Mathematics and its Applications / University of Minnesota / University of Iowa
Date: 2004-12-21 09:35:13
Sandia National Laboratories
Academia
United States
Research
Institute for Mathematics and its Applications
University of Minnesota
University of Iowa

[removed]IMA Annual Program Poste

Add to Reading List

Source URL: www.ima.umn.edu

Download Document from Source Website

File Size: 3,97 MB

Share Document on Facebook

Similar Documents

Journeys in World Politics, October 28th-30th, 2004 Sponsored by the University of Iowa College of Liberal Arts & Sciences, with Support from the Department of Political Science Thursday, Oct. 28 6:30-8:30 p.m. Dinner

DocID: 1xVIr - View Document

Journeys in World Politics, March 9th-11th, 2006 Sponsored by the University of Iowa College of Liberal Arts & Sciences, with Support from the Department of Political Science Thursday, Mar. 9 6:30-8:30 p.m. Dinner at Sh

DocID: 1xUJQ - View Document

Formal methods / Theoretical computer science / Computing / Software engineering / Satisfiability modulo theories / Model checking / Invariant / Lustre

The K IND 2 Model Checker ? Adrien Champion, Alain Mebsout, Christoph Sticksel, and Cesare Tinelli The University of Iowa Abstract. K IND 2 is an open-source, multi-engine, SMT-based model checker for safety properties o

DocID: 1xTL7 - View Document

Mathematical logic / Theoretical computer science / Mathematics / Quantification / Logic in computer science / Formal methods / Electronic design automation / NP-complete problems / Satisfiability modulo theories / Boolean satisfiability problem / Universal quantification / True quantified Boolean formula

Challenges for Fast Synthesis Procedures in SMT Andrew Reynolds1 Department of Computer Science, The University of Iowa Abstract A number of synthesis applications are made possible by automated tools for synthesis. Rece

DocID: 1xTJm - View Document

Theoretical computer science / Mathematics / Mathematical logic / Logic in computer science / Automated theorem proving / Electronic design automation / Formal methods / NP-complete problems / Satisfiability modulo theories / Boolean satisfiability problem / Substitution / Model theory

Designing Theory Solvers with Extensions Andrew Reynolds1 , Cesare Tinelli1 , Dejan1 JovanoviĀ“c3 , and Clark Barrett2 1 Department of Computer Science, The University of Iowa Department of Computer Science, Stanford Uni

DocID: 1xTGI - View Document