Sciweavers

1941 search results - page 146 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
ENTCS
2002
97views more  ENTCS 2002»
15 years 3 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott
POPL
1993
ACM
15 years 7 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
151
Voted
EWCBR
2006
Springer
15 years 7 months ago
Contextualised Ambient Intelligence Through Case-Based Reasoning
Ambient Intelligence is a research area that has gained a lot of attention in recent years. One of the most important issues for ambient intelligent systems is to perceive the envi...
Anders Kofod-Petersen, Agnar Aamodt
154
Voted
CSL
2007
Springer
15 years 9 months ago
Focusing and Polarization in Intuitionistic Logic
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
Chuck Liang, Dale Miller
LOPSTR
2009
Springer
15 years 10 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...