Sciweavers

506 search results - page 49 / 102
» Where Is the Value in a Program Verifier
Sort
View
INTERSENSE
2006
ACM
15 years 11 months ago
Programming wireless sensor networks with logical neighborhoods
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
Luca Mottola, Gian Pietro Picco
PPDP
2004
Springer
15 years 11 months ago
Model checking object petri nets in prolog
Object Petri nets (OPNs) provide a natural and modular method for modelling many real-world systems. We give a structure-preserving translation of OPNs to Prolog by encoding the O...
Berndt Farwer, Michael Leuschel
IAT
2009
IEEE
16 years 18 days ago
Clustering with Constrained Similarity Learning
—This paper proposes a method of learning a similarity matrix from pairwise constraints for interactive clustering. The similarity matrix can be learned by solving an optimizatio...
Masayuki Okabe, Seiji Yamada
CONCUR
2007
Springer
16 years 16 hour ago
A Marriage of Rely/Guarantee and Separation Logic
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
Viktor Vafeiadis, Matthew J. Parkinson
HASE
2007
IEEE
15 years 9 months ago
Multiple Pre/Post Specifications for Heap-Manipulating Methods
Automated verification plays an important role for high assurance software. This typically uses a pair of pre/post conditions as a formal (but possibly partial) specification of e...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...