Sciweavers

4047 search results - page 10 / 810
» Algebraic Model Checking
Sort
View
MLQ
2002
83views more  MLQ 2002»
13 years 8 months ago
Pseudomonadic Algebras as Algebraic Models of Doxastic Modal Logic
We generalize the notion of a monadic algebra to that of a pseudomonadic algebra. In the same way as monadic algebras serve as algebraic models of epistemic modal system S5, pseudo...
Nick Bezhanishvili
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 24 days ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
ICFEM
2007
Springer
14 years 12 days ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver
PG
2007
IEEE
14 years 2 months ago
Visualisation of Implicit Algebraic Curves
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...
Lionel Alberti, Bernard Mourrain
ECLIPSE
2007
ACM
14 years 14 days ago
MTSA: Eclipse support for modal transition systems construction, analysis and elaboration
In this paper we detail the design and implementation of an Eclipse plug-in that supports construction, analysis and elaboration of Modal Transition Systems. The plug-in supports ...
Nicolás D'Ippolito, Dario Fischbein, Howard...