FM
2001
Springer
13 years 12 months ago
2001
Springer
A static program checker that performs modular checking can check one program module for errors without needing to analyze the entire program. Modular checking requires that each m...
FM
2001
Springer
13 years 12 months ago
2001
Springer
This paper describes a reduction technique which is very useful against the state explosion problem which occurs when model checking many distributed systems. Timestamps are often ...
FM
2001
Springer
13 years 12 months ago
2001
Springer
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
FM
2001
Springer
13 years 12 months ago
2001
Springer
We present a novel result for a logic for symbolic transition systems based on LOTOS processes. The logic is adequate with respect to bisimulation de ned on symbolic transition sys...
FM
2001
Springer
13 years 12 months ago
2001
Springer
FM
2001
Springer
13 years 12 months ago
2001
Springer
The Irish School of Constructive Mathematics (M♣ c ), which extends the VDM, exploits an algebraic notation based upon monoids and their morphisms for the purposes of abstract mo...
FM
2001
Springer
13 years 12 months ago
2001
Springer
FM
2001
Springer
13 years 12 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
CHARME
2001
Springer
13 years 12 months ago
2001
Springer
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
SFM
2010
Springer
14 years 16 days ago
2010
Springer