Sciweavers

2702 search results - page 157 / 541
» Practically Applicable Formal Methods
Sort
View
FM
2003
Springer
112views Formal Methods» more  FM 2003»
15 years 3 months ago
Structuring Retrenchments in B by Decomposition
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [1] as a liberalisation of classical refinement, for the formal description of application developments ...
Michael Poppleton, Richard Banach
CACM
2010
105views more  CACM 2010»
14 years 10 months ago
Automatic program repair with evolutionary computation
Therearemanymethodsfordetectingandmitigatingsoftware errors but few generic methods for automatically repairing errors once they are discovered. This paper highlights recent work ...
Westley Weimer, Stephanie Forrest, Claire Le Goues...
POPL
2003
ACM
15 years 10 months ago
A type system for higher-order modules
We present a type theory for higher-order modules that accounts for many central issues in module system design, including translucency, applicativity, generativity, and modules a...
Derek Dreyer, Karl Crary, Robert Harper
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
15 years 3 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
FTRTFT
1998
Springer
15 years 2 months ago
Predictability in Critical Systems
Predictability is crucial in critical applications and systems. Therefore, we examine sources of uncertainty for each of the four phases that span a project lifecycle, from initial...
Gérard Le Lann