Sciweavers

749 search results - page 128 / 150
» Combinatory Models and Symbolic Computation
Sort
View
LICS
1998
IEEE
15 years 1 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
FTCS
1998
114views more  FTCS 1998»
14 years 11 months ago
Verification of a Safety-Critical Railway Interlocking System with Real-Time Constraints
Ensuring the correctness of computer systems used in lifecritical applications is very difficult. The most commonly used verification methods, simulation and testing, are not exha...
Vicky Hartonas-Garmhausen, Sérgio Vale Agui...
TAP
2010
Springer
134views Hardware» more  TAP 2010»
14 years 7 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney
BICA
2010
14 years 5 months ago
Explanatory Aspirations and the Scandal of Cognitive Neuroscience
In this position paper we argue that BICA must simultaneously be compatible with the explanation of human cognition and support the human design of artificial cognitive systems. Mo...
Ross Gayler, Simon D. Levy, Rens Bod
SMA
2008
ACM
149views Solid Modeling» more  SMA 2008»
14 years 10 months ago
Exact arrangements on tori and Dupin cyclides
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...
Eric Berberich, Michael Kerber