Sciweavers

3573 search results - page 508 / 715
» Reasoning about Codata
Sort
View
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...
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 9 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»
15 years 9 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
ATAL
2006
Springer
15 years 9 months ago
Predicting people's bidding behavior in negotiation
This paper presents a statistical learning approach to predicting people's bidding behavior in negotiation. Our study consists of multiple 2-player negotiation scenarios wher...
Ya'akov Gal, Avi Pfeffer