Sciweavers

4036 search results - page 390 / 808
» Formal Methods
Sort
View
TYPES
2004
Springer
16 years 4 days ago
Exploring the Regular Tree Types
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
Peter Morris, Thorsten Altenkirch, Conor McBride
SIGSOFT
2003
ACM
16 years 1 days ago
Evaluating and improving the automatic analysis of implicit invocation systems
Model checking and other finite-state analysis techniques have been very successful when used with hardware systems and less successful with software systems. It is especially di...
Jeremy S. Bradbury, Jürgen Dingel
TLDI
2003
ACM
134views Formal Methods» more  TLDI 2003»
16 years 1 days ago
Scrap your boilerplate: a practical design pattern for generic programming
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...
Ralf Lämmel, Simon L. Peyton Jones
TLDI
2003
ACM
102views Formal Methods» more  TLDI 2003»
16 years 1 days ago
A typed interface for garbage collection
An important consideration for certified code systems is the interaction of the untrusted program with the runtime system, most notably the garbage collector. Most certified cod...
Joseph Vanderwaart, Karl Crary
FMCO
2003
Springer
114views Formal Methods» more  FMCO 2003»
16 years 9 hour ago
Synchronous Closing and Flow Analysis for Model Checking Timed Systems
Abstract. Formal methods, in particular model checking, are increasingly accepted as integral part of system development. With large software systems beyond the range of fully auto...
Natalia Ioustinova, Natalia Sidorova, Martin Steff...