Sciweavers

1763 search results - page 37 / 353
» A Formalization of Polytime Functions
Sort
View
DAC
1997
ACM
14 years 1 months ago
Formal Verification of a Superscalar Execution Unit
Abstract. Many modern systems are designed as a set of interconnected reactive subsystems. The subsystem verification task is to verify an implementation of the subsystem against t...
Kyle L. Nelson, Alok Jain, Randal E. Bryant
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
13 years 10 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl
TACS
1994
Springer
14 years 2 months ago
An Operational Approach to Combining Classical Set Theory and Functional Programming Languages
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...
Douglas J. Howe, Scott D. Stoller
AFP
1995
Springer
126views Formal Methods» more  AFP 1995»
14 years 1 months ago
Functional Programming with Overloading and Higher-Order Polymorphism
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
Mark P. Jones
KBSE
2003
IEEE
14 years 3 months ago
A Model-Driven Approach to Non-Functional Analysis of Software Architectures
We present an approach to managing formal models using Model Driven Architecture (MDA) technologies that delivers analysis techniques through integration with the design tools and...
James Skene, Wolfgang Emmerich