Sciweavers

749 search results - page 74 / 150
» Combinatory Models and Symbolic Computation
Sort
View
EUROMICRO
2000
IEEE
14 years 2 months ago
Formal Coverification of Embedded Systems Using Model Checking
The complexity of embedded systems is increasing rapidly. In consequence, new verification techniques that overcome the limitations of traditional methods and are suitable for har...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
CAV
1997
Springer
202views Hardware» more  CAV 1997»
14 years 2 months ago
HYTECH: A Model Checker for Hybrid Systems
A hybrid system is a dynamical system whose behavior exhibits both discrete and continuous change. A hybrid automaton is a mathematical model for hybrid systems, which combines, i...
Thomas A. Henzinger, Pei-Hsin Ho, Howard Wong-Toi
TCS
2008
13 years 10 months ago
The weak lambda calculus as a reasonable machine
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
Ugo Dal Lago, Simone Martini
ACL
2012
12 years 12 days ago
Strong Lexicalization of Tree Adjoining Grammars
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
Andreas Maletti, Joost Engelfriet
FTML
2008
185views more  FTML 2008»
13 years 10 months ago
Graphical Models, Exponential Families, and Variational Inference
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
Martin J. Wainwright, Michael I. Jordan