Sciweavers

63 search results - page 9 / 13
» Predicate Abstraction via Symbolic Decision Procedures
Sort
View
CSL
2010
Springer
13 years 10 months ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous
VTC
2008
IEEE
196views Communications» more  VTC 2008»
14 years 4 months ago
Block Equalization and Generalized MLSE Arbitration for the HSPA WCDMA Uplink
Abstract— High Speed Packet Access (HSPA), the latest evolution of the Wideband Code Division Multiple Access (WCDMA) standard, provides higher uplink data rates using higher-ord...
Gregory E. Bottomley
FMICS
2006
Springer
14 years 1 months ago
Can Saturation Be Parallelised?
Abstract. Symbolic state-space generators are notoriously hard to parallelise. However, the Saturation algorithm implemented in the SMART verification tool differs from other seque...
Jonathan Ezekiel, Gerald Lüttgen, Radu Simini...
ICSE
2003
IEEE-ACM
14 years 9 months ago
Modular Verification of Software Components in C
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh ...
TOCL
2008
128views more  TOCL 2008»
13 years 9 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...