Sciweavers

1763 search results - page 88 / 353
» A Formalization of Polytime Functions
Sort
View
ICFCA
2004
Springer
15 years 3 months ago
Background Knowledge in Concept Graphs
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...
Frithjof Dau
HOTOS
2007
IEEE
15 years 1 months ago
Towards a Practical, Verified Kernel
In the paper we examine one of the issues in designing, specifying, implementing and formally verifying a small operating system kernel -- how to provide a productive and iterativ...
Kevin Elphinstone, Gerwin Klein, Philip Derrin, Ti...
FMCAD
2000
Springer
15 years 1 months ago
A Methodology for Large-Scale Hardware Verification
Abstract. We present a formal verification methodology for datapathdominated hardware. This provides a systematic but flexible framework within which to organize the activities und...
Mark Aagaard, Robert B. Jones, Thomas F. Melham, J...
FFA
2008
82views more  FFA 2008»
14 years 10 months ago
Asymptotic behavior of the number of solutions for non-Archimedean Diophantine approximations with restricted denominators
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Laurent formal power s...
Valérie Berthé, Hitoshi Nakada, Rie ...
FMICS
2009
Springer
15 years 1 months ago
On a Uniform Framework for the Definition of Stochastic Process Languages
In this paper we show how Rate Transition Systems (RTSs) can be used as a unifying framework for the definition of the semantics of stochastic process algebras. RTSs facilitate the...
Rocco De Nicola, Diego Latella, Michele Loreti, Mi...