Sciweavers

77 search results - page 14 / 16
» Building BSP Programs Using the Refinement Calculus
Sort
View
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 8 months ago
Cut Elimination for a Logic with Induction and Co-induction
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
Alwen Tiu, Alberto Momigliano
CAV
2006
Springer
95views Hardware» more  CAV 2006»
13 years 11 months ago
Yasm: A Software Model-Checker for Verification and Refutation
Example Guided Abstraction Refinement (CEGAR) [6] framework. A number of wellengineered software model-checkers are available, e.g., SLAM [1] and BLAST [12]. Why build another one?...
Arie Gurfinkel, Ou Wei, Marsha Chechik
ESOP
2008
Springer
13 years 9 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
WSC
2004
13 years 9 months ago
A Near Optimal Approach to Quality of Service Data Replication Scheduling
This paper describes an approach to real-time decisionmaking for quality of service based scheduling of distributed asynchronous data replication. The proposed approach addresses ...
Kevin Adams, Denis Gracanin, Dusan Teodorovic
IRI
2003
IEEE
14 years 1 months ago
A Formal Framework for Design Component Contracts
– Building large software systems out of existing software components can save time and cost. These software components range from architectural and design components to binary c...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan