Sciweavers

3255 search results - page 566 / 651
» Combination of Abstractions in the ASTR
Sort
View
CAV
2010
Springer
172views Hardware» more  CAV 2010»
14 years 1 months ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
CAV
2010
Springer
243views Hardware» more  CAV 2010»
14 years 1 months ago
libalf: The Automata Learning Framework
d Abstract) Benedikt Bollig1 , Joost-Pieter Katoen2 , Carsten Kern2 , Martin Leucker3 , Daniel Neider2 , and David R. Piegdon2 1 LSV, ENS Cachan, CNRS, 2 RWTH Aachen University, 3 ...
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern...
ICLP
2010
Springer
14 years 1 months ago
Abductive Inference in Probabilistic Logic Programs
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
Gerardo I. Simari, V. S. Subrahmanian
IEEESCC
2010
IEEE
14 years 1 months ago
Dynamic Composition of Services in Sensor Networks
Abstract—Service modeling and composition is a fundamental method for offering advanced functionality by combining a set of primitive services provided by the system. Unlike in t...
Sahin Cem Geyik, Boleslaw K. Szymanski, Petros Zer...
RTA
2010
Springer
14 years 1 months ago
Certified Subterm Criterion and Certified Usable Rules
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
Christian Sternagel, René Thiemann