Sciweavers

1228 search results - page 25 / 246
» Continuations, proofs and tests
Sort
View
FORMATS
2008
Springer
13 years 9 months ago
Convergence Verification: From Shared Memory to Partially Synchronous Systems
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies ...
K. Mani Chandy, Sayan Mitra, Concetta Pilotto
IWFM
1998
13 years 9 months ago
Formal Engineering of the Bitonic Sort using PVS
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
Raphaël Couturier
TSE
2002
119views more  TSE 2002»
13 years 7 months ago
Testing Homogeneous Spreadsheet Grids with the "What You See Is What You Test" Methodology
Although there has been recent research into ways to design environments that enable end users to create their own programs, little attention has been given to helping these end u...
Margaret M. Burnett, Andrei Sheretov, Bing Ren, Gr...
CADE
2010
Springer
13 years 9 months ago
Sledgehammer: Judgement Day
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
Sascha Böhme, Tobias Nipkow
CSL
2006
Springer
13 years 11 months ago
Logical Omniscience Via Proof Complexity
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...
Sergei N. Artëmov, Roman Kuznets