504 search results - page 25 / 101 » Reasoning about local properties in modal logic |
113
click to vote
AAAI
2008
15 years 2 months ago
2008
We design a representation based on the situation calculus to facilitate development, maintenance and elaboration of very large taxonomies of actions. This representation leads to...
225
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
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...
113
click to vote
TASE
2009
IEEE
15 years 8 months ago
2009
IEEE
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...
145
Voted
ICFP
2004
ACM
16 years 1 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
106
Voted
ECOI
2010
15 years 10 days ago
2010
We describe a semantic data validation tool that is capable of observing incoming real-time sensor data and performing reasoning against a set of rules specific to the scientific d...