Sciweavers

5243 search results - page 280 / 1049
» Reasoning About Strategies
Sort
View
NFM
2011
252views Formal Methods» more  NFM 2011»
15 years 2 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer
SEMWEB
2005
Springer
16 years 28 days ago
The Personal Publication Reader
This application demonstrates how to provide personalized, syndicated views on distributed web data using Semantic Web technologies. The application comprises four steps: The infor...
Fabian Abel, Robert Baumgartner, Adrian Brooks, Ch...
NMR
2004
Springer
16 years 24 days ago
Belief dynamics and defeasible argumentation in rational agents
The BDI model provides what it is possibly one of the most promising architectures for the development of intelligent agents, and has become one of the most studied and well known...
Marcelo A. Falappa, Alejandro Javier García...
259
Voted
CADE
1998
Springer
15 years 11 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary
239
Voted
ELP
1991
15 years 11 months ago
Natural Semantics and Some of Its Meta-Theory in Elf
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
Spiro Michaylov, Frank Pfenning