Sciweavers

949 search results - page 107 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
FM
2009
Springer
98views Formal Methods» more  FM 2009»
14 years 3 months ago
Recursive Abstractions for Parameterized Systems
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
Joxan Jaffar, Andrew E. Santosa
QEST
2008
IEEE
14 years 3 months ago
CaVi -- Simulation and Model Checking for Wireless Sensor Networks
CaVi provides a uniform interface to state-of-the-art simulation methods and formal verification methods for wireless sensor network. Simulation is suitable to examine the behavi...
Athanassios Boulis, Ansgar Fehnker, Matthias Fruth...
JAIR
2008
123views more  JAIR 2008»
13 years 8 months ago
CTL Model Update for System Modifications
Model checking is a promising technology, which has been applied for verification of many hardware and software systems. In this paper, we introduce the concept of model update to...
Yan Zhang, Yulin Ding
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 3 months ago
Primitive words and roots of words
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
Gerhard Lischke
ARTS
1997
Springer
14 years 1 months ago
Regular Processes and Timed Automata
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
Pedro R. D'Argenio