Sciweavers

949 search results - page 36 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
EKAW
1999
Springer
13 years 12 months ago
Formally Verifying Dynamic Properties of Knowledge Based Systems
Abstract. In this paper we study dynamic properties of knowledge-based systems. We argue the importance of such dynamic properties for the construction and analysis of knowledge-ba...
Perry Groot, Annette ten Teije, Frank van Harmelen
FM
2006
Springer
146views Formal Methods» more  FM 2006»
13 years 11 months ago
Exact and Approximate Strategies for Symmetry Reduction in Model Checking
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
Alastair F. Donaldson, Alice Miller
FATES
2004
Springer
14 years 1 months ago
Testing Deadlock-Freeness in Real-Time Systems: A Formal Approach
A Time Action Lock is a state of a Real-time system at which neither time can progress nor an action can occur. Time Action Locks are often seen as signs of errors in the model or ...
Behzad Bordbar, Kozo Okano
JUCS
2002
113views more  JUCS 2002»
13 years 7 months ago
The Origins and the Development of the ASM Method for High Level System Design and Analysis
: The research belonging to the Abstract State Machines approach to system design and analysis is surveyed and documented in an annotated ASM bibliography. The survey covers the pe...
Egon Börger
CONCUR
1990
Springer
13 years 11 months ago
A Temporal Calculus of Communicating Systems
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...
Faron Moller, Chris M. N. Tofts