Sciweavers

1992 search results - page 93 / 399
» Model Based Testing with Labelled Transition Systems
Sort
View
149
Voted
ATVA
2007
Springer
226views Hardware» more  ATVA 2007»
15 years 8 months ago
Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver
This paper presents a bounded model checking algorithm for the verification of analog and mixed-signal (AMS) circuits using a satisfiability modulo theories (SMT) solver. The sys...
David Walter, Scott Little, Chris J. Myers
124
Voted
CONCUR
2006
Springer
15 years 6 months ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei
110
Voted
JAIR
2006
110views more  JAIR 2006»
15 years 2 months ago
Modelling Mixed Discrete-Continuous Domains for Planning
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
Maria Fox, Derek Long
107
Voted
SAC
2009
ACM
15 years 9 months ago
LTS semantics for use case models
Formalization is a necessary precondition for the specification of precise and unambiguous use case models, which serve as reference points for the design and implementation of so...
Daniel Sinnig, Patrice Chalin, Ferhat Khendek
112
Voted
ICDM
2007
IEEE
138views Data Mining» more  ICDM 2007»
15 years 9 months ago
Bandit-Based Algorithms for Budgeted Learning
We explore the problem of budgeted machine learning, in which the learning algorithm has free access to the training examples’ labels but has to pay for each attribute that is s...
Kun Deng, Chris Bourke, Stephen D. Scott, Julie Su...