Sciweavers

81 search results - page 1 / 17
» A Basic Logic for Reasoning about Connector Reconfiguration
Sort
View
FUIN
2008
147views more  FUIN 2008»
13 years 4 months ago
A Basic Logic for Reasoning about Connector Reconfiguration
Abstract. Software systems evolve over time. From a component-based software engineering perspective, this means that either the components of the system need to change, or, if com...
Dave Clarke
ENTCS
2006
117views more  ENTCS 2006»
13 years 4 months ago
Reasoning About Imperative Quantum Programs
A logic for reasoning about states of basic quantum imperative programs is presented. The models of the logic are ensembles obtained by attaching probabilities to pairs of quantum...
Rohit Chadha, Paulo Mateus, Amílcar Sernada...
ENTCS
2007
109views more  ENTCS 2007»
13 years 4 months ago
Symbolic Model Checking for Channel-based Component Connectors
The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specificatio...
Sascha Klüppelholz, Christel Baier
CSL
2006
Springer
13 years 8 months ago
Reasoning About States of Probabilistic Sequential Programs
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
Rohit Chadha, Paulo Mateus, Amílcar Sernada...
ESOP
2010
Springer
14 years 2 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker