Sciweavers

949 search results - page 26 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
JFP
2010
107views more  JFP 2010»
13 years 6 months ago
Lightweight checkpointing for concurrent ML
Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execut...
Lukasz Ziarek, Suresh Jagannathan
FMICS
2008
Springer
13 years 9 months ago
Efficient Symbolic Model Checking for Process Algebras
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
José Vander Meulen, Charles Pecheur
MEMOCODE
2003
IEEE
14 years 24 days ago
Bridging CSP and C++ with Selective Formalism and Executable Specifications
CSP (Communicating Sequential Processes) is a useful algebraic notation for creating a hierarchical behavioural specification for concurrent systems, due to its formal interproces...
William B. Gardner
TOMS
2008
80views more  TOMS 2008»
13 years 7 months ago
Updating an LU Factorization with Pivoting
We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivo...
Enrique S. Quintana-Ortí, Robert A. van de ...
DAC
1994
ACM
13 years 11 months ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...