Sciweavers

553 search results - page 68 / 111
» A General Theory of Additive State Space Abstractions
Sort
View
EMSOFT
2009
Springer
14 years 3 months ago
Analytic real-time analysis and timed automata: a hybrid method for analyzing embedded real-time systems
This paper advocates a strict compositional and hybrid approach for obtaining key (performance) metrics of embedded At its core the developed methodology abstracts system componen...
Kai Lampka, Simon Perathoner, Lothar Thiele
FOSSACS
2009
Springer
14 years 3 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
ICRA
2009
IEEE
182views Robotics» more  ICRA 2009»
14 years 3 months ago
Manipulation planning on constraint manifolds
Abstract— We present the Constrained Bi-directional RapidlyExploring Random Tree (CBiRRT) algorithm for planning paths in configuration spaces with multiple constraints. This al...
Dmitry Berenson, Siddhartha S. Srinivasa, Dave Fer...
OOPSLA
2010
Springer
13 years 6 months ago
Efficient modular glass box software model checking
Glass box software model checking incorporates novel techniques to identify similarities in the state space of a model checker and safely prune large numbers of redundant states w...
Michael Roberson, Chandrasekhar Boyapati
SPIN
2009
Springer
14 years 3 months ago
Subsumer-First: Steering Symbolic Reachability Analysis
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
Andrey Rybalchenko, Rishabh Singh