Sciweavers

1000 search results - page 102 / 200
» Nominal rewriting systems
Sort
View
TPLP
2010
102views more  TPLP 2010»
13 years 8 months ago
As time goes by: Constraint Handling Rules
Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers,...
Jon Sneyers, Peter Van Weert, Tom Schrijvers, Lesl...
BIRTHDAY
2010
Springer
13 years 8 months ago
Termination Graphs for Java Bytecode
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
Marc Brockschmidt, Carsten Otto, Christian von Ess...
LPAR
2010
Springer
13 years 8 months ago
Satisfiability of Non-linear (Ir)rational Arithmetic
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
Harald Zankl, Aart Middeldorp
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
14 years 2 months ago
Robust stabilization of model-based uncertain singularly perturbed systems with networked time-delay
—In this paper, a robust stabilization of the uncertain singularly perturbed system via a networked state feedback with the transmission time-delay is addressed. Taking its nomin...
Zhiming Wang, Wei Liu, Haohui Dai, D. Subbaram Nai...
HYBRID
2011
Springer
12 years 9 months ago
Almost sure stability of networked control systems under exponentially bounded bursts of dropouts
A wireless networked control systems (NCS) is a control system whose feedback path is realized over a wireless communication network. The stability of such systems can be problema...
Michael D. Lemmon, Xiaobo Sharon Hu