Sciweavers

8109 search results - page 175 / 1622
» A Model of Component-Based Programming
Sort
View
HOTOS
2007
IEEE
15 years 9 months ago
Automatic Mutual Exclusion
We propose a new concurrent programming model, Automatic Mutual Exclusion (AME). In contrast to lock-based programming, and to other programming models built over software transac...
Michael Isard, Andrew Birrell
150
Voted
NMR
2004
Springer
15 years 10 months ago
A possibilistic approach to restore consistency in answer set programming
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
LOPSTR
2009
Springer
15 years 11 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...
LCPC
1993
Springer
15 years 9 months ago
Event-based Composition of Concurrent Programs
This paper presents a model for concurrent programming, where programs (concurrent program structures) are represented as composition expressions over component programs with suita...
Raju Pandey, James C. Browne
150
Voted
PPDP
2009
Springer
15 years 11 months ago
Scrap your boilerplate: prologically!
“Scrap Your Boilerplate” (SYB) is an established style of generic functional programming. The present paper reconstructs SYB within the Prolog language with the help of the un...
Ralf Lämmel