Sciweavers

1715 search results - page 195 / 343
» How Space Structures Language
Sort
View
VMCAI
2004
Springer
15 years 8 months ago
Approximate Probabilistic Model Checking
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
Thomas Hérault, Richard Lassaigne, Fr&eacut...
ADBIS
2000
Springer
97views Database» more  ADBIS 2000»
15 years 7 months ago
An Efficient Storage Manager
When dealing with large quantities of clauses, the use of persistent knowledge is inevitable, and indexing methods are essential to answer queries efficiently. We introduce PerKMan...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
ASPDAC
2007
ACM
158views Hardware» more  ASPDAC 2007»
15 years 7 months ago
Symbolic Model Checking of Analog/Mixed-Signal Circuits
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
David Walter, Scott Little, Nicholas Seegmiller, C...
IADIS
2008
15 years 4 months ago
Aggregation in Confidence-Based Concept Discovery for Multi-Relational Data Mining
Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational dat...
Yusuf Kavurucu, Pinar Senkul, Ismail Hakki Toroslu
LFP
1990
102views more  LFP 1990»
15 years 4 months ago
A Semantic Basis for Quest
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...
Luca Cardelli, Giuseppe Longo