Sciweavers

2024 search results - page 125 / 405
» A Formal Model of Multi-agent Computations
Sort
View
POPL
2012
ACM
13 years 11 months ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
TVCG
2012
201views Hardware» more  TVCG 2012»
13 years 6 months ago
Exact and Approximate Area-Proportional Circular Venn and Euler Diagrams
— Scientists conducting microarray and other experiments use circular Venn and Euler diagrams to analyze and illustrate their results. As one solution to this problem, this artic...
Leland Wilkinson
CADE
2007
Springer
16 years 4 months ago
Automated Reasoning in Kleene Algebra
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
Georg Struth, Peter Höfner
EMSOFT
2005
Springer
15 years 9 months ago
Using separation of concerns for embedded systems design
systems are commonly abstracted as collections of interacting components. This perspective has lead to the insight that component behaviors can be defined separately from admissi...
Ethan K. Jackson, Janos Sztipanovits
PERCOM
2010
ACM
15 years 2 months ago
Towards automated verification of autonomous networks: A case study in self-configuration
In autonomic networks, the self-configuration of network entities is one of the most desirable properties. In this paper, we show how formal verification techniques can verify the ...
JaeSeung Song, Tiejun Ma, Peter R. Pietzuch