Sciweavers

3424 search results - page 355 / 685
» Automated Testing of Classes
Sort
View
CSL
2009
Springer
16 years 1 months ago
Algorithmic Analysis of Array-Accessing Programs
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
Rajeev Alur, Pavol Cerný, Scott Weinstein
CSL
2009
Springer
16 years 1 months ago
Decidable Extensions of Church's Problem
Abstract. For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) ...
Alexander Rabinovich
FM
2009
Springer
106views Formal Methods» more  FM 2009»
16 years 1 months ago
Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way
Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enabl...
Rik Eshuis
ICCBR
2009
Springer
16 years 1 months ago
Adaptation versus Retrieval Trade-Off Revisited: An Analysis of Boundary Conditions
In this paper we revisit the trade-off between adaptation and retrieval effort traditionally held as a principle in case-based reasoning. This principle states that the time needed...
Stephen Lee-Urban, Héctor Muñoz-Avil...
CDC
2008
IEEE
117views Control Systems» more  CDC 2008»
16 years 1 months ago
Motion planning for nonlinear systems using hybridizations and robust controllers on simplices
— In this paper, we consider a motion planning problem for a class of constrained nonlinear systems. In each simplex of a triangulation of the set of states, the nonlinear dynami...
Antoine Girard, Samuel Martin