Sciweavers

145
Voted
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 4 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
142
Voted
FORTE
1994
15 years 1 months ago
An improvement in formal verification
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
Gerard J. Holzmann, Doron Peled
126
Voted
SAS
1994
Springer
136views Formal Methods» more  SAS 1994»
15 years 4 months ago
Constraint-Based Type Inference and Parametric Polymorphism
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
Ole Agesen
126
Voted
TYPES
1994
Springer
15 years 4 months ago
A Concrete Final Coalgebra Theorem for ZF Set Theory
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
Lawrence C. Paulson
111
Voted
ZUM
1994
Springer
147views Formal Methods» more  ZUM 1994»
15 years 4 months ago
Integrating Formal Methods into a Professional Master of Software Engineering Program
A critical issuein the designof aprofessionalsoftware engineeringdegreeprogram is the way in which formal methods are integrated into the curriculum. The approach taken by most pr...
David Garlan
Formal Methods
Top of PageReset Settings