Sciweavers

2514 search results - page 122 / 503
» The use of industrial-strength formal methods
Sort
View
SAS
2007
Springer
16 years 14 days ago
Modular Safety Checking for Fine-Grained Concurrency
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacer...
Cristiano Calcagno, Matthew J. Parkinson, Viktor V...
FM
2001
Springer
142views Formal Methods» more  FM 2001»
15 years 11 months ago
Model-Checking over Multi-valued Logics
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
Marsha Chechik, Steve M. Easterbrook, Victor Petro...
COMPOS
1997
Springer
15 years 10 months ago
Compositional Reasoning in Model Checking
The main problem in model checking that prevents it from being used for veri cation of large systems is the state explosion problem. This problem often arises from combining parall...
Sergey Berezin, Sérgio Vale Aguiar Campos, ...
IFL
1997
Springer
158views Formal Methods» more  IFL 1997»
15 years 10 months ago
A Compacting Garbage Collector for Unidirectional Heaps
A unidirectional heap is a heap where all pointers go in one direction, e.g. from newer to older objects. For a strict functional language, such as Erlang, the heap may be arranged...
Kent Boortz, Dan Sahlin
IMPERIAL
1994
15 years 10 months ago
Geometric logic as a Specification Language
The \observational content" of geometric logic is discussed and it is proposed that geometric logic is an appropriate basis for a Z-like speci cation language in which schema...
Steven Vickers