Sciweavers

923 search results - page 45 / 185
» Proving the value of formal methods
Sort
View
TLDI
2003
ACM
108views Formal Methods» more  TLDI 2003»
15 years 11 months ago
Inferring annotated types for inter-procedural register allocation with constructor flattening
We introduce an annotated type system for a compiler intermediate language. The type system is designed to support inter-procedural register allocation and the representation of t...
Torben Amtoft, Robert Muller
COMPOS
1997
Springer
15 years 10 months ago
Compositional Refinement of Interactive Systems Modelled by Relations
We introduce a mathematical model of components that can be used for the description of both hardware and software units forming distributed interactive systems. As part of a distr...
Manfred Broy
SAS
1994
Springer
104views Formal Methods» more  SAS 1994»
15 years 10 months ago
Strictness and Totality Analysis
We definea novelinference systemfor strictness andtotality analysisfor the simplytyped lazy lambda-calculus with constants and fixpoints. Strictness information identifies those t...
Kirsten Lackner Solberg
FMICS
2010
Springer
15 years 6 months ago
Range Analysis of Microcontroller Code Using Bit-Level Congruences
Bitwise instructions, loops and indirect data access pose difficult challenges to the verification of microcontroller programs. In particular, it is necessary to show that an indir...
Jörg Brauer, Andy King, Stefan Kowalewski
WABI
2007
Springer
109views Bioinformatics» more  WABI 2007»
16 years 5 days ago
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...
Réka Albert, Bhaskar DasGupta, Riccardo Don...