Sciweavers

6 search results - page 1 / 2
» A decision procedure for linear "big O" equations
Sort
View
CORR
2007
Springer
96views Education» more  CORR 2007»
13 years 4 months ago
A decision procedure for linear "big O" equations
Jeremy Avigad, Kevin Donnelly
CSL
2010
Springer
13 years 5 months ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous
CADE
2006
Springer
13 years 8 months ago
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
Joe Hendrix, José Meseguer, Hitoshi Ohsaki
AUTOMATICA
2008
74views more  AUTOMATICA 2008»
13 years 4 months ago
Policy iteration based feedback control
It is well known that stochastic control systems can be viewed as Markov decision processes (MDPs) with continuous state spaces. In this paper, we propose to apply the policy iter...
Kan-Jian Zhang, Yan-Kai Xu, Xi Chen, Xi-Ren Cao
LPAR
2010
Springer
13 years 2 months ago
Interpolating Quantifier-Free Presburger Arithmetic
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
Daniel Kroening, Jérôme Leroux, Phili...