Sciweavers

949 search results - page 101 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
FM
1999
Springer
161views Formal Methods» more  FM 1999»
14 years 1 months ago
On-the-Fly Controller Synthesis for Discrete and Dense-Time Systems
We present novel techniques for efficient controller synthesis for untimed and timed systems with respect to invariance and reachability properties. In the untimed case, we give al...
Stavros Tripakis, Karine Altisen
ASPLOS
2009
ACM
14 years 9 months ago
QR decomposition on GPUs
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
Andrew Kerr, Dan Campbell, Mark Richards
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 7 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
AAAI
1990
13 years 10 months ago
Mechanizing Inductive Reasoning
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
Emmanuel Kounalis, Michaël Rusinowitch
BMCBI
2004
154views more  BMCBI 2004»
13 years 8 months ago
Computation of elementary modes: a unifying framework and the new binary approach
Background: Metabolic pathway analysis has been recognized as a central approach to the structural analysis of metabolic networks. The concept of elementary (flux) modes provides ...
Julien Gagneur, Steffen Klamt