566 search results - page 2 / 114 » Array Abstractions from Proofs |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract We investigate here a new version of the Calculus of Inductive Constructions (CIC) on which the proof assistant Coq is based: the Calculus of Congruent Inductive Construct...
IFL
2003
Springer
13 years 11 months ago
2003
Springer
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
APLAS
2006
ACM
14 years 6 days ago
2006
ACM
straction for Imperative Languages William L. Harrison Dept. of Computer Science, University of Missouri, Columbia, Missouri, USA. ty in programming language semantics derives fro...
CSL
2007
Springer
14 years 12 days ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
DALT
2008
Springer
13 years 8 months ago
2008
Springer
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...