30 search results - page 6 / 6 » Formalizing Desargues' theorem in Coq using ranks |
PLPV
2011
ACM
12 years 8 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
PPDP
2009
Springer
13 years 12 months ago
2009
Springer
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, ...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
TACAS
2000
Springer
13 years 8 months ago
2000
Springer
This note describes Proof General, a tool for developing machine proofs with an interactive proof assistant. Interaction is based around a proof script, which is the target of a pr...