Sciweavers

564 search results - page 33 / 113
» Proof General: A Generic Tool for Proof Development
Sort
View
SAC
2006
ACM
14 years 1 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
Sylvie Boldo, César Muñoz
CSL
2009
Springer
13 years 11 months ago
Confluence of Pure Differential Nets with Promotion
We study the confluence of Ehrhard and Regnier's differential nets with exponential promotion, in a pure setting. Confluence fails with promotion and codereliction in absence ...
Paolo Tranquilli
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
13 years 11 months ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström
AMAST
2006
Springer
13 years 11 months ago
Formal Islands
Abstract. Motivated by the proliferation and usefulness of Domain Specific Languages as well as the demand in enriching well established languages by high level capabilities like p...
Emilie Balland, Claude Kirchner, Pierre-Etienne Mo...
EMSOFT
2010
Springer
13 years 5 months ago
Components, platforms and possibilities: towards generic automation for MDA
Model-driven architecture (MDA) is a model-based approach for engineering complex software systems. MDA is particularly attractive for designing embedded systems because models ca...
Ethan K. Jackson, Eunsuk Kang, Markus Dahlweid, Di...