Sciweavers

113 search results - page 10 / 23
» LTL Can Be More Succinct
Sort
View
AAAI
2008
15 years 9 days ago
New Compilation Languages Based on Structured Decomposability
We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to repr...
Knot Pipatsrisawat, Adnan Darwiche
IFIP12
2008
14 years 11 months ago
Mining Fuzzy Association Rules from Composite Items
This paper presents an approach for mining fuzzy Association Rules (ARs) relating the properties of composite items, i.e. items that each feature a number of values derived from a ...
M. Sulaiman Khan, Maybin K. Muyeba, Frans Coenen
CHARME
2003
Springer
73views Hardware» more  CHARME 2003»
15 years 1 months ago
Towards Diagrammability and Efficiency in Event Sequence Languages
Industrial verification teams are actively developing suitable event sequence languages for hardware verification. Such languages must be expressive, designer friendly, and hardwar...
Kathi Fisler
TKDE
2008
177views more  TKDE 2008»
14 years 10 months ago
Analyzing and Managing Role-Based Access Control Policies
Today more and more security-relevant data is stored on computer systems; security-critical business processes are mapped to their digital counterparts. This situation applies to ...
Karsten Sohr, Michael Drouineaud, Gail-Joon Ahn, M...
FORMATS
2006
Springer
15 years 1 months ago
Temporal Logic Verification Using Simulation
In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the...
Georgios E. Fainekos, Antoine Girard, George J. Pa...