1226 search results - page 95 / 246 » Proofs, Programs and Abstract Complexity |
136
Voted
CADE
2007
Springer
16 years 3 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
147
click to vote
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
116
Voted
TPHOL
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract We present the generic system framework of Isabelle/Isar underlying recent versions of Isabelle. Among other things, Isar provides an infrastructure for Isabelle plug-ins,...
112
click to vote
ADAEUROPE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The Ravenscar Profile is a restricted subset of the Ada tasking model, designed to meet the requirements of producing analysable and deterministic code. A central featur...
162
Voted
FOSSACS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...