Sciweavers

4224 search results - page 668 / 845
» Reasoning about Choice
Sort
View
134
Voted
HASKELL
2007
ACM
15 years 9 months ago
Why it's nice to be quoted: quasiquoting for haskell
Quasiquoting allows programmers to use domain specific syntax to construct program fragments. By providing concrete syntax for complex data types, programs become easier to read, ...
Geoffrey Mainland
FASE
2009
Springer
15 years 9 months ago
Interface Generation and Compositional Verification in JavaPathfinder
Abstract. We present a novel algorithm for interface generation of software components. Given a component, our algorithm uses learning techniques to compute a permissive interface ...
Dimitra Giannakopoulou, Corina S. Pasareanu
ICCAD
2007
IEEE
165views Hardware» more  ICCAD 2007»
15 years 9 months ago
Automated refinement checking of concurrent systems
Stepwise refinement is at the core of many approaches to synthesis and optimization of hardware and software systems. For instance, it can be used to build a synthesis approach for...
Sudipta Kundu, Sorin Lerner, Rajesh Gupta
ACSC
2004
IEEE
15 years 9 months ago
Automatic Derivation of Loop Termination Conditions to Support Verification
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
Daniel Powell
AISC
2004
Springer
15 years 9 months ago
Proving and Constraint Solving in Computational Origami
Abstract. Origami (paper folding) has a long tradition in Japan's culture and education. We are developing a computational origami system, based on symbolic computation system...
Tetsuo Ida, Dorin Tepeneu, Bruno Buchberger, Judit...