Sciweavers

218 search results - page 29 / 44
» Verifying Safety Properties with the TLA Proof System
Sort
View
TPHOL
2003
IEEE
15 years 5 months ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning
AICCSA
2008
IEEE
266views Hardware» more  AICCSA 2008»
15 years 6 months ago
A novel flow-sensitive type and effect analysis for securing C code
In this paper, we present a novel type and effect analysis for detecting type cast errors and memory errors in C source code. Our approach involves a type system with effect, regi...
Syrine Tlili, Mourad Debbabi
102
Voted
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
15 years 5 months ago
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Roberto Bagnara, Enric Rodríguez-Carbonell,...
ECRTS
2004
IEEE
15 years 3 months ago
Pessimistic Concurrency Control and Versioning to Support Database Pointers in Real-Time Databases
In this paper we present a concurrency control algorithm that allows co-existence of soft real-time, relational database transactions, and hard real-time database pointer transact...
Dag Nyström, Mikael Nolin, Aleksandra Tesanov...
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
15 years 3 months ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider