Sciweavers

137 search results - page 15 / 28
» Reasoning About Transfinite Sequences
Sort
View
IROS
2009
IEEE
159views Robotics» more  IROS 2009»
16 years 2 days ago
Prioritized optimization for task-space control
— We introduce an optimization framework called prioritized optimization control, in which a nested sequence of objectives are optimized so as not to conflict with higher-priori...
Martin de Lasa, Aaron Hertzmann
CMSB
2009
Springer
16 years 15 hour ago
The Equivalence between Biology and Computation
A major challenge in computational systems biology is the articulation of a biological process in a form which can be understood by the biologist yet is amenable to computational e...
John K. Heath
FSEN
2007
Springer
15 years 11 months ago
Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata
Abstract. A communication protocol consists of a sequence of messages used by peer entities to communicate. Each entity in a network is equipped by at least one protocol stack. Due...
Mahdi Niamanesh, Rasool Jalili
VMCAI
2007
Springer
15 years 11 months ago
Invariant Synthesis for Combined Theories
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, A...
SAS
1997
Springer
162views Formal Methods» more  SAS 1997»
15 years 9 months ago
Exact Flow Analysis
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
Christian Mossin