Sciweavers

429 search results - page 31 / 86
» Theorem Proving Languages for Verification
Sort
View
WOTUG
2008
13 years 10 months ago
Mechanical Verification of a Two-Way Sliding Window Protocol
Abstract. We prove the correctness of a two-way sliding window protocol with piggybacking, where the acknowledgments of the latest received data are attached to the next data trans...
Bahareh Badban, Wan Fokkink, Jaco van de Pol
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 6 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
LPAR
2012
Springer
12 years 4 months ago
The TPTP Typed First-Order Form with Arithmetic
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Pe...
HYBRID
1998
Springer
14 years 26 days ago
Equations on Timed Languages
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
Eugene Asarin
ICFP
1999
ACM
14 years 28 days ago
A Simple Proof Technique for Certain Parametricity Results
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
Karl Crary