Sciweavers

3658 search results - page 676 / 732
» The logic of proofs, semantically
Sort
View
SEFM
2009
IEEE
14 years 2 months ago
Specifying Interacting Components with Coordinated Concurrent Scenarios
Abstract. We introduce a visual notation for local specification of concurrent components based on message sequence charts (MSCs). Each component is a finite-state machine whose ...
Prakash Chandrasekaran, Madhavan Mukund
WECWIS
2009
IEEE
198views ECommerce» more  WECWIS 2009»
14 years 2 months ago
Bridging the Gap between User Attributes and Service Policies with Attribute Mapping
—People, companies, and public authorities can now have a strong on-line presence and a huge amount of interactions on the Internet, made possible by the impressive growth of the...
Davide Cerri, Francesco Corcoglioniti
EMSOFT
2009
Springer
14 years 2 months ago
Probabilistic modeling of data cache behavior
In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this g...
Vinayak Puranik, Tulika Mitra, Y. N. Srikant
IWMM
2009
Springer
122views Hardware» more  IWMM 2009»
14 years 2 months ago
Parametric heap usage analysis for functional programs
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
Leena Unnikrishnan, Scott D. Stoller
KCAP
2009
ACM
14 years 2 months ago
Formally measuring agreement and disagreement in ontologies
Ontologies are conceptual models of particular domains, and domains can be modeled differently, representing different opinions, beliefs or perspectives. In other terms, ontolog...
Mathieu d'Aquin