Sciweavers

6829 search results - page 1150 / 1366
» Quantitative Generalizations of Languages
Sort
View
CONCUR
2010
Springer
15 years 4 months ago
On the Compositionality of Round Abstraction
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
Dan R. Ghica, Mohamed N. Menaa
ECAI
2010
Springer
15 years 4 months ago
Knowledge Compilation Using Interval Automata and Applications to Planning
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
Alexandre Niveau, Hélène Fargier, C&...
ACTA
2010
191views more  ACTA 2010»
15 years 4 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
ACS
2008
15 years 4 months ago
Algebras Versus Coalgebras
Algebras and coalgebras are fundamental notions for large parts of mathematics. The basic constructions from universal algebra are now expressed in the language of categories and ...
Robert Wisbauer
AEI
2010
115views more  AEI 2010»
15 years 4 months ago
BRAHMS: Novel middleware for integrated systems computation
Abstract-- Computational modellers are becoming increasingly interested in building large, eclectic, biological models. These may integrate nervous system components at various lev...
Benjamin Mitchinson, Tak-Shing Chan, Jonathan M. C...
« Prev « First page 1150 / 1366 Last » Next »