Sciweavers

509 search results - page 30 / 102
» On the completeness of compositional reasoning methods
Sort
View
LICS
2008
IEEE
14 years 3 months ago
On the Expressiveness and Decidability of Higher-Order Process Calculi
In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators nec...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...
GECCO
2008
Springer
154views Optimization» more  GECCO 2008»
13 years 10 months ago
Automated shape composition based on cell biology and distributed genetic programming
Motivated by the ability of living cells to form specific shapes and structures, we present a computational approach using distributed genetic programming to discover cell-cell i...
Linge Bai, Manolya Eyiyurekli, David E. Breen
TABLEAUX
1998
Springer
14 years 11 days ago
A Tableaux Calculus for Ambiguous Quantification
Appeared in: Harrie de Swart, editor. Automated Reasoning with Analytic Tableaux and Related Methods, LNAI 1489, Springer, pages 232
Christof Monz, Maarten de Rijke
POPL
2000
ACM
14 years 11 days ago
Modular Refinement of Hierarchic Reactive Machines
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
Rajeev Alur, Radu Grosu
DLOG
1997
13 years 10 months ago
Classifying Description Logics
We describe a method for characterizing the expressive power of description logics. The method is essentially model-theoretic in nature, and it is applied to obtain expressiveness...
Natasha Kurtonina, Maarten de Rijke