<--- Back to Details
First PageDocument Content
C3 / ALGOL 68 / Software engineering / Computing / Programming language theory / Kolhapur / Suryapet
Date: 2014-04-23 03:20:02
C3
ALGOL 68
Software engineering
Computing
Programming language theory
Kolhapur
Suryapet

Name of the Region Tender No. 1

Add to Reading List

Source URL: www.cewacor.nic.in

Download Document from Source Website

File Size: 16,89 KB

Share Document on Facebook

Similar Documents

Software engineering / Programming language theory / Computing / Logic in computer science / Horn clause / Control flow / ALGOL 68 / Formal methods / Logic programming

Finding Inconsistencies in Programs with Loops? Temesghen Kahsai1 , Jorge A. Navas2 , Dejan Jovanovi´c3 , Martin Sch¨af3 1 2

DocID: 1xVKW - View Document

Software engineering / Programming language theory / Computing / Logic in computer science / Horn clause / Control flow / ALGOL 68 / Formal methods / Logic programming

Finding Inconsistencies in Programs with Loops? Temesghen Kahsai1 , Jorge A. Navas2 , Dejan Jovanovi´c3 , Martin Sch¨af3 1 2

DocID: 1xUgf - View Document

Theoretical computer science / Computational complexity theory / Mathematics / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Boolean algebra / Satisfiability modulo theories / Boolean satisfiability problem / Conflict-driven clause learning / Solver

A Tale Of Two Solvers: Eager and Lazy Approaches to Bit-vectors? Liana Hadarean1 , Kshitij Bansal1 , Dejan Jovanovi´c3 , Clark Barrett1 , and Cesare Tinelli2 1 2

DocID: 1xU8Z - View Document

Software engineering / Programming language theory / Computing / Logic in computer science / Horn clause / Control flow / ALGOL 68 / Formal methods / Logic programming

Finding Inconsistencies in Programs with Loops? Temesghen Kahsai1 , Jorge A. Navas2 , Dejan Jovanovi´c3 , Martin Sch¨af3 1 2

DocID: 1xTIv - 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