Sciweavers

1397 search results - page 84 / 280
» On the Need for Practical Formal Methods
Sort
View
FM
1994
Springer
113views Formal Methods» more  FM 1994»
14 years 1 months ago
Abstract Model Checking of Infinite Specifications
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
Daniel Jackson
CODES
2008
IEEE
13 years 10 months ago
A performance-oriented hardware/software partitioning for datapath applications
This article proposes a hardware/software partitioning method targeted to performance-constrained systems for datapath applications. Exploiting a platform based design, a Timed Pe...
Laura Frigerio, Fabio Salice
IFL
2007
Springer
158views Formal Methods» more  IFL 2007»
14 years 3 months ago
Checking Dependent Types Using Compiled Code
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
Dirk Kleeblatt
POPL
2010
ACM
14 years 6 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
ICML
2002
IEEE
14 years 9 months ago
Interpreting and Extending Classical Agglomerative Clustering Algorithms using a Model-Based approach
We present two results which arise from a model-based approach to hierarchical agglomerative clustering. First, we show formally that the common heuristic agglomerative clustering...
Sepandar D. Kamvar, Dan Klein, Christopher D. Mann...