Sciweavers

255 search results - page 41 / 51
» Proving BDI Properties of Agent-Oriented Programming Languag...
Sort
View
146
Voted
SIGSOFT
1996
ACM
15 years 9 months ago
Abstracting Dependencies between Software Configuration Items
ing Dependencies between Software Configuration Items CARL A. GUNTER University of Pennsylvania icle studies an abstract model of dependencies between software configuration items ...
Carl A. Gunter
POPL
2004
ACM
16 years 5 months ago
Asynchronous and deterministic objects
We present in this article a precise security model for data confidentiality in the framework of asynchronous and deterministic objects. Our underlying programming model is based ...
Denis Caromel, Ludovic Henrio, Bernard P. Serpette
ECOOP
2008
Springer
15 years 7 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
128
Voted
CIB
2005
41views more  CIB 2005»
15 years 5 months ago
A Partial-Repeatability Approach to Data Mining
Unlike the data approached in traditional data mining activities, software data are featured with partial-repeatability or parepeatics, which is an invariant property that can neit...
Kai-Yuan Cai, Yunfei Yin, Shichao Zhang
143
Voted
JUCS
2006
104views more  JUCS 2006»
15 years 5 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...