Sciweavers

100 search results - page 13 / 20
» Linear-Time Model Checking: Automata Theory in Practice
Sort
View
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
15 years 4 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
FSTTCS
2009
Springer
15 years 7 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
108
Voted
AHSWN
2010
130views more  AHSWN 2010»
15 years 15 days ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li
103
Voted
WDAG
2009
Springer
77views Algorithms» more  WDAG 2009»
15 years 7 months ago
Nonblocking Algorithms and Backward Simulation
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
Simon Doherty, Mark Moir
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
14 years 10 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...