Sciweavers

60 search results - page 6 / 12
» On the Complexity of Hybrid Logics with Binders
Sort
View
ICFP
2008
ACM
15 years 11 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
IJCAI
2003
15 years 1 months ago
On the Undecidability of Description and Dynamic Logics with Recursion and Counting
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar­ chy of decidable logics with multiple maximal el­ ements. It would be desirable to ...
Piero A. Bonatti
ENTCS
2007
156views more  ENTCS 2007»
14 years 11 months ago
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
Erika Ábrahám, Marc Herbstritt, Bern...
105
Voted
FORMATS
2010
Springer
14 years 9 months ago
Robust Satisfaction of Temporal Logic over Real-Valued Signals
Abstract. We consider temporal logic formulae specifying constraints in continuous time and space on the behaviors of continuous and hybrid dynamical system admitting uncertain par...
Alexandre Donzé, Oded Maler
77
Voted
FPGA
2004
ACM
117views FPGA» more  FPGA 2004»
15 years 5 months ago
A magnetoelectronic macrocell employing reconfigurable threshold logic
In this paper, we introduce a reconfigurable fabric based around a new class of circuit element: the hybrid Hall effect (HHE) magnetoelectronic device. Because they incorporate a ...
Steve Ferrera, Nicholas P. Carter