Sciweavers

1541 search results - page 78 / 309
» Tools and Techniques for Model Checking Networked Programs
Sort
View
87
Voted
SIGSOFT
2005
ACM
16 years 1 months ago
Lightweight object specification with typestates
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
Kevin Bierhoff, Jonathan Aldrich
ACOM
2006
Springer
15 years 6 months ago
Towards Design Tools for Protocol Development
Interaction protocols enable agents to communicate with each other effectively. Whereas several approaches exist to specify interaction protocols, none of them has design tools th...
Pinar Yolum
212
Voted
POPL
2009
ACM
16 years 1 months ago
Types and higher-order recursion schemes for verification of higher-order programs
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
Naoki Kobayashi
110
Voted
NJC
2006
88views more  NJC 2006»
15 years 16 days ago
Optimizing Slicing of Formal Specifications by Deductive Verification
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...
Ingo Brückner, Björn Metzler, Heike Wehr...
116
Voted
ICALP
2009
Springer
16 years 27 days ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner