Sciweavers

BIRTHDAY
2008
Springer
13 years 10 months ago
Linear Recurrence Relations for Graph Polynomials
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
Eldar Fischer, Johann A. Makowsky
BIRTHDAY
2008
Springer
13 years 10 months ago
Temporal Verification of Probabilistic Multi-Agent Systems
Abstract. Probabilistic systems of interacting intelligent agents are considered. They have two sources of uncertainty: uncertainty of communication channels and uncertainty of act...
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars ...
BIRTHDAY
2008
Springer
13 years 10 months ago
From Domain to Requirements
This is a discursive paper. That is, it shows some formulas (but only as examples so that the reader may be convinced that there is, perhaps, some substance to our claims), no theo...
Dines Bjørner
BIRTHDAY
2008
Springer
13 years 10 months ago
A Category of Explicit Fusions
Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotati...
Filippo Bonchi, Maria Grazia Buscemi, Vincenzo Cia...
BIRTHDAY
2008
Springer
13 years 10 months ago
Some Results on the Expressive Power and Complexity of LSCs
Abstract. We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a...
David Harel, Shahar Maoz, Itai Segall
BIRTHDAY
2008
Springer
13 years 10 months ago
The Church-Turing Thesis over Arbitrary Domains
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...
Udi Boker, Nachum Dershowitz
BIRTHDAY
2008
Springer
13 years 10 months ago
Dynamically Evolvable Dependable Software: From Oxymoron to Reality
We analyze the main motivations that lead to the present need for supporting continuous software evolution, and discuss some of the reasons for change requirements. Achieving softw...
Carlo Ghezzi, Paola Inverardi, Carlo Montangero
BIRTHDAY
2008
Springer
13 years 10 months ago
History Dependent Automata for Service Compatibility
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
Vincenzo Ciancia, Gian Luigi Ferrari, Marco Pistor...
BIRTHDAY
2008
Springer
13 years 10 months ago
StonyCam: A Formal Framework for Modeling, Analyzing and Regulating Cardiac Myocytes
Abstract. This paper presents a formal framework, experimental infrastructure, and computational environment for modeling, analyzing and regulating the behavior of cardiac tissues....
Ezio Bartocci, Flavio Corradini, Radu Grosu, Emanu...