Sciweavers

114 search results - page 15 / 23
» Symbolic computation of differential equivalences
Sort
View
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
14 years 6 months ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 10 months ago
Classification of curves in 2D and 3D via affine integral signatures
We propose new robust classification algorithms for planar and spatial curves subjected to affine transformations. Our motivation comes from the problems in computer image recognit...
Shuo Feng, Irina A. Kogan, Hamid Krim
IANDC
2008
84views more  IANDC 2008»
13 years 9 months ago
A theory of system behaviour in the presence of node and link failure
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
Adrian Francalanza, Matthew Hennessy
LICS
2008
IEEE
14 years 4 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
JAIR
2010
130views more  JAIR 2010»
13 years 8 months ago
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
Bonny Banerjee, B. Chandrasekaran