Sciweavers

662 search results - page 64 / 133
» Formalizing Basic First Order Model Theory
Sort
View
LOBJET
2008
104views more  LOBJET 2008»
13 years 7 months ago
Une approche formelle de la reconfiguration dynamique
Self-adapting software adapts its behavior in an autonomic way, by dynamically adding, suppressing and recomposing components, and by the use of computational reflection. One way t...
M. Simonot, M. Aponte
TYPES
2000
Springer
13 years 11 months ago
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
JWSR
2008
98views more  JWSR 2008»
13 years 7 months ago
Mining and Improving Composite Web Services Recovery Mechanisms
: Ensuring composite services reliability is a challenging problem. Indeed, due to the inherent autonomy and heterogeneity of Web services it is difficult to predict and reason abo...
Sami Bhiri, Walid Gaaloul, Claude Godart
COMPSAC
2007
IEEE
13 years 7 months ago
A Connector-Centric Approach to Aspect-Oriented Software Evolution
Lose sight of the existence of system crosscutting concerns, e.g. safety and quality etc, often causes the system hard to maintain and evolve according to the changing environment...
Yiming Lau, Wenyun Zhao, Xin Peng, Shan Tang
CADE
2006
Springer
14 years 8 months ago
Towards Self-verification of HOL Light
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
John Harrison