Sciweavers

271 search results - page 13 / 55
» Observational Completeness on Abstract Interpretation
Sort
View
IFM
2009
Springer
183views Formal Methods» more  IFM 2009»
13 years 4 months ago
Challenges in the Specification of Full Contracts
Abstract. The complete specification of full contracts -- contracts which include tolerated exceptions, and which enable reasoning about the contracts themselves, can be achieved u...
Gordon J. Pace, Gerardo Schneider
BIRTHDAY
2005
Springer
14 years 8 days ago
Compositional Reasoning for Probabilistic Finite-State Behaviors
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...
Yuxin Deng, Catuscia Palamidessi, Jun Pang
JANCL
2007
115views more  JANCL 2007»
13 years 6 months ago
A logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goa...
Paul E. Dunne, Wiebe van der Hoek, Michael Wooldri...
ICALP
2005
Springer
14 years 7 days ago
Idealized Algol with Ground Recursion, and DPDA Equivalence
Abstract. We prove that observational equivalence of IA3 + Y0 (3rdorder Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable...
Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiew...
FSTTCS
2001
Springer
13 years 11 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari