Sciweavers

4595 search results - page 746 / 919
» Reasoning about Plans
Sort
View
ICCAD
2007
IEEE
165views Hardware» more  ICCAD 2007»
14 years 1 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
14 years 1 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
14 years 1 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...
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
14 years 1 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
CAV
2004
Springer
130views Hardware» more  CAV 2004»
14 years 1 months ago
Global Model-Checking of Infinite-State Systems
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
Nir Piterman, Moshe Y. Vardi