Sciweavers

4257 search results - page 26 / 852
» The Logical Modularity of Programs
Sort
View
FM
2003
Springer
174views Formal Methods» more  FM 2003»
15 years 5 months ago
Model-Checking TRIO Specifications in SPIN
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
Angelo Morzenti, Matteo Pradella, Pierluigi San Pi...
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
14 years 12 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
POPL
2012
ACM
13 years 7 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
ICLP
1991
Springer
15 years 3 months ago
Nonmonotonic Reasoning with Well Founded Semantics
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
Luís Moniz Pereira, Joaquim Nunes Apar&iacu...
IAT
2009
IEEE
15 years 6 months ago
Modularity in BDI-Based Multi-agent Programming Languages
—This paper proposes a module-based vision for designing BDI-based multi-agent programming languages. The introduced concept of modules enables common programming techniques such...
Mehdi Dastani, Bas R. Steunebrink