Sciweavers

783 search results - page 73 / 157
» Compositional Reasoning in Model Checking
Sort
View
132
Voted
CSL
1999
Springer
15 years 6 months ago
A Truly Concurrent Semantics for a Simple Parallel Programming Language
Abstract. This paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, parallelism and...
Paul Gastin, Michael W. Mislove
137
Voted
IPPS
1999
IEEE
15 years 6 months ago
Mechanical Verification of a Garbage Collector
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
Klaus Havelund
IPPS
2007
IEEE
15 years 8 months ago
FixD : Fault Detection, Bug Reporting, and Recoverability for Distributed Applications
Model checking, logging, debugging, and checkpointing/recovery are great tools to identify bugs in small sequential programs. The direct application of these techniques to the dom...
Cristian Tapus, David A. Noblet
SCP
2010
155views more  SCP 2010»
15 years 23 days ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
232
Voted
DLOG
2011
14 years 5 months ago
A Technique for Handling the Right Hand Side of Complex RIAs
This paper examines a new technique based on tableau, that allows one to introduce composition of roles from the right hand side of complex role inclusion axioms (RIAs). Our motiva...
Milenko Mosurovic, Nenad Krdzavac