Sciweavers

643 search results - page 72 / 129
» Semantic Determinism and Functional Logic Program Properties
Sort
View
APAL
2008
104views more  APAL 2008»
15 years 5 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
ATAL
2005
Springer
15 years 11 months ago
Bounded model checking knowledge and branching time in synchronous multi-agent systems
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
Xiangyu Luo, Kaile Su, Abdul Sattar, Qingliang Che...
POPL
2006
ACM
16 years 5 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
IJCAI
1989
15 years 6 months ago
Measure-Free Conditioning, Probability and Non-Monotonic Reasoning
Recent results in the foundations of probability theory indicate that a conditional probability can be viewed as a probability attached to a mathematical entity called a measure-f...
Didier Dubois, Henri Prade
ENTCS
2008
97views more  ENTCS 2008»
15 years 5 months ago
Meta-programming With Built-in Type Equality
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
Tim Sheard, Emir Pasalic