Sciweavers

1017 search results - page 156 / 204
» Higher-Order Logic Programming Languages with Constraints: A...
Sort
View
KBSE
2005
IEEE
15 years 3 months ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
15 years 3 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
EUROSYS
2007
ACM
15 years 1 months ago
Dynamic updates: another middleware service?
Middleware simplifies the construction of distributed applications. These applications typically require continuous uptime. The maintenance of distributed applications, though, im...
Susanne Cech Previtali
89
Voted
ICSE
2010
IEEE-ACM
15 years 2 months ago
From behaviour preservation to behaviour modification: constraint-based mutant generation
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...
Friedrich Steimann, Andreas Thies
DATE
2007
IEEE
112views Hardware» more  DATE 2007»
15 years 4 months ago
Tool-support for the analysis of hybrid systems and models
This paper introduces a method and tool-support for the automatic analysis and verification of hybrid and embedded control systems, whose continuous dynamics are often modelled u...
Andreas Bauer 0002, Markus Pister, Michael Tautsch...